D. G. Linton, S. Khajenoori, J. V. Bullington, H. Cat, K. Halder, G. Herbert, S. Sinnappan, M. Heileman
{"title":"STARSIM: an object-oriented simulation model of Space Shuttle ground processing activities","authors":"D. G. Linton, S. Khajenoori, J. V. Bullington, H. Cat, K. Halder, G. Herbert, S. Sinnappan, M. Heileman","doi":"10.1109/SIMSYM.1992.227572","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227572","url":null,"abstract":"STARSIM (Space Transportation Activities and Resources SIMulation) is an object-oriented, menu-driven, user-friendly, decision support system for simulating and managing Space-Shuttle ground processing activities. The purpose of STARSIM is to permit trade-off studies to be performed for any set of input parameters (e.g., determining the effects on launches per year of adding a bay in the orbiter processing facility). Output is displayed both numerically (for global statistical information, including life-cycle cost estimates) and in Gantt chart form (for visualizing when and where each orbiter vehicle experiences waiting, processing, blocking and maintenance periods, as well as the reasons for blocking).<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"2005 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125807632","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}
Steven G. Popovich, Mansoor Alam, S. Bandyopadhyay
{"title":"Simulation of a DQDB MAC protocol with movable boundary and bandwidth balancing mechanisms","authors":"Steven G. Popovich, Mansoor Alam, S. Bandyopadhyay","doi":"10.1109/SIMSYM.1992.227570","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227570","url":null,"abstract":"Presents a simulation methodology for performance evaluation of the Distributed Queue Dual Bus (DQDB) metropolitan area network (MAN) using NETWORK II.5. This protocol has been adapted as an IEEE 802.6 standard and promises to be a worldwide standard for MANs as a high-speed shared medium access control protocol for voice and data over a dual counter-flowing bus subnetwork. The simulation describes a MAN operating at 155.52 Mbps. The simulation supports a queued arbitration (QA) access method utilizing a single queue and models non-isochronous services. The simulation methodology describes and evaluates the use of the static and movable boundary, bandwidth balancing and broadcasting techniques.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129755419","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":"Transaction management for object-oriented databases: performance advantages of using multiple versions","authors":"Xiaoying Liu, John A. Miller, N. R. Parate","doi":"10.1109/SIMSYM.1992.227559","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227559","url":null,"abstract":"Many applications of object-oriented database systems demand high performance and require longer duration transactions. These requirements are contrary to one another. Two trends in modern systems can help improve the situation. Firstly, multiprocessors are becoming commonplace, and secondly, object-oriented database systems supporting multiple versions are becoming popular. Consequently, database protocols that are less prone to extensive blocking (as can be the case with the popular two-phase locking protocol) are needed in future systems. The authors' simulation studies have shown substantial performance improvements can be obtained by using multiversion protocols for database transaction management. These protocols provide higher throughput at higher levels of concurrency (which are achievable with multiprocessors) than their traditional single version equivalents.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116432001","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 comparative study of load sharing in heterogeneous multicomputer systems","authors":"S. A. Banawan, Nidal M. Zeidat","doi":"10.1109/SIMSYM.1992.227580","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227580","url":null,"abstract":"The effective use of a heterogeneous multicomputer system depends on the scheduling policy used. Often the scheduling algorithms used are those that were intended for homogeneous systems. On the other hand, most scheduling algorithms designed with heterogeneity in mind were developed under unrealistic assumptions. To enhance the performance of a multicomputer system, load sharing can be used during scheduling to distribute the workload evenly among the constituent nodes. This paper presents a comprehensive evaluation of load sharing algorithms in heterogeneous multicomputer systems. The simulation results suggest that load sharing policies that perform well in homogeneous systems fail to achieve good performance in heterogeneous systems. The authors also show that the distribution of service time and the communication overhead have significant impact on system performance. They conclude by providing guidelines for selecting load sharing policies suitable for different heterogeneous environments.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"48 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132501675","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":"Doppler estimation by MA model and its comparison with FFT","authors":"M. Tabiani, S. Sadjadpour","doi":"10.1109/SIMSYM.1992.227556","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227556","url":null,"abstract":"Proposes an efficient novel method for Doppler frequency estimation in MTI radar, based on white noise assumption and using a second order canceler in the receiver. These conditions make the MA (moving average) model valid. Based on some realistic numerical assumptions, the authors compare the results of this model by a classic FFT (fast Fourier transform) estimator. By presenting a performance analysis, the authors show the degree of improvement which can be obtained by the proposed new estimation method.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124373579","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":"Effects of waiting overheads on conservative parallel simulation","authors":"Yi-Bing Lin","doi":"10.1109/SIMSYM.1992.227576","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227576","url":null,"abstract":"The most popular conservative parallel simulation approach is the Chandy-Misra (CM) approach. In this approach, two waiting rules are used to synchronize the executions of processes. This paper studies the effects of waiting overheads via a simulation model. The experiments indicate the following. (i) It is more important to reduce the waiting overheads for a lightly loaded system than a heavily loaded system. (ii) Reducing the input waiting overhead is more important than reducing the output waiting overhead for a network where processes have many input channels. (iii) For most cases, the interaction between the input optimization and the output optimization is positive. The authors also study the effects of waiting overheads on CM simulation with limited processors. It may not be worthwhile to reduce waiting overheads for simulation applications with high potential concurrency. On the other hand, it is important to use optimizations to reduce waiting overheads for simulation applications with low potential concurrency. For a small number of processors, it may not be worthwhile to reduce waiting overheads, because the concurrency provided by CM simulation is large enough to keep the processors busy. For a large number of processors, it is important to reduce waiting overheads to prevent processors from extra blocking.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125071261","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 linear approximation method for optimum calculation in image processing","authors":"Tao Chen, Hong Chen","doi":"10.1109/SIMSYM.1992.227560","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227560","url":null,"abstract":"A novel modified linear approximation method (MLAM) is introduced for fast optimal calculation in image processing. The analytical properties of this new algorithm is discussed and its proof of convergence is given. Simulations have been conducted and experimental results show that, in terms of the solution seeking speed, MLAM can perform as much as 60% better than the bisection method, a typical method commonly used.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123461545","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 object-oriented environment for simulation and evaluation of architectures","authors":"Khaled M. Hassan, M. Samadzadeh","doi":"10.1109/SIMSYM.1992.227573","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227573","url":null,"abstract":"Reports on an object-oriented package that was designed and implemented to help prototype different architectures. To this purpose, a package of classes was created to give the user of the package the ability to prototype various systems. The package affords the user the capability to prototype complicated systems which can have one or more of each of the following: memory, loader and/or CPU, as well as their subcomponents. The system is provided with a debugging facility so that a user can trace the execution of the hexadecimal jobs, one instruction at a time, using the four windows of the debugger.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127231390","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":"Temporal analysis of lambda sigma activity systems","authors":"E. Kortright","doi":"10.1109/SIMSYM.1992.227557","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227557","url":null,"abstract":"lambda sigma is a simulation language based on Whitehead's (1960) theory of reality and formalized in the typed lambda -calculus. lambda sigma entities are described as elements of a type and lambda sigma activities are subtypes. Type inference algorithms can be used to analyze and verify models in which the flow of entities is deterministic. In this paper, the authors describe the use of temporal logic to analyze and verify models in which entities move from one activity to another with a given probability. The approach is to apply the proof system for temporal logic with uncertainty of Lehmann and Shelah (1982).<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122659173","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 efficient implementation of lazy reevaluation","authors":"Avinash C. Palaniswamy, S. Aji, P. Wilsey","doi":"10.1109/SIMSYM.1992.227568","DOIUrl":"https://doi.org/10.1109/SIMSYM.1992.227568","url":null,"abstract":"Advances in distributed computing have resulted in the design of fast simulators for digital systems. A parallel, optimistically synchronized (time warp) digital systems simulator using VHDL as the hardware description language has been developed. The simulator incorporates several optimizations to the time warp mechanism, including lazy cancellation, flow control, lazy rollback, lazy reevaluation, and rollback relaxation. This paper presents an efficient implementation of lazy reevaluation which has historically been too computationally expensive for effective utilization. The realization of this optimization is proposed in this paper results in an identification of only a subset of the total forward jumps that are possible in lazy reevaluation.<<ETX>>","PeriodicalId":215380,"journal":{"name":"Proceedings. 25th Annual Simulation Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117176076","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}