{"title":"Parallel discrete event simulation on shared-memory multiprocessors","authors":"P. Konas, P. Yew","doi":"10.1109/SIMSYM.1991.151498","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151498","url":null,"abstract":"This paper describes the implementation and the performance study of three parallel discrete event simulation methods on a shared memory machine. These methods, which share a single user interface, include the Chandy-Misra paradigm with deadlock avoidance; the Time Warp approach with direct, aggressive, and lazy cancellation; and a hybrid approach, which exploits the parallelism available at each point in simulated time. In this study the authors also examine the impact of task-partitioning and of processor self-scheduling on the efficient implementation of the above methods. Two kinds of systems are simulated: a synchronous multiprocessor machine and an asynchronous toroid network with FCFS server nodes. The performance of the implemented methods is discussed, and conclusions are drawn from the obtained results.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128456132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using Time Warp for computer network simulations on transputers","authors":"F. Tallieu, F. Verboven","doi":"10.1109/SIMSYM.1991.151494","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151494","url":null,"abstract":"The implementation of a Time Warp simulation frame is examined on a multitransputer machine. As computer networks can be considered as an integrated part of machine architecture, reliable evaluation tools for the development and study of protocols are a necessity. Simulation constitutes the only possible tool to obtain detailed information in this domain. The complexity of computer networks makes their simulation computationally complex and also very slow. That is why it is interesting to consider distributed simulation approaches. A major goal of this work is to determine whether the optimistic Time Warp algorithm is advantageous for the simulation of computer networks. The results presented indicate that the efficiency of the Time Warp technique seems to depend heavily on the characteristics of the simulation model.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121273434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Interactive SPEEDES","authors":"J. Steinman","doi":"10.1109/SIMSYM.1991.151499","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151499","url":null,"abstract":"Interactive parallel simulations involving humans or external software modules can be difficult to support. While many parallel simulation algorithms avoid acknowledging the need for external interactions, most real-world applications demand this capability. A new general purpose synchronous parallel environment for emulation and discrete event simulation (SPEEDES) has been developed which easily supports interactive simulations. The SPEEDES algorithm is described, basic elements of interactive simulations are discussed, and the solution which was implemented in SPEEDES is given.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114682129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"GAME: an object-oriented approach to computer animation in flexible manufacturing system modelling","authors":"D. Breugnot, M. Gourgand, D. Hill, P. Kellert","doi":"10.1109/SIMSYM.1991.151508","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151508","url":null,"abstract":"Graphically animating results from a simulation is typically a tedious programming task. GAME (graphic animator for modelling and evaluation) is a graphical editor and animator dedicated to discrete flow manufacturing system which authorizes both the building of a manufacturing system topology with graphical objects and the animation of these objects via discrete event simulation results. The object-oriented design of GAME allowed other domain tackling (computer systems, networks, administrative systems, . . .). GAME is independent of the simulator used upstream and was mainly designed for communication, decision-making, simulation model validation and debugging. An implementation of GAME was achieved with C++. The current version has been validated on many industrial sites with the QNAP2, and SIMAN simulation software.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134604755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulation and analysis of computer systems with multiple supercomputers","authors":"A. Miller, G. Gerteisen, C. Bird","doi":"10.1109/SIMSYM.1991.151485","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151485","url":null,"abstract":"This paper describes techniques for simulating computer systems with multiple supercomputers operating under peer-level control and communicating through shared memory. Techniques for visual analysis of the behavior of the system over time are also described.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133456790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A case against event-driven simulation for digital system design","authors":"G. Jennings","doi":"10.1109/SIMSYM.1991.151502","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151502","url":null,"abstract":"The author argues that the electronic design community too often tries to apply discrete event simulation technology, such as VHDL, to applications for which it is ill-suited. In particular he considers the simulation of synchronous digital designs, and reports two orders of magnitude speed improvement by using compiled simulation instead. The basic design of a simple compiled simulator is outlined.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125989946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulating the performance of a multiprocessor operating system","authors":"H. Taheri, B. Askins","doi":"10.1109/SIMSYM.1991.151490","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151490","url":null,"abstract":"The authors constructed a simulation model, using the PAWS simulation modeling tools, to predict the performance of a shared memory multiprocessor operating system. The operating system is divided into five distinct sections, called empires. They used the model to predict the efficiency of this paradigm of multiprocessing for the Hewlett-Packard HP-UX Release 8.0 operating system. The simulation results show that the empires architecture is effective in providing enough concurrency for a four-way computer under a program development workload. The authors describe the model and its parameters, present and discuss the results, provide a statistical analysis of the data, and analyze the results.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115663572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Supercritical speedup (discrete event simulation)","authors":"D. Jefferson, P. Reiher","doi":"10.1109/SIMSYM.1991.151500","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151500","url":null,"abstract":"The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critical time of any event in a simulation is a lower bound on the time it takes to execute a simulation using any conservative simulation mechanism, and is also a lower bound on the time taken by some optimistic methods. However, at least one optimistic mechanism is able to beat the critical path bound in a nontrivial way. The authors make a systematic study of the meaning of the critical path in parallel simulation, and describe criteria that determine when a simulation is bounded by its length and when it is not. They show (again) that no conservative mechanism can beat the critical path, but that at least four known optimistic mechanisms are all capable of supercritical speedup. They give performance data for the JPL Time Warp operating system showing two specially constructed applications using different methods to beat the critical path.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130890644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model verification in lambda sigma : a type inference approach","authors":"E. Kortright","doi":"10.1109/SIMSYM.1991.151516","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151516","url":null,"abstract":"The author describes a number of model analysis and verification operations based on type inference in the lambda sigma simulation language. lambda sigma is a simulation language based on the typed lambda -calculus. lambda sigma entities correspond to typed lambda -expressions, while lambda sigma activities correspond to subtypes. Thus, entities can be generated by means of type-introduction rules, and operations can be defined on entities by means of type elimination and equality rules. Premises of the form e in tau in an introduction rule used to create a new entity can be satisfied by substituting for e any entity of type tau in a neighboring activity. It is then possible to perform a number of model analysis and verification operations using type inference algorithms available for the typed lambda -calculus.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116230571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"High speed routing in a parallel processing environment: a simulation study","authors":"P. Dowd, M. Carrato","doi":"10.1109/SIMSYM.1991.151486","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151486","url":null,"abstract":"This paper examines techniques to achieve high speed routing in a distributed memory parallel computer environment. This paper develops a model to analyze the intra-node routing latency, and demonstrates that it may be the dominant factor of the overall system performance. This paper introduces three approaches, with varying levels of relative complexity, to improve intra-node routing capability. A simulation study has been developed to compare the behavior of each technique with three different topologies. The approach presented in this paper applies the advantages of dynamic interconnection networks to the problem of static interconnection network routing.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133278553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}