Proceedings 11th Workshop on Parallel and Distributed Simulation最新文献

A multidimensional study on the feasibility of parallel switch-level circuit simulation 并联开关级电路仿真可行性的多维研究

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1109/PADS.1997.594585

Yuan Chen, V. Jha, R. Bagrodia

引用次数: 12

Optimistic distributed simulation based on transitive dependency tracking 基于传递依赖跟踪的乐观分布式仿真

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1109/PADS.1997.594591

O. Damani, Yi-Min Wang, V. Garg

{"title":"Optimistic distributed simulation based on transitive dependency tracking","authors":"O. Damani, Yi-Min Wang, V. Garg","doi":"10.1109/PADS.1997.594591","DOIUrl":"https://doi.org/10.1109/PADS.1997.594591","url":null,"abstract":"In traditional optimistic distributed simulation protocols, a logical process (LP) receiving a straggler rolls back and sends out anti-messages. The receiver of an anti-message may also roll back and send out more anti-messages. So a single straggler may result in a large number of anti-messages and multiple rollbacks of some LPs. In the authors' protocol, an LP receiving a straggler broadcasts its rollback. On receiving this announcement, other LPs may roll back but they do not announce their rollbacks. So each LP rolls back at most once in response to each straggler. Anti-messages are not used. This eliminates the need for output queues and results in simple memory management. It also eliminates the problem of cascading rollbacks and echoing, and results in faster simulation. All this is achieved by a scheme for maintaining transitive dependency information. The cost incurred includes the tagging of each message with extra dependency information and the increased processing time upon receiving a message. They also present the similarities between the two areas of distributed simulation and distributed recovery. They show how the solutions for one area can be applied to the other area.","PeriodicalId":124513,"journal":{"name":"Proceedings 11th Workshop on Parallel and Distributed Simulation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121617340","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}

引用次数: 10

Performance of a conservative simulator of ATM networks ATM网络保守模拟器的性能研究

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1145/268826.268913

J. Cleary, Jya-Jang Tsai

引用次数: 7

The dark side of risk (what your mother never told you about Time Warp) 风险的阴暗面(你母亲从未告诉过你的时间扭曲)

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1109/PADS.1997.594606

D. Nicol

{"title":"The dark side of risk (what your mother never told you about Time Warp)","authors":"D. Nicol","doi":"10.1109/PADS.1997.594606","DOIUrl":"https://doi.org/10.1109/PADS.1997.594606","url":null,"abstract":"This paper is a reminder of the danger of allowing \"risk\" when synchronizing a parallel discrete-event simulation: a simulation code that runs correctly on a serial machine may, when run in parallel, fail catastrophically. This can happen when Time Warp presents an \"inconsistent\" message to an LP, a message that makes absolutely no sense given the LP's state. Failure may result if the simulation modeler did not anticipate the possibility of this inconsistency. While the problem is not new, there has been little discussion of how to deal with it; furthermore the problem may not be evident to new users or potential users of parallel simulation. This paper shows how the problem may occur, and the damage it may cause. We show how one may eliminate inconsistencies due to lagging rollbacks and stale state, but then show that so long as risk is allowed it is still possible for an LP to be placed in a state that is inconsistent with model semantics, again making it vulnerable to failure. We finally show how simulation code can be tested to ensure safe execution under a risk-free protocol. Whether risky or risk-free, we conclude that under current practice the development of correct and safe parallel simulation code is not transparent to the modeler; certain protections must be included in model code or model testing that are not rigorously necessary if the simulation were executed only serially.","PeriodicalId":124513,"journal":{"name":"Proceedings 11th Workshop on Parallel and Distributed Simulation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122635929","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}

引用次数: 47

Tolerant synchronization for distributed simulations of interconnected computer networks 分布式互联计算机网络模拟的容错同步

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1145/268826.268912

P. Martini, Markus Rümekasten, J. Tölle

引用次数: 27

Adaptive flow control in Time Warp 时空扭曲中的自适应流量控制

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1109/PADS.1997.594593

K. Panesar, R. Fujimoto

{"title":"Adaptive flow control in Time Warp","authors":"K. Panesar, R. Fujimoto","doi":"10.1109/PADS.1997.594593","DOIUrl":"https://doi.org/10.1109/PADS.1997.594593","url":null,"abstract":"It is well known that Time Warp may suffer from poor performance due to excessive rollbacks caused by overly optimistic execution. The authors present a simple flow control mechanism using only local information and GVT that limits the number of uncommitted messages generated by a processor, thus throttling overly optimistic TW execution. The flow control scheme is analogous to traditional networking flow control mechanisms. A \"window\" of messages defines the maximum number of uncommitted messages allowed to be scheduled by a process. Committing messages is analogous to acknowledgments in networking flow control. The initial size of the window is calculated using a simple analytical model that estimates the instantaneous number of messages that a process will eventually commit. This window is expanded so that the process may progress up to the next commit point (generally the next fossil collection), and to accommodate optimistic execution. The expansions to the window are based on monitoring TW performance statistics so the window size automatically adapts to changing program behaviors. The flow control technique presented here is simple and fully automatic. No global knowledge or synchronization (other than GVT) is required. They also develop an implementation of the flow control scheme for shared memory multiprocessors that uses dynamically sized pools of free message buffers. Experimental data indicates that the adaptive flow control scheme maintains high performance for \"balanced workloads\", and achieves as much as a factor of 7 speedup over unthrottled TW for certain irregular workloads.","PeriodicalId":124513,"journal":{"name":"Proceedings 11th Workshop on Parallel and Distributed Simulation","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121715912","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}

引用次数: 46

MRE: a flexible approach to multi-resolution modeling 一种灵活的多分辨率建模方法

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1145/268826.268915

A. Natrajan, P. Reynolds, Sudhir Srinivasan

引用次数: 43

A workstation-based parallel direct-execution simulator 基于工作站的并行直接执行模拟器

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1145/268826.268917

P. Dickens

{"title":"A workstation-based parallel direct-execution simulator","authors":"P. Dickens","doi":"10.1145/268826.268917","DOIUrl":"https://doi.org/10.1145/268826.268917","url":null,"abstract":"It is important to understand and efficiently predict the performance of large codes executing on massively parallel machines. However, these very large machines are scarce, expensive, and generally unavailable to large segments of the research community. It is therefore important to implement performance analysis tools for such machines on platforms that are readily available to the research community at large. To meet this need, we have ported LAPSE, a parallel direct-execution simulator, from the Intel Paragon to an ordinary cluster of workstations. The goal of this research is to provide researchers the opportunity to study codes designed for execution on a massively parallel machine while physically executing on a workstation cluster. However, we encountered significant performance problems when moving to a workstation cluster, due primarily to high communication and context switching costs. To reduce these costs, we implemented the virtual processors of the simulated system using light-weight threads rather than heavy-weight Unix processes. In this paper, we discuss the issues involved in moving from a process-based to a thread-based simulator, and demonstrate up to a four fold increase in performance by doing so.","PeriodicalId":124513,"journal":{"name":"Proceedings 11th Workshop on Parallel and Distributed Simulation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114253529","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}

引用次数: 5

Asynchronous parallel algorithms for test set partitioned fault simulation 测试集分区故障仿真的异步并行算法

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1145/268826.268898

D. Krishnaswamy, P. Banerjee, E. Rudnick, J. Patel

引用次数: 6

Stack-free process-oriented simulation 面向堆栈的无流程仿真

Proceedings 11th Workshop on Parallel and Distributed Simulation Pub Date : 1997-06-01 DOI: 10.1145/268826.268919

C. Booth, D. I. Bruce

引用次数: 12