2008 22nd Workshop on Principles of Advanced and Distributed Simulation最新文献

筛选
英文 中文
An Agent-Based Environment for Simulation Model Composition 基于agent的仿真模型合成环境
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.18
F. Moradi, R. Ayani, Imran Mahmood
{"title":"An Agent-Based Environment for Simulation Model Composition","authors":"F. Moradi, R. Ayani, Imran Mahmood","doi":"10.1109/PADS.2008.18","DOIUrl":"https://doi.org/10.1109/PADS.2008.18","url":null,"abstract":"As Modelling and Simulation gains more popularity, the demand on reducing time and resource costs associated with development and validation of simulation models has also increased. Composing simulation models of reusable and validated simulation components is one approach for addressing the above demand. This approach requires a composition process that is able to support a modeller with discovery and identification of components as well as giving feedback on feasibility of a composition. Software agents are programs that can with some degree of autonomy perform tasks on behalf of a user or another program. In a Multi Agent System (MAS) autonomous agents interact and collaborate with each other in order to solve complex problems that are beyond the individual capabilities or knowledge of each agent, thus providing modularity and scalability. The objective of this work has been to develop a Multi Agent System for discovery and composition of BOM (Base Object Model) based simulation models, which provides the flexibility and adaptability to test and assess, amongst others different discovery and composition methods and techniques. The MAS that we developed is based on the JACKTM Intelligent Agents and executes a rule-based process for discovery and composition of BOMs. Our preliminary results indicate its feasibility, portability, adaptability and flexibility.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126155748","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}
引用次数: 7
Toward Scalable Routing Experiments with Real-Time Network Simulation 基于实时网络仿真的可扩展路由实验研究
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.25
Yue Li, Jason Liu, R. Rangaswami
{"title":"Toward Scalable Routing Experiments with Real-Time Network Simulation","authors":"Yue Li, Jason Liu, R. Rangaswami","doi":"10.1109/PADS.2008.25","DOIUrl":"https://doi.org/10.1109/PADS.2008.25","url":null,"abstract":"The ability to conduct accurate and realistic experiments is critical in furthering the research and development of network routing protocols. Existing framework for routing experiments is found to be lacking in one or more of the three required features: realism, scalability, and flexibility. We develop a new software infrastructure that combines the scalability and flexibility benefits of real-time network simulation with the realism of open-source routing protocol implementations. The infrastructure seamlessly integrates the open-source XORP router software with a previously developed real-time network simulation engine. Our design of the infrastructure uses a novel forwarding plane offloading approach that decouples routing from forwarding and confines the more resource consuming forwarding operations inside the simulation engine to reduce I/O overhead. Experiments demonstrate superior performance of the experimental infrastructure without impairing accuracy.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117267604","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}
引用次数: 9
Interval Branching 间隔分支
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.8
Patrick Peschlow, P. Martini, Jason Liu
{"title":"Interval Branching","authors":"Patrick Peschlow, P. Martini, Jason Liu","doi":"10.1109/PADS.2008.8","DOIUrl":"https://doi.org/10.1109/PADS.2008.8","url":null,"abstract":"We propose a new simulation method, called interval branching, which aims to facilitate efficient simulation studies of systems that involve temporal uncertainty. The method uses interval timestamps for events and explores different execution orders of overlapping events by branching the simulation. We first present a sequential version of interval branching, and then extend it to parallel simulation using the logical process paradigm. The parallel interval branching algorithm uses the logical-process cloning technique for efficient computation of branches. Our preliminary experiments show its potential as an efficient method for discrete-event simulation studies.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126321559","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}
引用次数: 7
A Dynamic Publish-Subscribe Network for Distributed Simulation 面向分布式仿真的动态发布-订阅网络
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.32
P. Crowley
{"title":"A Dynamic Publish-Subscribe Network for Distributed Simulation","authors":"P. Crowley","doi":"10.1109/PADS.2008.32","DOIUrl":"https://doi.org/10.1109/PADS.2008.32","url":null,"abstract":"Real-time distributed simulation has inspired a considerable amount of networking research due to its importance and difficulty. Previous work has shown that real-time distributed simulations can greatly benefit from the support of routers. Using routers in this way has been challenging in practice, however, because commercial offerings are not sufficiently programmable or configurable to implement this service. We have developed a virtualized, programmable router infrastructure to enable programmers to define their own router functions, including network- level protocols. As one of our earliest system demonstrations, we have designed and are working to implement a network to provide scalable support for real-time distributed simulations.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"62 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130283173","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}
引用次数: 2
A Comparison of Interest Manager Mechanisms for Agent-Based Simulations Using a Time Warp Executive 使用时间扭曲执行器的基于代理的模拟的兴趣管理机制的比较
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.22
Tianhao He, M. Hybinette
{"title":"A Comparison of Interest Manager Mechanisms for Agent-Based Simulations Using a Time Warp Executive","authors":"Tianhao He, M. Hybinette","doi":"10.1109/PADS.2008.22","DOIUrl":"https://doi.org/10.1109/PADS.2008.22","url":null,"abstract":"An important issue for agent-based simulation architectures concerns the means by which agents can be kept up to date regarding the position and state of other agents and objects in their local environment. We implement two distributed publish-subscribe approaches and assess their performance within our SASSY architecture. One implementation supports direct agent-to-agent communication, while in the other all messages pass through an intermediate LP. In both cases the system does not maintain global state, but facilitates communication between individual agents that may affect one another. The environment is decomposed into a set of regions, where an LP referred to as an Interest Manager (IM) manages each region. When agents enter a region they register their presence with the appropriate Interest Manager. Agents also subscribe and unsubscribe to information from neighboring regions as they move through the environment. Publish-subscribe approaches have been utilized in other simulation environments (e.g., HLA), but we believe our approach is the first to use a peer-to-peer method in an optimistic environment. We assess the efficiency of these two methods by measuring the number of rollbacks, and total runtime for various configurations of the simulation.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"361 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131572941","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}
引用次数: 4
DyMeLoR: Dynamic Memory Logger and Restorer Library for Optimistic Simulation Objects with Generic Memory Layout 具有通用内存布局的乐观模拟对象的动态内存记录器和恢复库
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.23
R. Toccaceli, F. Quaglia
{"title":"DyMeLoR: Dynamic Memory Logger and Restorer Library for Optimistic Simulation Objects with Generic Memory Layout","authors":"R. Toccaceli, F. Quaglia","doi":"10.1109/PADS.2008.23","DOIUrl":"https://doi.org/10.1109/PADS.2008.23","url":null,"abstract":"In this article we focus on checkpoint/restore facilities for optimistic simulation objects with generic memory layout. Specifically, we present the design and implementation of a C library, named DyMeLoR (Dynamic Memory Logger and Restorer), that, beyond offering traditional services for dynamic memory allocation/release, additionally supports transparent checkpoint/restore of scattered simulation objects' states. DyMeLoR is well suited for being integrated within optimistic simulation platforms relying on kernel processes, each managing one or more simulation objects, as typical in most implementations of general purpose optimistic simulation platforms. From the point of view of efficiency, DyMeLoR has been designed in order to minimize memory consumption for meta-data describing the current layout of the simulation object's state, and to provide good trade-offs between the cost of meta-data manipulation and the cost of memory-to-memory data copies associated with checkpoint/restore tasks. Also, the library exhibits Piece-Wise-Deterministic (PWD) behavior, thus allowing the employment of (optimized) sparse checkpointing strategies each time the overlying application software complies with the PWD assumption. We also report the results of an experimental study where DyMeLoR is integrated within the ROme OpTimistic Simulator (ROOT-Sim), and is used to support optimistic simulation of a cellular system.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130700080","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}
引用次数: 34
Micro-Synchronization in Conservative Parallel Network Simulation 保守并行网络仿真中的微同步
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.10
Siming Lin, Xueqi Cheng, Jianming Lv
{"title":"Micro-Synchronization in Conservative Parallel Network Simulation","authors":"Siming Lin, Xueqi Cheng, Jianming Lv","doi":"10.1109/PADS.2008.10","DOIUrl":"https://doi.org/10.1109/PADS.2008.10","url":null,"abstract":"Lookahead is a critical factor in conservative parallel simulation. Greater lookahead usually brings better performance. However, in the simulation of computer networks, lookahead is usually determined by the minimal delay of the border links between any two subnets that simulated by different sequential logical processes (LPs), which is too small to get good performance. Traditionally, the lookahead exploitation usually only reflects the parallelism among LPs, which possibly wastes the potential parallelism inside each LP, especially, in the case that each LP simulates thousands of entities. Here we present a simple method called micro-synchronization to exploit the parallelism inside each LP. Different from the previous work, such as lookahead accumulation and local time warp, we keep the traditional usage of lookahead among LPs unchanged, and however, we impose the relaxed sequential event scheduling inside each LP, which can indirectly improve the lookahead. We also present a state causality model to prove the correctness of our method, which means that there is no risk in the relaxed sequential execution. Finally, the experiment evaluates our method and shows that it can improve the performance of conservative parallel simulation of computer networks to some extent.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"108 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133785077","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}
引用次数: 9
Symbiotic Simulation Systems: An Extended Definition Motivated by Symbiosis in Biology 共生模拟系统:生物学中由共生驱动的扩展定义
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.17
Heiko Aydt, S. Turner, Wentong Cai, M. Low
{"title":"Symbiotic Simulation Systems: An Extended Definition Motivated by Symbiosis in Biology","authors":"Heiko Aydt, S. Turner, Wentong Cai, M. Low","doi":"10.1109/PADS.2008.17","DOIUrl":"https://doi.org/10.1109/PADS.2008.17","url":null,"abstract":"Although various forms of symbiosis are known in biology, only mutualism has been considered in the context of symbiotic simulation systems. In this paper, we explain why the original definition of symbiotic simulation systems is narrow and why it is important to consider other forms of symbiosis as well. As a consequence we propose an extended definition of symbiotic simulation systems motivated by symbiosis in biology. By using this extended definition, we identify five different types of symbiotic simulation systems which can be applied in various applications. We describe how single systems can be combined and propose a hybrid symbiotic simulation system in the context of semiconductor manufacturing.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"107 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131746668","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}
引用次数: 58
An Algorithm Selection Approach for Simulation Systems 仿真系统的算法选择方法
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.9
Roland Ewald, J. Himmelspach, A. Uhrmacher
{"title":"An Algorithm Selection Approach for Simulation Systems","authors":"Roland Ewald, J. Himmelspach, A. Uhrmacher","doi":"10.1109/PADS.2008.9","DOIUrl":"https://doi.org/10.1109/PADS.2008.9","url":null,"abstract":"No simulation algorithm will deliver best performance under all circumstances, so simulation systems often offer execution alternatives to choose from. This leads to another problem: how is the user supposed to know which algorithm to select? The need for an automated selection mechanism is often neglected, as many simulation systems are focused on specific applications or modeling formalisms and therefore have a limited number of expert users. In general- purpose simulation systems like JAMES II, an 'intelligent' selection mechanism could help to increase the overall performance, especially when users have limited knowledge of the underlying algorithms and their implementations) (which is almost always the case). We describe an approach to integrate algorithm selection methods with such systems. Its effectiveness is illustrated in conjunction with the 'plug'n simulate' approach of JAMES II [12].","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126292303","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}
引用次数: 33
Parallel and Distributed Spatial Simulation of Chemical Reactions 化学反应的平行和分布空间模拟
2008 22nd Workshop on Principles of Advanced and Distributed Simulation Pub Date : 2008-06-03 DOI: 10.1109/PADS.2008.20
M. Jeschke, Alfred Park, Roland Ewald, R. Fujimoto, A. Uhrmacher
{"title":"Parallel and Distributed Spatial Simulation of Chemical Reactions","authors":"M. Jeschke, Alfred Park, Roland Ewald, R. Fujimoto, A. Uhrmacher","doi":"10.1109/PADS.2008.20","DOIUrl":"https://doi.org/10.1109/PADS.2008.20","url":null,"abstract":"The application of parallel and distributed simulation techniques is often limited by the amount of parallelism available in the model. This holds true for large-scale cell- biological simulations, afield that has emerged as data and knowledge concerning these systems increases and biologists call for tools to guide wet-lab experimentation. A promising approach to exploit parallelism in this domain is the integration of spatial aspects, which are often crucial to a model's validity. We describe an optimistic, parallel and distributed variant of the Next-Subvolume Method (NSM), a method that augments the well-known Gillespie Stochastic Simulation Algorithm (SSA) with spatial features. We discuss requirements imposed by this application on a parallel discrete event simulation engine to achieve efficient execution. First results of combining NSM and the grid-inspired simulation system AURORA are shown.","PeriodicalId":328732,"journal":{"name":"2008 22nd Workshop on Principles of Advanced and Distributed Simulation","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122520734","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}
引用次数: 29
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书