{"title":"Modeling and simulation of an i860-based multiprocessor","authors":"A. Finn, M. F. Griffin, W. McClurg","doi":"10.1109/SIMSYM.1991.151491","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151491","url":null,"abstract":"This paper presents the modeling and simulation of a multiprocessor architecture. The methodology included cycle-by-cycle uniprocessor simulation, trace driven multiprocessor simulation, and high-level simulation in an architecture design and assessment system (ADAS). The multiprocessor was designed for digital signal processing (DSP) and used single-chip Intel i860 processors with a shared global memory. The ADAS simulations were found to be most useful for initial simulations, scheduling, and feasibility assessment. The trace driven simulations were found to be very useful for predicting exact performance and for evaluating changes to the DSP algorithms.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"12 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":"127122504","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 simulation study of a CSMA/CD with connected data links","authors":"Y. Al-Salqan, C. Kang, J. Herzog, E. Park","doi":"10.1109/SIMSYM.1991.151471","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151471","url":null,"abstract":"Since local area networks (LANs) have become a vital part of the modern computing, a great deal of effort has been devoted to their design, standardization, and implementation. Most of this work has been based on a simple linear bus or ring topology (Ethernet, Token Bus, and Token Ring). However, the linear bus and ring topology networks have significant disadvantages in certain applications. Recently, the authors proposed a new hybrid architecture local area network, Hybrid-Meshnet. The Hybrid-Meshnet allows an insertion and/or deletion of data links into/from existing local area networks: Ethernet or Token Ring. The earlier works have concentrated on a token ring with connected data links. In this paper, the authors investigate another Hybrid-Meshnet network architecture, CSMA/CD, with connected data links. A simulation model is designed for the purpose of performance measure of the proposed network. Simulation results indicate that, even with small increase in link cost by addition of direct data links, performance can be improved significantly over a pure Ethernet.<<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":"128532395","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":"Advances in computer simulation","authors":"Alan H. Rutan","doi":"10.1109/SIMSYM.1991.151478","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151478","url":null,"abstract":"Computer simulation is currently undergoing an explosion of innovation and a dramatic increase in its range of application. New hardware and software paradigms, such as the transputer, massive parallelism and emergent artificial intelligence (AI) methodologies, are helping to fuel this surge. A wide range of advances in simulation research presented at the 24th Annual Simulation Symposium is discussed in the context of this framework.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"27 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":"133034669","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}
D. B. Pratt, P. Farrington, C. Basnet, H. C. Bhuskute, M. Kamath, J. Mize
{"title":"A framework for highly reusable simulation modeling: separating physical, information, and control elements","authors":"D. B. Pratt, P. Farrington, C. Basnet, H. C. Bhuskute, M. Kamath, J. Mize","doi":"10.1109/SIMSYM.1991.151512","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151512","url":null,"abstract":"This paper presents a conceptual framework for simulation modeling which emphasizes model reusability. Reusability is achieved through the provision of separate modeling constructs for physical, information, and control/decision elements of a system. These constructs contribute to a modular environment in which the modeling elements, once created, can be stored in a modeling database and retrieved. While this framework can be implemented within traditional simulation modeling environments, an object oriented modeling environment appears to offer a potentially superior approach.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"97 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":"128810063","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":"Performance modelling of a multiprocessor bus architecture","authors":"A. Hajare","doi":"10.1109/SIMSYM.1991.151489","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151489","url":null,"abstract":"This paper describes a discrete event simulation model of the bus architecture of a tightly coupled multiprocessor system. The newly announced multiprocessor system was being evaluated as a replacement for four old minicomputers with shared memory. The multiprocessor system was not yet available for benchmarking. Therefore, the models described here, along with other models, were used to estimate the performance of the multiprocessor system based on workload characterization of the old minicomputers that were being replaced. Two tools were used to build the simulation models. The performance models were first developed using the Performance Analysts Workbench System (PAWS). The second modelling tool, Network II.5, was subsequently used to model the same computer system as a part of an evaluation of that tool. A comparison of the models demonstrated the differences between the two tools.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"11 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":"116720228","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":"Lazy Queue: an efficient implementation of the pending-event set","authors":"R. Rönngren, J. Riboe, R. Ayani","doi":"10.1109/SIMSYM.1991.151506","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151506","url":null,"abstract":"A new priority queue implementation, the Lazy Queue, is presented in this paper. It is tailored to handle the pending event set encountered in discrete event simulation. The Lazy Queue is a multi-list variety where the sorting process is delayed until a point near the time where the elements are to be dequeued. The queue access time has been measured and compared with the access times of an implicit heap and a calendar queue. The experimental results indicate that the Lazy Queue is superior to these priority queue implementations.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"447 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":"115100800","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":"Neural network approach to zero-one optimal covering problem","authors":"A. R. Khan, A. Marudarajan, C. A. Goben","doi":"10.1109/SIMSYM.1991.151480","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151480","url":null,"abstract":"This paper reports the investigation of the neural network solution to the zero-one optimal covering problem via computer simulation. The key idea used in this exploration is that for every covering problem there exists an equivalent integer linear programming problem which can be solved by modifying the linear programming neural net circuit proposed by Tank and Hopfield. Simulation results indicate that this method works very well.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"10 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":"114614269","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 program-driven simulation model of an MIMD multiprocessor","authors":"F. Dahlgren","doi":"10.1109/SIMSYM.1991.151484","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151484","url":null,"abstract":"A simulation model that supports very accurate modeling of multiprocessors with a hierarchical, packet-switched interconnection network and private caches is explored. The simulation system contains workload simulators and a memory system simulator. The workload simulators are program-driven, i.e. they actually execute programs. The time unit of the simulator is the time between two consecutive memory references from the processors. The performance of the simulation model, although acceptable, could be improved using a trace-driven approach. The author shows that results obtained from trace-driven simulation methods in the course of multiprocessor performance evaluation are generally not valid. Furthermore, he shows that in the evaluation of certain processor architectural features, such as non-blocking architectures, the program-driven approach is necessary.<<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":"124539348","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":"Filter: an algorithm for reducing cascaded rollbacks in optimistic distributed simulations","authors":"Atul Prakash, R. Subramanian","doi":"10.1109/SIMSYM.1991.151496","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151496","url":null,"abstract":"The authors describe a new algorithm, called Filter, that limits the propagation of erroneous computations in optimistic discrete-event distributed simulations. In the proposed algorithm, each message carries a bounded amount of dependency information that describes the assumptions made in the generation of the message, and, in addition, processes keep track of straggler events that have occurred in the system. This knowledge is used by processes to 'filter' out messages that depend on a preempted state by discarding them upon receipt. The authors describe the algorithm and its use in conjunction with time-warp, suggest several ways of reducing its potential overhead by adjusting the extent of filtering, and point out several interesting performance tradeoffs that they are currently exploring.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"19 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":"116946911","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 provably correct, non-deadlocking parallel event simulation algorithm","authors":"Meng-Lin Yu, Sumit Ghosh, E. Debenedictis","doi":"10.1109/SIMSYM.1991.151493","DOIUrl":"https://doi.org/10.1109/SIMSYM.1991.151493","url":null,"abstract":"This paper first summarizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES, for asynchronous discrete event simulation. The proof not only makes the algorithm complete but helps better understand the seemingly complicated algorithm. YADDES constructs a special acyclic data-flow network from the network of simulation models to keep track of the run time data dependencies, which permits a model to be correctly executed as far ahead in time as possible. The data-flow network also uses the asynchronous parallel discrete event driven technique and runs concurrently with the network of simulation models. This paper also reports a preliminary implementation of the algorithm and discusses the algorithm's limitations.<<ETX>>","PeriodicalId":174131,"journal":{"name":"[1991] Proceedings of the 24th Annual Simulation Symposium","volume":"172 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":"132504574","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}