{"title":"Modeling and simulation of a network of workstations with wormhole switching","authors":"Xavier Molero, F. Silla, V. Santonja","doi":"10.1109/SIMSYM.2000.844928","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844928","url":null,"abstract":"Networks of workstations (NOW) are becoming a very popular alternative to parallel computers for those applications with high needs of resources such as memory capacity processing power and input/output storage space. Typically, these networks connect workstations using irregular topologies, providing wiring flexibility, scalability, and incremental expansion capability required in this environment. In order to analyze and design these kind of systems it is necessary to have adequate tools. To address this problem, we have implemented a very flexible and easy to use NOW simulator. It is based on the one presented in (Silla, 1998; Silla and Duato, 1997; 1998) and it includes three more functionalities: it supports a technique for message fragmentation in packets, generates self-similar traffic, and also it can model networks with permanent faulted links or switches. We present this NOW simulator, the basic queueing models it is based on, its main internal organization, input parameters, output performance variables, and finally, we show several simple examples of performance measures obtained for, among others, message fragmentation, failures in links and switches, and self-similar traffic.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"423 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122916334","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}
Sergio Daicz, Alejandro J. Troccoli, S. Zlotnik, Gabriel A. Wainer
{"title":"Using the DEVS paradigm to implement a simulated processor","authors":"Sergio Daicz, Alejandro J. Troccoli, S. Zlotnik, Gabriel A. Wainer","doi":"10.1109/SIMSYM.2000.844901","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844901","url":null,"abstract":"This work is devoted to present the design and implementation of Alfa-I, a simulated computer with educational purposes. The DEVS formalism was used to attack the complexity of the design, allowing the definition of individual components that can be lately integrated into a modelling hierarchy. The tool is designed for the use in Computer Architecture and Organization courses. Its goal is allowing the students to acquire some practice in the design and implementation of hardware components by using simulation.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123931041","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":"Event-driven simulation of timed Petri net models","authors":"W. M. Zuberek","doi":"10.1109/SIMSYM.2000.844905","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844905","url":null,"abstract":"A collection of software tools for analysis of timed Petri nets, known as TPN-tools, developed over a number of years, has been extended by a simulation tool, TPNsim. The paper gives a brief characterization of TPNsim, and discusses some implementation aspects in greater detail.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116349228","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 optimization of airline delay using simultaneous perturbation stochastic approximation","authors":"D. Hutchison, S. Hill","doi":"10.1109/SIMSYM.2000.844923","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844923","url":null,"abstract":"Air traffic delay is a growing and expensive problem. We looked at ways to reduce the cost and magnitude of such delays by trading gate delays against more expensive air delays. Air management and planning at this level can be facilitated by simulation, especially for strategies that alter controls on the system. We used the SIMMOD air traffic simulation to model the system. Since the model is stochastic, these measures are noisy. The objective was to determine a set of control measures that achieve the best system performance subject to restrictions on the decision parameters and selected outputs of the model. This is a constrained stochastic optimization problem with nonlinear objective function and nonlinear stochastic constraints which requires efficient stochastic optimization methods for its solution. Our approach used simultaneous perturbation stochastic approximation (SPSA) with a penalty function to handle the difficult constraints.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115721834","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":"Exploring CORSIM runtime characteristics: profiling a traffic simulator","authors":"M. Bumble, L. D. Coraor, L. Elefteriadou","doi":"10.1109/SIMSYM.2000.844910","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844910","url":null,"abstract":"The runtime characteristics of CORSIM, a traffic corridor software simulator are presented. The simulator was profiled under both the NT and Linux operating systems. Profiling identifies bottleneck simulator function categories. Functions devoted to event scheduling and simulation overhead account for 80%-90% of CORSIM runtime.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128640181","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}
K. Trivedi, K. Vaidyanathan, K. Goseva-Popstojanova
{"title":"Modeling and analysis of software aging and rejuvenation","authors":"K. Trivedi, K. Vaidyanathan, K. Goseva-Popstojanova","doi":"10.1109/SIMSYM.2000.844925","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844925","url":null,"abstract":"Software systems are known to suffer from outages due to transient errors. Recently, the phenomenon of \"software aging\", one in which the state of the software system degrades with time, has been reported. To counteract this phenomenon, a proactive approach of fault management, called \"software rejuvenation\", has been proposed. This essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. We discuss stochastic models to evaluate the effectiveness of proactive fault management in operational software systems and determine optimal times to perform rejuvenation, for different scenarios. The latter part of the paper deals with measurement-based methodologies to detect software aging and estimate its effect on various system resources. Models are constructed using workload and resource usage data collected from the UNIX operating system over a period of time. The measurement-based models are intended to help development of strategies for software rejuvenation triggered by actual measurements.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130569045","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":"Specifying truck movement in traffic models using cell-DEVS","authors":"A. Davidson, Gabriel A. Wainer","doi":"10.1109/SIMSYM.2000.844902","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844902","url":null,"abstract":"A specification language was defined to outline sections of cities as cell spaces. The goal is to allow the definition of complex traffic models in a simple fashion for the modeler. Once the urban section is outlined, the traffic flow is automatically set up. In this case, the language was expanded to include the behavior of trucks. The models are formally specified, avoiding a high number of errors in the developed application, and the problem solving time can be reduced.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131983350","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 QoS multicasting performance in wide area networks","authors":"Tawfig Alrabiah, T. Znati","doi":"10.1109/SIMSYM.2000.844897","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844897","url":null,"abstract":"Multicasting enables applications to scale to a large number of users without overloading the network and server resources. With the advent of multimedia applications, the focus of multicasting research has shifted from minimizing the overall cost of the multicast tree to finding one which supports the QoS requirements of the underlying multimedia application. Finding such a tree, however, is NP-complete. Several heuristics, such SPH, KPP, BSMA, and K-SLIM, have been proposed as an approximation of the optimal solution to the multimedia multicasting problem. These heuristics differ in their complexity, overhead and the way they minimize tree cost and end-to-end delay. This paper develops a simulation framework to study and compare the performance of these heuristics. Using the above framework, the multimedia multicast heuristics were tested with respect to the graph size, the multicast group size, and the delay requirements of the underlying multimedia traffic. The simulation results show that, an average, K-SLIM outperforms the other simulated heuristics. Furthermore, the results also show that the average cost of the multicast trees produced by SLIM+, a variation of K-SLIM which requires must less overhead, is close to the average cost of the multicast trees produced by K-SLIM.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122332645","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}
Bernardo Copstein, Michael da Costa Móra, L. Ribeiro
{"title":"An environment for formal modeling and simulation of control systems","authors":"Bernardo Copstein, Michael da Costa Móra, L. Ribeiro","doi":"10.1109/SIMSYM.2000.844903","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844903","url":null,"abstract":"The purpose of this paper is to present the PLATUS simulation environment. PLATUS allows the formal modeling of control systems using graph grammars. In PLATUS, control systems are viewed as a collection of three distinct abstractions, that allow the system designer to keep the specification of control elements free of simulation aspects, providing the tools for formal system verification and code generation of real control systems, making the development of such systems a straightforward step from specification.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120957411","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":"Multi-resolution modeling of power converter using waveform reconstruction","authors":"Yuwei Luo, R. Dougal, E. Santi","doi":"10.1109/SIMSYM.2000.844913","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844913","url":null,"abstract":"Computer simulation of switching power converters is complicated by the discontinuous (switching) nature of the converter waveforms. When switching details of the waveform are of interest, detailed simulations requiring extremely small time steps are needed. On the other hand, so-called averaged models allow capture of low-frequency converter dynamics (of interest for example when closing the feedback loop) by computing averaged continuous waveforms. The possibility of using relatively large time steps makes averaged models computationally efficient. A real-time hierarchical approach that combines the advantages of the two methods is proposed. An averaged model and a detailed model are used alternately in successive time intervals. The final state of one model at the end of a time interval is used to calculate the initial conditions for the other model running in the following time interval. The method is illustrated with a buck converter. The combined use of two models with a hierarchical or multilevel approach is shown to provide a powerful simulation tool for analysis and design. The detailed model is used 10% of the time and the averaged model 90% of the time. Results indicate that the detailed behavior is accurately simulated when the detailed model runs and the overall simulation time cost is lowered by running the averaged model 90% of the time. This approach provides a way to simulate the detailed behavior of a specific part in a rather large switching circuit network.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122609901","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}