Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)最新文献

筛选
英文 中文
The treatment of state in optimistic systems 乐观系统中状态的处理
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1109/PADS.1995.404318
D. Bruce
{"title":"The treatment of state in optimistic systems","authors":"D. Bruce","doi":"10.1109/PADS.1995.404318","DOIUrl":"https://doi.org/10.1109/PADS.1995.404318","url":null,"abstract":"Optimistic computation methods typically save copies of objects' state information, so that they can recover from erroneous 'over-optimistic' computations. Such state saving is generally time and space consuming, and can be rather complicated both to implement and to use. I show how the data structure community's theory of persistence can be used not only to analyse and explain the treatment of state in optimistic systems, but also as a simple yet general mechanism for performing the necessary state saving with minimal impact on application code. Preliminary results based on a benchmark application and an existing optimistic simulator are presented, showing that providing support for fully general object states is a realistic and practical option. In addition, I show how some existing state saving techniques-including support for shared state-can be derived, and discuss a number of ways in which the model might be extended.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124283566","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}
引用次数: 48
Empirical study of parallel trace-driven LRU cache simulators 并行跟踪驱动LRU缓存模拟器的实证研究
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1145/214282.214333
D. Nicol, E. Carr
{"title":"Empirical study of parallel trace-driven LRU cache simulators","authors":"D. Nicol, E. Carr","doi":"10.1145/214282.214333","DOIUrl":"https://doi.org/10.1145/214282.214333","url":null,"abstract":"This paper reports on the performance of four parallel algorithms for simulating an associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are implemented on the MasPar MP-2. Another algorithm is a parallelization of an efficient serial algorithm on the Intel Paragon. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC92 benchmark programs.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128768030","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}
引用次数: 6
SGTNE: semi-global time of the next event algorithm SGTNE:下一个事件算法的半全局时间
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1109/PADS.1995.404315
A. Boukerche, C. Tropper
{"title":"SGTNE: semi-global time of the next event algorithm","authors":"A. Boukerche, C. Tropper","doi":"10.1109/PADS.1995.404315","DOIUrl":"https://doi.org/10.1109/PADS.1995.404315","url":null,"abstract":"This paper describes an extension of the TNE algorithm, the objective of which is to increase its parallelism and to break the inter-processor deadlock inherent with the use of TNE. The algorithm, which we call the SGTNE algorithm (Semi Global TNE), is executed over a cluster of processors as opposed to TNE, which is executed over a cluster of processes assigned to a single processor. SGTNE helps to break the inter-processor deadlock by executing a shortest path algorithm over a snapshot of the LPs in a cluster of processors. This paper discusses the algorithm and its implementation and reports on the performance results of simulations of a partitioned FCFS queueing network model executed on the Intel Paragon A4 multiprocessor machine. We also examine the impact of partitioning on the efficient implementation of the SGTNE algorithm. The results obtained indicate that SGTNE yields good speedups and that a partitioning which makes use of a strongly connected component algorithm results in a reduction of 30% in the running time of a simulation when compared to simple partitioning strategies. The results also indicate that SGTNE outperforms TNE.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124183455","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}
引用次数: 11
XTracker, a graphical tool for parallel simulations XTracker,一个用于并行模拟的图形工具
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1145/214282.214344
Steven F. Bellenot, L. Duty
{"title":"XTracker, a graphical tool for parallel simulations","authors":"Steven F. Bellenot, L. Duty","doi":"10.1145/214282.214344","DOIUrl":"https://doi.org/10.1145/214282.214344","url":null,"abstract":"A Motif based graphical tool XTracker is described. XTracker can show Gannt-like charts of the activities on each node or it can show the event messages as traffic between simulation objects. XTracker can take its data from sequential simulation runs and simulate a parallel execution under a number of simulation methods. XTracker can act as a performance modeling tool.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128194388","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
On extending parallelism to serial simulators 将并行性扩展到串行模拟器
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1145/214282.214304
D. Nicol, P. Heidelberger
{"title":"On extending parallelism to serial simulators","authors":"D. Nicol, P. Heidelberger","doi":"10.1145/214282.214304","DOIUrl":"https://doi.org/10.1145/214282.214304","url":null,"abstract":"This paper describes on approach to discrete event simulation modeling that appears to be effective for developing portable and efficient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops sub-models using an existing sequential simulation modeling tool, using the full expressive power of the tool. A set of modeling language extensions permit automatically synchronized communication between sub-models; however, the automation requires that any such communication must take a non-zero amount of simulation time. Within this modeling paradigm, a variety of conservative synchronization protocols can transparently support conservative execution of sub-models on potentially different processors. A specific implementation of this approach, U.P.S. (Utilitarian Parallel Simulator), is described, along with performance results on the Intel Paragon.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126054419","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}
引用次数: 37
Effectiveness of global event queues in rollback reduction and load balancing 全局事件队列在回滚减少和负载平衡中的有效性
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1145/214282.214341
S. Prasad, B. Naqib
{"title":"Effectiveness of global event queues in rollback reduction and load balancing","authors":"S. Prasad, B. Naqib","doi":"10.1145/214282.214341","DOIUrl":"https://doi.org/10.1145/214282.214341","url":null,"abstract":"Compared to highly optimized optimistic simulators which use local event queues for individual processors on a shared-memory computer, we demonstrate that employing a single global event queue drastically reduces the number of rollbacks, brings down the storage requirements, and achieves superior load balance. On a bus-based Silicon Graphics multiprocessor, these virtues consistently translated into faster execution times and higher speedups on those synthetic networks of medium- to coarse-grained logical processes which were ridden with rollbacks and load imbalance on local-queue-based simulators. A dynamic randomization-based load distribution scheme for local-event-queue simulators is also shown to be an effective improvement.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124975413","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}
引用次数: 11
A case study in simulating PCS networks using time warp 利用时间扭曲技术模拟PCS网络的实例研究
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1109/PADS.1995.404313
C. Carothers, R. Fujimoto, Yi-Bing Lin
{"title":"A case study in simulating PCS networks using time warp","authors":"C. Carothers, R. Fujimoto, Yi-Bing Lin","doi":"10.1109/PADS.1995.404313","DOIUrl":"https://doi.org/10.1109/PADS.1995.404313","url":null,"abstract":"There has been rapid growth in the demand for mobile communications over the past few years. This has led to intensive research and development efforts for complex PCS (personal communication service) networks. Capacity planning and performance modeling is necessary to maintain a high quality of service to the mobile subscriber while minimizing cost to the PCS provider. The need for flexible analysis tools and the high computational requirements of large PCS network simulations make it an excellent candidate for parallel simulation. Here, we describe our experiences in developing two PCS simulation models on a general purpose distributed simulation platform based on the Time Warp mechanism. These models utilize two widely used approaches to simulating PCS networks: (i) the call-initiated and (ii) the portable-initiated models. We discuss design decisions that were made in mapping these models to the Time Warp executive, and characterize the workloads resulting from these models in terms of factors such as communication locality and computation granularity. We then present performance measurements for their execution on a network of workstations. These measurements indicate that the call-initiated model generally outperforms the portable initiated model, but is not able to capture phenomenon such as the \"busy line\" effect. Moreover, these studies indicate that the high locality in large-scale PCS network simulations make them well-suited for execution on general purpose parallel and distributed simulation platforms.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133982307","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}
引用次数: 73
Super-criticality revisited Super-criticality重新审视
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1145/214282.214323
Sudhir Srinivasan, P. Reynolds
{"title":"Super-criticality revisited","authors":"Sudhir Srinivasan, P. Reynolds","doi":"10.1145/214282.214323","DOIUrl":"https://doi.org/10.1145/214282.214323","url":null,"abstract":"Critical path analysis has been suggested as a technique for establishing a lower bound on the completion times of parallel discrete event simulations. A protocol is super-critical if there is at least one simulation that can complete in less than the critical path time using that protocol. Previous studies have shown that several practical protocols are super-critical while others are not. We present a sufficient condition to demonstrate that a protocol is super-critical. Also, we show that a condition used in a previous study is not sufficient but is necessary for super-criticality. It has been claimed that super-criticality requires independence of one or more messages (states) on events in the logical past of those messages (states). We present an example which contradicts this claim and examine the implications of this contradiction on lower bounds.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122708766","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}
引用次数: 16
Prediction of memory consumption in conservative parallel simulation 保守并行仿真中内存消耗的预测
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1145/214282.214347
Y. Wong, Shu-Yuen Hwang
{"title":"Prediction of memory consumption in conservative parallel simulation","authors":"Y. Wong, Shu-Yuen Hwang","doi":"10.1145/214282.214347","DOIUrl":"https://doi.org/10.1145/214282.214347","url":null,"abstract":"This paper proposes a critical path-like analyzer to predict the amount of memory consumed in a specific Chandy-Misra simulation: Segments of code are inserted into the existing sequential simulation program, and this modified simulation program is called a memory analyzer. The amount of memory needed in the corresponding Chandy-Misra simulation is computed along with the execution of the memory analyzer. Experiments to evaluate the analyzer are in progress.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114726595","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
Partitioning for synchronous parallel simulation 用于同步并行仿真的分区
Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE) Pub Date : 1995-07-01 DOI: 10.1109/PADS.1995.404301
P. Konas, P. Yew
{"title":"Partitioning for synchronous parallel simulation","authors":"P. Konas, P. Yew","doi":"10.1109/PADS.1995.404301","DOIUrl":"https://doi.org/10.1109/PADS.1995.404301","url":null,"abstract":"A new partitioning method for synchronous PDES simulations is proposed. The method exploits characteristics of both the simulation method and of the application domain to arrive at efficient partitionings. A performance study shows that the method outperforms existing partitioning methods in terms of four different performance metrics.<<ETX>>","PeriodicalId":412259,"journal":{"name":"Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130168456","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}
引用次数: 8
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学术官方微信
小红书