{"title":"Simulating The Global Directory Service With OPNET","authors":"A. Andrianopoulos, D. Chadwick","doi":"10.1109/SIMSYM.1993.639126","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639126","url":null,"abstract":"his paper describes the use of the OPNET simulation package to build a model of the global directory service. Ihe global directory service is bas& on the modek and data structures described in the joint ISO/CCIlTStandard - X 500: Ihe Directory. model. The standard describes how the data in the database is to be constructed. It also specifies a schema that can be used to control actual data stored in a live system. Most importantly, from the Perspective of the current research, the standard describes how the global database is to be distributed between application proceases worldwide. Section 2 gives a brief summary of how this is achieved. More detailed explanations can be found in papers by Chadwick (2,3) and Radacati (4), or in the Standard itself. The original version of the standard, finalised in 1988, did not support replication of the data between the application processes (called Directory System Agents, or DSAs). This model is due to be finalised in October 1992. Replication is expected to significantly enhance the performance of the Directory, but by how much has not been quantified.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130613130","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":"Implementation And Simulation Of Acquisition Consistency For Cache-based Multiprocessors","authors":"Yung-Syau Chen","doi":"10.1109/SIMSYM.1993.639057","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639057","url":null,"abstract":"Cache-based shared memory multiprocessing o$ers a cost-eflective solution for most applications by reducing bus contention as well as memory access latency. However, incorporating private caches into shared memory multiprocessors leads to coherence problems. The frequency of the communication between processors may exceed the fundamental requirements of an algorithm due to the memory consistency model. This paper presents a new model of memory consistency called Acquisition Consistency (AC) to reduce the immoderate communication in a cache-based multiprocessor. Other cache consistency models are evaluated; the evaluation indicates that a system with our model has the greatest potential to eliminate the false-sharing. Under the scheme for AC, programmers are not required to explicitly correlate shared data with locks and do not have to insert additional synchronization into programs. Simulation resulis indicate that with little overhead, this scheme significantly reduces the miss rate and the traJgic amount in almost all applications.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116806222","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 Stochastic Simulation Model Of Family Income","authors":"J. Huntley, D. Tepper, T. Wong","doi":"10.1109/SIMSYM.1993.639160","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639160","url":null,"abstract":"This paper describes a stochastic simulation model of family income. Our goal is to implement a stochastic simulation experiment which provides an alternative view on the declining trend of U.S. real family income suggested in the joint study by The Children's Defense Fund and The Northeastern University's Center For Labor Studies. Thus, a major part of this paper is the development of the simulation model of family income. Also the simulation experiment will extensively rely on the modern computer algebra system Mathe- matica.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129612873","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 C++ Environment For Modeling Communication Systems","authors":"W. Dobosiewicz, P. Gburzynski","doi":"10.1109/SIMSYM.1993.639133","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639133","url":null,"abstract":"Design of a low-level communication protocol must take into account several physical phenomena which are irrelevant at a higher level. The correct interpretation of these phenomena is critical to ensure both the protocol’s agreement with its specification and the eficient utilization of the channel bandwidth. We introduce SMURPH-an object oriented simulator for investigating physical communication systems a2 the medium access control level. SMURPH can be viewed as a combination of a protocol specification system with an emulated environment for executing protocol specifications. This environment is realistic in the sense that it reflects the relevant communication phenomena occurring in real physical channels. SMURPH can be used to aid the protocol design process: the designer can evaluate the protocol performance and test the protocol for correctness without resorting to a physical implementation.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123535265","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 Measures For Several Opt Imitations To A Distributed Digital System Simulator","authors":"Avinash C. Palaniswamy, S. Aji, P. Wilsey","doi":"10.1109/SIMSYM.1993.639049","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639049","url":null,"abstract":"Technological advances have resulted in the design of large integrated circuits, and with it the need for fast simulation to decrease the design-to-market time. Parallel and distributed digital simulation has been recognized as the leading approach to provide fast simulation of digital circuits. The Time Warp Mechanism (T WM) implement:? the concept of Virtual Time to optimistically synchronize parallel simulation. However, the successful utili.ration of the Time Warp mechanism has been plagued by the time and space overheads of rollback, namely: state saving, state restoration, and event reprocessing. Several optimizations to reduce these overheads have been proposed in the literature. This paper presents empirical data relating the effectiveness of several of these Optimizations to the domain of digital system simulation. In particular, we present performcince results from lazy reevaluation, lazy cancellation, periodic state savings, and bounded time windows.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126522265","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":"The Use Of VHDL As The Database Forl The Complete Electronic Hardware Design Cycle","authors":"W. Hanna","doi":"10.1109/SIMSYM.1993.639128","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639128","url":null,"abstract":"","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130265384","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":"The Simulation Of Coadaptive Decision-making","authors":"A. Glockner","doi":"10.1109/SIMSYM.1993.639095","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639095","url":null,"abstract":"Decision-making in distributed computing systems is complicated by the introduction of communication delays. This results in uncertainty about both the global system state and the current actions of the system. One of the methods of addressin this difficulty making. By constructing the decision-making process as a set of autonomous agents that can individually learn from feedback, the set of agents adapt together, or coadapt, to form a good, though not necessarily op timal, global decision process. In this paper, a model of coadaptive decisionmaking in a small distributed computing system is described and justified. Some of the simulation results from this ongoing investigation are presented with ap propriate conclusions.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132454058","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":"Throughput Analysis Of Multiple-bus Multiprocessor Systems With Simultaneous Possession Of Common Resources","authors":"I. Onyuksel","doi":"10.1109/SIMSYM.1993.639072","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639072","url":null,"abstract":"To answer the questions for the performance issues of multiple-bus multiprocessor systems under general conditions, Q discrete-event simulation model has been developed. This model has been analyzed for different types of probability distributions for the random variables A = processing times and B = memory access times. Simulation experiments show that the toe@ cient of variation of B , CBI has a significant effect on the system performance, especially for CB > 1, but the effect of CA is negligible if A is either hypoor h yperexponential l y distributed. Processing eficiency, memory utalazation and the percent of queued processors are some of the performance metrics used in our simulation model. According to simulation results, if the number of buses is equal to halfthe minimum value of the number of processors and the number of memory modules, the corresponding bus-deficient system behaves as a bus-suficient system. The simulation programs, the subroutines for random variate generation and the data structures were all implemented in programming language C in our Unix-based Encore MuNiMax Computing System.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130484122","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":"Object Oriented Simulation For Air Traffic Control Training","authors":"A. Kornecki","doi":"10.1109/SIMSYM.1993.639147","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639147","url":null,"abstract":"The general idea of using an object oriented approach is as old as discrete simulation. Some concepts were implemented in the design of one of the first comprehensive discrete simulation languages, SIMULA. However, only the progress in artificial intelligence techniques related to knowledgelworld representation and the advances in software (e.g. SMALLTALK) have paved the way to the full utilization of an object-oriented approach. This paper describes a simulation model of an Air Traffic Control (ATC) en-route environment. The ATC system is defined by numerous objects of different types, interacting with each other. The objects interact by sending messages (controller to controller, controller to pilot, pilot to airplane). Thus, an object oriented approach is an ideal paradigm to represent the ATC system. A prototype of such a system has been developed using MODSIM I1 - an object oriented simulation language that is a product of the CACl Products Company. The system and its applications are described.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275924","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}
L. Delcambre, Jyotsna Narayanswamy, Lissa F. Pollacia
{"title":"Simulation Of The Object Flow Model: A Conceptual Modeling Language For Object-driven Applications","authors":"L. Delcambre, Jyotsna Narayanswamy, Lissa F. Pollacia","doi":"10.1109/SIMSYM.1993.639138","DOIUrl":"https://doi.org/10.1109/SIMSYM.1993.639138","url":null,"abstract":"The Object Flow Model (OFM) has been developed as a conceptual modeling language (CML) for object-driven (i.e. datadriven, object-oriented) applications. The model includes an object-oriented database that provides both a semantic data model to describe the stnrcture of complex objects and local methods associated with the classes appearing in the class hiermhy. The major contribution of the OFM is the dynamic modeling component called the Object Flow Diagram. Process steps are displayed in a directed graph; pmesses are trigered by the availability of the relevant objects that satisfy the guard The OFD was inspired by network-base4 process-oriented, discrete event simulation but adopts formal semantics associated with a deductive database rule language. This paper presents the OFM and discusses the suitability of the model to serve as a simulation model for an application as well as various possibilities for implementing an OFM simulator. This research clearly demonstrates that a simulation language with the power of the OFM should be implemented using both traditional event list technology (to handle the unconditional events) combined with qeert systemstyle matching technology to handle guard enforcement.","PeriodicalId":204479,"journal":{"name":"[1993] Proceedings 26th Annual Simulation Symposium","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116617604","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}