{"title":"Modular HLA RTI services: the GRIDS approach","authors":"Simon J. E. Taylor, R. Sudra","doi":"10.1109/DISRTA.2002.1166884","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166884","url":null,"abstract":"The Generic Runtime Infrastructure for Distributed Simulation (GRIDS) has been developed to investigate modularity issues in distributed simulation. It could be argued that although the HLA RTI is a widespread solution to distributed simulation, it cannot include all possible services. This paper investigates an approach to extending the distributed simulation services available in the HLA RTI. One example of this is bridging support for HLA/DIS legacy integration. This paper therefore presents GRIDS, how GRIDS can be used to provide modular service support for the HLA RTI, and a case study on legacy integration to demonstrate our approach.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131966269","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":"PERFOSIM: a performance evaluation tool for HLA distributed simulations","authors":"Bruno d'Ausbourg, Jean-Loup Bussenot, P. Siron","doi":"10.1109/DISRTA.2002.1166885","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166885","url":null,"abstract":"With distributed simulation, existing simulations, even from different disciplines, can be reused or made to interoperate. The efficiency of this technique is, however, not firmly established and depends on the ability to satisfy a number of requirements, especially concerning simulation performance. The performance depends to a large extent on the structure and scaling of architectural components of the simulation execution platform. In this paper, we present an approach to address this problem: the design of models to capture the main characteristics of distributed simulations, run-time infrastructures and network architectures, and the development of a tool to predict performances. This tool, which is a simulator of HLA simulations, is written using HLA, and is evaluated on three test applications.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131628804","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 implementation of a distributed algorithm for detection of local knots and cycles in directed graphs based on the CSP model and Java","authors":"Geraldo Pereira de Souza, G. H. Pfitscher","doi":"10.1109/DISRTA.2002.1166900","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166900","url":null,"abstract":"Cycles and knots in directed graphs are problems that can be associated with deadlocks in database and communication systems. Many algorithms to detect cycles and knots in directed graphs were proposed. Boukerche and Tropper (1998) have proposed a distributed algorithm that solves the problem in a efficient away. Their algorithm has a message complexity of 2 m vs. (at least) 4 m for the Chandy and Misra algorithm, where m is the number of links in the graph, and requires O (n log n) bits of memory, where n is the number of nodes. We have implemented Boukerche and Tropper's algorithm according to the construction of processes of the CSP model. Our implementation was done using JCSP, an implementation of CSP for Java, and the results are presented.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123434339","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":"Software design for implementation of the Selectively Reliable Multicast Protocol","authors":"Babu Shanmugam, J. Pullen","doi":"10.1109/DISRTA.2002.1166895","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166895","url":null,"abstract":"The Selectively Reliable Multicast transport Protocol (SRMP) supports a mix of reliable and best-effort multicast by taking advantage of the specific requirements of distributed virtual simulation. It serves as the transport layer of a protocol stack with Internet Protocol multicast, and has been demonstrated to support distributed simulation with significantly lower demands on the network than that generated by use of multiple TCP connections. We address the iterative design and prototyping process used to develop the current implementation of SRMP. We begin with a review of the principles involved in SRMP. We then focus on two major aspects of the SRMP implementation software design, inter-process communication and process concurrency (threading), which were developed using an iterative or spiral development model. The earliest prototypes we developed showed disappointingly poor performance. Inter-process communication went through three distinct iterations before arriving at an efficient implementation; threading required two iterations for the basic SRMP functionality, and a third for implementation of heartbeats and bundling. We describe how the iterative development process has produced an efficient and effective implementation, and can be expected to yield similar results with ongoing enhancements to SRMP.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131081676","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 load management system for running HLA-based distributed simulations over the grid","authors":"Wentong Cai, S. Turner, Hanfeng Zhao","doi":"10.1109/DISRTA.2002.1166883","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166883","url":null,"abstract":"Running a large-scale distributed simulation may need a large amount of computing resources at geographically different locations. These resources may be from different organizations. The simulation may run for a long period of time and the availability and amount of computing resources available may change during the course of simulation execution. Therefore, coordinating and managing resources for distributed simulation to complete the simulation efficiently and effectively is a critical issue. This paper describes a load management system for HLA-based distributed simulation. The system is constructed on top of a grid computing environment supported by Globus. The overall structure of the system is presented in the paper and how the system saves and restores a federate is also discussed in detail.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134257233","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 MOVES institute-from science fiction novels to your door","authors":"M. Zyda","doi":"10.1109/DISRTA.2002.1166882","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166882","url":null,"abstract":"Proceedings of the 6th IEEE International Workshop on Distributed Simulation and Real-Time Applications (DS-RT 02), abstract only","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116526252","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":"On scheduling 3D model transmission in network virtual environments","authors":"G. Popescu, Z. Liu","doi":"10.1109/DISRTA.2002.1166898","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166898","url":null,"abstract":"View dependent 3D-geometry streaming allows navigation of large virtual environments without requiring replication of the entire database at the client. We present scheduling policies for optimal transmission of multiple multiresolution 3D-geometry objects over congested network links. Using multiresolution objects allows smooth adaptation of the visual quality of the graphics environment with network bandwidth fluctuations. A greedy scheduling policy is used for minimizing the visual error received at the client. The performance is further increased using a look-ahead scheduling policy. Finally a scheduling policy using multicast transmission of 3D models is presented. The scheduling policy combines unicast and multicast transmissions in order to provide optimal visual quality of the virtual environment rendered at the client.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127156571","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 trade-off in distributed simulation","authors":"B. Onggo, Y. M. Teo","doi":"10.1109/DISRTA.2002.1166892","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166892","url":null,"abstract":"We extend our previous work on formalizing event orderings using partial order set and its application in space analysis in distributed simulation. We focus on the time and space trade-off in exploiting event parallelism. Event parallelism is divided into inherent (problem) parallelism, event ordering parallelism and effective event parallelism. Firstly, we analyze the performance cost of varying event ordering parallelism on memory requirement in open and closed systems. Secondly, we study the effects of interconnection topology of a physical system on exploitable event ordering parallelism. Measurements were obtained from a time-space analyzer that we have developed.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"129 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127486696","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 overhead reducing technique for Time Warp","authors":"M. Chung, Jinsheng Xu","doi":"10.1109/DISRTA.2002.1166894","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166894","url":null,"abstract":"We introduce a technique that reduces the number of state savings and the maximum memory needed for the Time Warp. We present a technique to determine if an event is safe or not. If an event execution is safe, no state saving is carried out. The technique discards some saved states even though the time stamps are larger than the GVT. We prove that the technique is correct under both the aggressive and lazy cancellation scheme. This technique can be implemented with minimal additional overhead. Benchmark results on circuit simulation show that the mechanism can reduce the number of state savings and maximum memory size significantly. The technique is applicable to hardware simulation, network simulation and other systems that have fixed interconnection.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126428746","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":"Distributed simulation of timed coloured Petri nets","authors":"A. Furfaro, L. Nigro, F. Pupo","doi":"10.1109/DISRTA.2002.1166902","DOIUrl":"https://doi.org/10.1109/DISRTA.2002.1166902","url":null,"abstract":"This paper introduces a coloured Petri nets formalism-TCPN-which is suitable for modelling and simulation of complex systems. Novel in TCPN is (i) a timing model which accommodates both unordered and ordered (queue) places; (ii) the adoption of Java as the net inscription language. TCPN is supported by a graphical tool-RAINBOW-which allows model design, testing and simulation. A large TCPN model can be split into regions (subnets) whose execution is assigned to different LP/processors of a networked simulator. Distributed simulation relies on TUTW, an agent-based time warp algorithm capable of exploiting temporal uncertainty for improving simulation performance. The paper describes TCPN and its distributed execution kernel. The practical use of TCPN is demonstrated through an example and experimental results.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131004897","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}