{"title":"Automatic incremental state saving","authors":"WestDarrin, PanesarKiran","doi":"10.1145/238793.238820","DOIUrl":"https://doi.org/10.1145/238793.238820","url":null,"abstract":"We present an Incremental State Saving technique for which the state saving calls are inserted automatically by directly editing the application executable. This method has the advantage of being e...","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115128389","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":"Actor based parallel VHDL simulation using time warp","authors":"KrishnaswamyVenkatram, BanerjeePrithviraj","doi":"10.1145/238793.238836","DOIUrl":"https://doi.org/10.1145/238793.238836","url":null,"abstract":"One of the methods used to reduce the time spent simulating VHDL designs is by parallelizing the simulation. In this paper, we describe the implementation of an object-oriented Time Warp simulator ...","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123153508","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":"Background execution of time warp programs","authors":"D. CarothersChristopher, M. FujimotoRichard","doi":"10.1145/238793.238802","DOIUrl":"https://doi.org/10.1145/238793.238802","url":null,"abstract":"","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128105139","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":"How to integrate shared variables in distributed simulation","authors":"Horst Mehl, Stefan Hammes","doi":"10.1145/233498.233499","DOIUrl":"https://doi.org/10.1145/233498.233499","url":null,"abstract":"Although users may want to employ shared variables when they program distributed simulation applications, almost none of the currently existing distributed simulation systems does offer this facility. In this paper, we systematically present new algorithms which provide consistent shared variables for distributed simulation applications. Basically, our approach combines known techniques to realize distributed shared memory with simulation algorithms. As there are essentially two classes of distributed simulation algorithms---conservative and optimistic---we study shared variable algorithms for both of them and propose five new algorithms. Initial performance measurements of a prototype implementation are described. Potential performance degradation by the usage of shared variables is expected to depend to a high degree on the access behavior of the simulation application. Having the abstraction of shared variables available provides the user with a simple concept to design distributed simulation applications in the presence of inherent global data.","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124424841","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":"An overview of the design and implementation of a large and complex simulation effort: the Naval Research Laboratory's Tactical Oceanography Simulation Laboratory","authors":"M. R. Fernandez, John W. Ellis, James E. Miller","doi":"10.1145/233498.233500","DOIUrl":"https://doi.org/10.1145/233498.233500","url":null,"abstract":"As one would anticipate, there is considerable interest within the military community for developing the capability to accurately simulate the behavior of sound in any of the oceans of the world under any of the conditions which might arise there [1,2,3]. With this capability the quality of training could be increased and the associated training costs could be reduced; performance requirements for new systems could be examined under a variety of conditions which include working with all combinations of proposed, prototype, and operational systems functioning in both familiar as well as untested environments; tactics for deploying defenses, searching for an enemy and counter measures against that enemy could be evaluated; the impact of technological advances or the advantages gained through espionage by an enemy force could be evaluated, real and realistic situations could be recreated and thoroughly studied, and finally, the value of better environmental data could be determined prior to allocating both the time and money needed to collect, process, store and distribute that data [4].","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"897 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130498332","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":"Parallel Discrete-Event Simulation (PDES)","authors":"WielandFrederick, BlairEric, ZukasTony","doi":"10.1145/214283.214315","DOIUrl":"https://doi.org/10.1145/214283.214315","url":null,"abstract":"Can parallel simulations efficiently exploit a network of workstations? Why haven't PDES models followed standard modeling methodologies? Will the field of PDES survive, and if so, in what form? Re...","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115317628","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":"Dynamic load balancing of a multi-cluster simulator on a network of workstations","authors":"SchlagenhaftRolf, RuhwandlMartin, SporrerChristian, BauerHerbert","doi":"10.1145/214283.214337","DOIUrl":"https://doi.org/10.1145/214283.214337","url":null,"abstract":"Performance of Time Warp simulation systems are often measured on exclusively available parallel computing resources. In distributed systems exclusive use is normally not feasible. Instead, due to ...","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133050322","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":"An introduction to the RESearch Queueing Package for modeling contention systems","authors":"E. MacNair, R. F. Gordon","doi":"10.1145/202235.202238","DOIUrl":"https://doi.org/10.1145/202235.202238","url":null,"abstract":"A queueing network is an important tool for modeling systems where performance is principally affected by contention for resources. Such systems include computer systems, communication networks and manufacturing lines. In order to effectively use queuing networks as performance models, appropriate software is necessary for definition of the networks to be solved, for solution of the networks and for examination of the performance measures obtained.The RESearch Queueing Package (RESQ) and the RESearch Queueing Modeling Environment (RESQME) form a system for constructing, solving and analyzing extended queueing network models. We refer to the class of RESQ networks as \"extended\" because of characteristics which allow effective representation of system detail. RESQ incorporates a high level language to concisely describe the structure of the model and to specify constraints on the solution. A main feature of the language is the capability to describe models in a hierarchical fashion, allowing an analyst to define submodels to be used analogously to use of macros in programming languages. RESQ also provides a variety of methods for estimating the accuracy of simulation results and for determining simulation run lengths. RESQME is a graphical interface for RESQ.","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125511463","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 driven resource allocation in ATM networks","authors":"A. M. Alqaed, C. Chang","doi":"10.1145/202235.202236","DOIUrl":"https://doi.org/10.1145/202235.202236","url":null,"abstract":"Asynchronous Transfer Mode (ATM) traffic is characterized by a wide variety of traffic source classes. Each class of traffic has differing effects on the buffer and link capacity resources of the network. This results in a high level of complexity in predicting resource allocations for each source. The network must be managed in real-time in order to avoid congestion which tends to collapse its utilization. Network congestion requires admission control which in turn must require a measure of resource requirements from a randomly variable source. In this paper we proposed a frequency-domain probability density function convolution method for predicting the resource requirements of a source based on its input characteristics. A taxonomy and classification of sources based on measurable characteristics is also proposed. The classes of sources are simulated and the resulting requirements are compared to the prediction. A feedback mechanism is described which can result in a highly accurate and very efficient table lookup method for realtime resource allocation in ATM multiplexing switches.","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131480970","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":"Cost of state saving & rollback","authors":"ClearyJohn, GomesFabian, UngerBrian, XiaoZhonge, ThudtRaimar","doi":"10.1145/195291.182545","DOIUrl":"https://doi.org/10.1145/195291.182545","url":null,"abstract":"Approaches to state saving and rollback for a shared memory, optimistically synchronized, simulation executive are presented. An analysis of copy state saving and incremental state saving is made a...","PeriodicalId":138785,"journal":{"name":"ACM Sigsim Simulation Digest","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120892488","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}