Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000138
David Wangerin, Christopher DeCoro, L. M. Campos, Hugo Coyote, I. Scherson
A novel simulation framework is described that uses a client-server paradigm combined with a discrete event simulator to allow the simulation modules to be distributed around a centralized core. The framework also simplifies the creation of new simulations by achieving the goals of being general purpose, easily extensible, modular, and distributed. A prototype of the client-server discrete event simulator (CS-DEVS) has been developed as a proof of concept. Two examples are presented to demonstrate the power of the new paradigm and prove the correctness of CS-DEVS. The first example is a modeling of the classical bank queuing simulation. The second example models the simulation of a distributed computing system, with complete modules for workload generation, architecture description, and scheduling and load balancing algorithms.
{"title":"A modular client-server discrete event simulator for networked computers","authors":"David Wangerin, Christopher DeCoro, L. M. Campos, Hugo Coyote, I. Scherson","doi":"10.1109/SIMSYM.2002.1000138","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000138","url":null,"abstract":"A novel simulation framework is described that uses a client-server paradigm combined with a discrete event simulator to allow the simulation modules to be distributed around a centralized core. The framework also simplifies the creation of new simulations by achieving the goals of being general purpose, easily extensible, modular, and distributed. A prototype of the client-server discrete event simulator (CS-DEVS) has been developed as a proof of concept. Two examples are presented to demonstrate the power of the new paradigm and prove the correctness of CS-DEVS. The first example is a modeling of the classical bank queuing simulation. The second example models the simulation of a distributed computing system, with complete modules for workload generation, architecture description, and scheduling and load balancing algorithms.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126962768","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000175
Ernesto Luiz Andrade Neto, M. Yacoub, A. Shinoda, M. Pellenz
In this paper we present a comprehensive simulator for the UTRA FDD downlink. The simulator development abides strictly to the 3GPP standards implementing the detailed transmission chain for several UTRA FDD traffic channels. Rake diversity combining is employed at the receiver. Performance improvement due to error correction coding scheme is also evaluated. The channel model used for simulation is based on the COST 259 model and provides realistic scenarios for radio propagation. The simulator aims at being used as a test bed for new technologies based on the 3GPP standards.
{"title":"A comprehensive 3G link level simulator","authors":"Ernesto Luiz Andrade Neto, M. Yacoub, A. Shinoda, M. Pellenz","doi":"10.1109/SIMSYM.2002.1000175","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000175","url":null,"abstract":"In this paper we present a comprehensive simulator for the UTRA FDD downlink. The simulator development abides strictly to the 3GPP standards implementing the detailed transmission chain for several UTRA FDD traffic channels. Rake diversity combining is employed at the receiver. Performance improvement due to error correction coding scheme is also evaluated. The channel model used for simulation is based on the COST 259 model and provides realistic scenarios for radio propagation. The simulator aims at being used as a test bed for new technologies based on the 3GPP standards.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122881470","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000163
M. Low
The performance of a parallel simulation system depends very much on partitioning simulation workload evenly among the set of processors in the computing environment to ensure load-balance between processors. Most parallel simulation systems employ user-defined static partitioning. However static partitioning requires in-depth domain knowledge of the specific simulation model in the study. It is not effective if the workload of a simulation model could not be quantified accurately or changes over time during a simulation run. Dynamic load-balancing allows the simulation system to automatically balance the workload of different simulation models without user's input. In this paper the use of dynamic load-balancing in the context of the BSP Time Warp optimistic protocol is examined. Based on the BSP cost model, a dynamic load-balancing algorithm for the BSP Time Warp protocol is developed. Using different simulation models, the paper shows that to achieve consistent performance, the dynamic load-balancing algorithm for BSP Time Warp needs to consider both computation and communication workload, as well as lookaheads between processors.
并行仿真系统的性能在很大程度上取决于将仿真工作负载在计算环境中的一组处理器之间均匀地划分，以确保处理器之间的负载平衡。大多数并行仿真系统采用用户定义的静态分区。然而，静态划分需要深入了解所研究的特定仿真模型的领域知识。如果模拟模型的工作负载不能准确地量化，或者在模拟运行期间随时间变化，那么它是无效的。动态负载平衡允许仿真系统在不需要用户输入的情况下自动平衡不同仿真模型的工作负载。本文研究了动态负载平衡在BSP时间扭曲乐观协议中的应用。基于BSP代价模型，提出了一种BSP时间扭曲协议的动态负载平衡算法。通过不同的仿真模型，表明BSP Time Warp的动态负载平衡算法需要同时考虑计算量和通信负荷，以及处理器间的查找时间，以达到一致的性能。
{"title":"Dynamic load-balancing for BSP Time Warp","authors":"M. Low","doi":"10.1109/SIMSYM.2002.1000163","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000163","url":null,"abstract":"The performance of a parallel simulation system depends very much on partitioning simulation workload evenly among the set of processors in the computing environment to ensure load-balance between processors. Most parallel simulation systems employ user-defined static partitioning. However static partitioning requires in-depth domain knowledge of the specific simulation model in the study. It is not effective if the workload of a simulation model could not be quantified accurately or changes over time during a simulation run. Dynamic load-balancing allows the simulation system to automatically balance the workload of different simulation models without user's input. In this paper the use of dynamic load-balancing in the context of the BSP Time Warp optimistic protocol is examined. Based on the BSP cost model, a dynamic load-balancing algorithm for the BSP Time Warp protocol is developed. Using different simulation models, the paper shows that to achieve consistent performance, the dynamic load-balancing algorithm for BSP Time Warp needs to consider both computation and communication workload, as well as lookaheads between processors.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122933990","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000090
A. Bruzzone, R. Mosca, A. Orsoni, R. Revetria
This paper establishes a methodology for the validation of a whole federation of simulation models which represent the reality of the supply chain in the context of the aerospace industry. There are many possible ways to address this problem, among these, the simplest way appears to be the analysis of the real-life situation, based on historical data. The use of historical data is not always a viable approach, due to the lack of a sufficiently extensive pool of reliable data. Therefore a simulation-based VV&A approach is often required before the operative use of models. Historical data is reproduced through a long series of runs of a simulation meta-model. The major issue associated to the validation of a federation of simulation models is that each simulation model needs to be validated as stand-alone and at the same time it needs to be validated as a member of the whole federation, or of a portion of it.
{"title":"Simulation-based VV&A methodology for HLA federations: an example from the Aerospace industry","authors":"A. Bruzzone, R. Mosca, A. Orsoni, R. Revetria","doi":"10.1109/SIMSYM.2002.1000090","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000090","url":null,"abstract":"This paper establishes a methodology for the validation of a whole federation of simulation models which represent the reality of the supply chain in the context of the aerospace industry. There are many possible ways to address this problem, among these, the simplest way appears to be the analysis of the real-life situation, based on historical data. The use of historical data is not always a viable approach, due to the lack of a sufficiently extensive pool of reliable data. Therefore a simulation-based VV&A approach is often required before the operative use of models. Historical data is reproduced through a long series of runs of a simulation meta-model. The major issue associated to the validation of a federation of simulation models is that each simulation model needs to be validated as stand-alone and at the same time it needs to be validated as a member of the whole federation, or of a portion of it.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129676334","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000096
Shean T. McMahon, I. Scherson
Correctly modeling the resource requirements of a computer program is made problematic by the property of irregularity. Irregular computer programs are ones in which modeling the program before runtime is neither feasible nor possible; the result being that the systems requirements are unknown. We present a method for modeling irregularity which makes use of well established probabilistic and data analysis techniques. The realm of continuous mathematics, rather than the more traditional discrete cases are employed, thus introducing the more diverse analysis methodologies this branch of mathematics affords. This approach, that of describing a discrete system using a continuous mathematical function has been well established in the physical sciences, and has proven to be a valid approach to describing problems of this sort.
{"title":"A statistical mechanical approach to a framework for modeling irregular programs on distributed or cluster computers","authors":"Shean T. McMahon, I. Scherson","doi":"10.1109/SIMSYM.2002.1000096","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000096","url":null,"abstract":"Correctly modeling the resource requirements of a computer program is made problematic by the property of irregularity. Irregular computer programs are ones in which modeling the program before runtime is neither feasible nor possible; the result being that the systems requirements are unknown. We present a method for modeling irregularity which makes use of well established probabilistic and data analysis techniques. The realm of continuous mathematics, rather than the more traditional discrete cases are employed, thus introducing the more diverse analysis methodologies this branch of mathematics affords. This approach, that of describing a discrete system using a continuous mathematical function has been well established in the physical sciences, and has proven to be a valid approach to describing problems of this sort.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126432341","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000084
R. Simmonds, C. Kiddle, K. Wong, B. Unger
This paper addresses the problem of excessive memory usage in simulators using asynchronous conservative parallel discrete event simulation algorithms. The characteristics of the modeled system that promote this problem are examined. Existing algorithms that attempt to solve this problem are discussed and new flow control algorithms introduced. Results of simulation experiments using both existing and new algorithms are presented. The results show that some existing algorithms fail to achieve their goal. They also show that all of the existing algorithms are sensitive to parameter settings. The new algorithms are shown to be effective and less sensitive to parameter settings.
{"title":"Controlling buffer usage in critical channel traversing","authors":"R. Simmonds, C. Kiddle, K. Wong, B. Unger","doi":"10.1109/SIMSYM.2002.1000084","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000084","url":null,"abstract":"This paper addresses the problem of excessive memory usage in simulators using asynchronous conservative parallel discrete event simulation algorithms. The characteristics of the modeled system that promote this problem are examined. Existing algorithms that attempt to solve this problem are discussed and new flow control algorithms introduced. Results of simulation experiments using both existing and new algorithms are presented. The results show that some existing algorithms fail to achieve their goal. They also show that all of the existing algorithms are sensitive to parameter settings. The new algorithms are shown to be effective and less sensitive to parameter settings.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114635054","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000157
Peng Sun, S. Sung, Zhaojun Li, S. Huang
With the increasing number of mobile users, the network traffic for tracking mobile hosts is expected to increase dramatically, thus an efficient protocol for IP mobility support is of great value. We study the performance of such protocols. Starting from identifying the shortcomings in current evaluation methods and presenting the unfitness to our topic in current network simulators, we make three major contributions in this paper: (1) we present an integrated development environment we have developed and utilized for protocol evaluation; (2) we show the simulation results of two benchmark protocols with our simulation environment, and we give our analysis to the results; (3) based on the analysis, we propose a new protocol and demonstrate its efficiency through the comparison with the two benchmarks.
{"title":"Performance evaluation and analysis of protocols for IP mobility support: a quantitative study","authors":"Peng Sun, S. Sung, Zhaojun Li, S. Huang","doi":"10.1109/SIMSYM.2002.1000157","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000157","url":null,"abstract":"With the increasing number of mobile users, the network traffic for tracking mobile hosts is expected to increase dramatically, thus an efficient protocol for IP mobility support is of great value. We study the performance of such protocols. Starting from identifying the shortcomings in current evaluation methods and presenting the unfitness to our topic in current network simulators, we make three major contributions in this paper: (1) we present an integrated development environment we have developed and utilized for protocol evaluation; (2) we show the simulation results of two benchmark protocols with our simulation environment, and we give our analysis to the results; (3) based on the analysis, we propose a new protocol and demonstrate its efficiency through the comparison with the two benchmarks.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116343212","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000162
Gary S. H. Tan, Wee Ngee Ng, Simon J. E. Taylor
Supply chain management (SCM) is a series of activities, usually sequential, that an organisation, or a network of organisations, uses to deliver products and/or services to customers. With the globalisation of commercial markets, distributed supply chain (DSQ) simulation, connecting organisations from various parts of the world, has gained significance in supply chain management decision support. DSC simulation requires that information be transferred between individual simulations (interoperability) in a timely and consistent manner. In this work GRIDS (Generic Runtime Infrastructure for Distributed Simulation), an extensible, service-based RTI, is used to successfully transfer timely information between simulations. However, the question of what format this information should take still remains. This paper presents the development of an Object Exchange Model Template (OEMT), for DSC simulation in GRIDS. These are templates for standard object creation within a DSC simulation, so as to facilitate standard object transfers between the various simulations that compose a DSC simulation. The templates are stored in an Object Exchange Model Repository (OEMR) for easy access by all simulation builders intending to build a DSC simulation using GRIDS. The OEMT facilitates interoperability by providing a common "language" that can be used to share information (objects) between simulations. This approach can also facilitate data distribution management (DDM) services. The OEMT is intended to extend and complement the OMT of the High Level Architecture.
{"title":"Developing an Object Exchange Model Template for GRIDS distributed supply chain simulations","authors":"Gary S. H. Tan, Wee Ngee Ng, Simon J. E. Taylor","doi":"10.1109/SIMSYM.2002.1000162","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000162","url":null,"abstract":"Supply chain management (SCM) is a series of activities, usually sequential, that an organisation, or a network of organisations, uses to deliver products and/or services to customers. With the globalisation of commercial markets, distributed supply chain (DSQ) simulation, connecting organisations from various parts of the world, has gained significance in supply chain management decision support. DSC simulation requires that information be transferred between individual simulations (interoperability) in a timely and consistent manner. In this work GRIDS (Generic Runtime Infrastructure for Distributed Simulation), an extensible, service-based RTI, is used to successfully transfer timely information between simulations. However, the question of what format this information should take still remains. This paper presents the development of an Object Exchange Model Template (OEMT), for DSC simulation in GRIDS. These are templates for standard object creation within a DSC simulation, so as to facilitate standard object transfers between the various simulations that compose a DSC simulation. The templates are stored in an Object Exchange Model Repository (OEMR) for easy access by all simulation builders intending to build a DSC simulation using GRIDS. The OEMT facilitates interoperability by providing a common \"language\" that can be used to share information (objects) between simulations. This approach can also facilitate data distribution management (DDM) services. The OEMT is intended to extend and complement the OMT of the High Level Architecture.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122089613","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000173
Jason E. Fritts, R. Chamberlain
We demonstrate the capability of optical buses in enabling orders of magnitude greater bandwidth between the processor and off-chip memory in a uniprocessor computer system. Through a simulation-based performance analysis of a 1 GHz processor model, we provide a preliminary evaluation of the benefits of an optical processor-to-memory bus in both eliminating the bandwidth bottleneck and in reducing the impact of the increasing processor-to-memory latency gap. The optical technology is constructed of two-dimensional arrays of lasers and detectors bonded to silicon that provide high-speed optical I/O on and off chip. These chip-to-chip light paths may be designed using either rigid free-space optics or flexible fiber image guides. Utilizing the optical data path between the processor and memory provides significantly greater bandwidth with no appreciable latency penalty. We assess the performance impact of this architecture enhancement on a number of media applications. Overall we found that the increased bandwidth nearly eliminates the transfer time between processor and memory, effectively reducing degradation from off-chip memory latency by 50% on average. Additionally, substantial extra bandwidth remains for more bandwidth-intensive architectural options like aggressive latency hiding techniques and single-chip multiprocessors.
{"title":"Breaking the memory bottleneck with an optical data path","authors":"Jason E. Fritts, R. Chamberlain","doi":"10.1109/SIMSYM.2002.1000173","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000173","url":null,"abstract":"We demonstrate the capability of optical buses in enabling orders of magnitude greater bandwidth between the processor and off-chip memory in a uniprocessor computer system. Through a simulation-based performance analysis of a 1 GHz processor model, we provide a preliminary evaluation of the benefits of an optical processor-to-memory bus in both eliminating the bandwidth bottleneck and in reducing the impact of the increasing processor-to-memory latency gap. The optical technology is constructed of two-dimensional arrays of lasers and detectors bonded to silicon that provide high-speed optical I/O on and off chip. These chip-to-chip light paths may be designed using either rigid free-space optics or flexible fiber image guides. Utilizing the optical data path between the processor and memory provides significantly greater bandwidth with no appreciable latency penalty. We assess the performance impact of this architecture enhancement on a number of media applications. Overall we found that the increased bandwidth nearly eliminates the transfer time between processor and memory, effectively reducing degradation from off-chip memory latency by 50% on average. Additionally, substantial extra bandwidth remains for more bandwidth-intensive architectural options like aggressive latency hiding techniques and single-chip multiprocessors.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130568715","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}
Pub Date : 2002-04-14DOI: 10.1109/SIMSYM.2002.1000151
J. Miller, J. Cardoso, Gregory A. Silver
In order to support realistic real-world processes, workflow systems need to be able to adapt to changes. Detecting the need to change and deciding what changes to carry out are very difficult. Simulation analysis can play an important role in this. It can be used in tuning quality of service metrics and exploring "what-if" questions. Before a change is actually made, its possible effects can be explored with simulation. To facilitate rapid feedback, the workflow system (METEOR) and simulation system (JSIM) need to interoperate. In particular, workflow specification documents need to be translated into simulation model specification documents so that the new model can be executed/animated on-the-fly. Fortunately, modern Web technology (e.g., XML, DTD, XSLT) make this relatively straightforward. The utility of using simulation in adapting a workflow is illustrated with an example from a genome workflow.
{"title":"Using simulation to facilitate effective workflow adaptation","authors":"J. Miller, J. Cardoso, Gregory A. Silver","doi":"10.1109/SIMSYM.2002.1000151","DOIUrl":"https://doi.org/10.1109/SIMSYM.2002.1000151","url":null,"abstract":"In order to support realistic real-world processes, workflow systems need to be able to adapt to changes. Detecting the need to change and deciding what changes to carry out are very difficult. Simulation analysis can play an important role in this. It can be used in tuning quality of service metrics and exploring \"what-if\" questions. Before a change is actually made, its possible effects can be explored with simulation. To facilitate rapid feedback, the workflow system (METEOR) and simulation system (JSIM) need to interoperate. In particular, workflow specification documents need to be translated into simulation model specification documents so that the new model can be executed/animated on-the-fly. Fortunately, modern Web technology (e.g., XML, DTD, XSLT) make this relatively straightforward. The utility of using simulation in adapting a workflow is illustrated with an example from a genome workflow.","PeriodicalId":198576,"journal":{"name":"Proceedings 35th Annual Simulation Symposium. SS 2002","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132024752","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：