Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation最新文献

筛选
英文 中文
Session details: Keynote Speech 2 会议详情:主题演讲2
C. Carothers
{"title":"Session details: Keynote Speech 2","authors":"C. Carothers","doi":"10.1145/3252257","DOIUrl":"https://doi.org/10.1145/3252257","url":null,"abstract":"","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125296268","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}
引用次数: 0
SPOCK: Exact Parallel Kinetic Monte-Carlo on 1.5 Million Tasks 精确平行动力学蒙特卡洛150万任务
T. Oppelstrup, D. Jefferson, V. Bulatov, L. Zepeda-Ruiz
{"title":"SPOCK: Exact Parallel Kinetic Monte-Carlo on 1.5 Million Tasks","authors":"T. Oppelstrup, D. Jefferson, V. Bulatov, L. Zepeda-Ruiz","doi":"10.1145/2901378.2901403","DOIUrl":"https://doi.org/10.1145/2901378.2901403","url":null,"abstract":"We have created a scalable implementation of the kinetic Monte-Carlo method, SPOCK (Scalable Parallel Optimistic Crystal Kinetics). Unlike most reported parallel implementations relying on approximation to achieve parallelism, our parallelization is exact and accomplished using the Time Warp paradigm. We demonstrate that our implementation exhibits near perfect scaling for two different and important classes of systems. It runs efficiently on Vulcan, a 24 thousand node BlueGene/Q machine, using all ~400 thousand cores and ~1.6 million MPI tasks. Further, we have run production simulations using the full Vulcan machine and requiring nearly all available system memory. In this paper we demonstrate these results, and discuss some important implementation details. The kinetic Monte-Carlo method is ubiquitous within the natural sciences, and important classes of problems have so far been limited to sequential simulation. For many scientific simulations, an exact parallel implementation of the kinetic Monte-Carlo method has the potential of being game changing.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131533077","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
A Simulator for Distributed Cache Managementin Friend-to-Friend Networks 友对友网络中分布式缓存管理的模拟器
Keynan Pratt, C. Williamson
{"title":"A Simulator for Distributed Cache Managementin Friend-to-Friend Networks","authors":"Keynan Pratt, C. Williamson","doi":"10.1145/2901378.2901398","DOIUrl":"https://doi.org/10.1145/2901378.2901398","url":null,"abstract":"Multimedia streaming services such as YouTube and Netflix consume a staggering amount of Internet bandwidth [1]. Furthermore, traditional mechanisms such as proxy caches, content distribution networks, and redundant traffic elimination are rendered ineffective by copyright concerns, regulatory issues, and the growing prevalence of end-to-end encryption. One possible solution is a peer-to-peer caching system with social relationships at the core of its topology construction. A social topology carries an implicit level of trust, and induces a relatively high degree of correlation between users that can be exploited by the system as a whole. For example, two users with shared interests are more likely to have relevant videos in cache for each other. This short paper discusses the design of a simulator for such a system to provide insight into the performance of different cache management policies.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127788184","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}
引用次数: 0
Session details: Session on Crowd and Agent Models 会议详情:关于人群和代理模型的会议
Patrick Lange
{"title":"Session details: Session on Crowd and Agent Models","authors":"Patrick Lange","doi":"10.1145/3252256","DOIUrl":"https://doi.org/10.1145/3252256","url":null,"abstract":"","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127811592","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}
引用次数: 0
NeMo: A Massively Parallel Discrete-Event Simulation Model for Neuromorphic Architectures NeMo:神经形态架构的大规模并行离散事件仿真模型
Mark Plagge, C. Carothers, Elsa Gonsiorowski
{"title":"NeMo: A Massively Parallel Discrete-Event Simulation Model for Neuromorphic Architectures","authors":"Mark Plagge, C. Carothers, Elsa Gonsiorowski","doi":"10.1145/2901378.2901392","DOIUrl":"https://doi.org/10.1145/2901378.2901392","url":null,"abstract":"Neuromorphic computing is a non-von Neumann architec- ture that mimics how the brain performs neural network types of computation in real hardware. It has been shown that this class of computing can execute data classification algorithms using only a tiny fraction of the power a con- ventional CPU would use to execute this algorithm. This raises the larger research question: how might neuromorphic computing be used to improve the application performance, power consumption, and overall system reliability of future supercomputers? To address this question, an open-source neuromorphic processor architecture simulator called NeMo is being developed. This effort will enable the design space exploration of potential hybrid CPU, GPU, and neuromor- phic systems. The key focus of this paper is on the design, implementation and performance of NeMo. Demonstration of NeMo's efficient execution on 1024 nodes of an IBM Blue Gene/Q system for a 65,536 neuromorphic processing core model is reported. The peak performance of NeMo is just over two billion events-per-second when operating at this scale.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133385793","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}
引用次数: 26
Session details: Session on M&S of Software Define Networks 会议细节:软件定义网络的M&S会议
Peter Barnes
{"title":"Session details: Session on M&S of Software Define Networks","authors":"Peter Barnes","doi":"10.1145/3252259","DOIUrl":"https://doi.org/10.1145/3252259","url":null,"abstract":"","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124264383","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}
引用次数: 0
Using DEv-PROMELA for Modelling and Verification of Software 利用DEv-PROMELA进行软件建模与验证
Aznam Yacoub, M. Hamri, C. Frydman
{"title":"Using DEv-PROMELA for Modelling and Verification of Software","authors":"Aznam Yacoub, M. Hamri, C. Frydman","doi":"10.1145/2901378.2901388","DOIUrl":"https://doi.org/10.1145/2901378.2901388","url":null,"abstract":"Efficient modelling and verification of models need an accurate representation of systems. Especially, PROMELA cannot represent time as quantitative properties. That means some properties depending on time cannot be checked with SPIN model-checker. Discrete-Time approaches and dense representation of time were successfully introduced in SPIN as extensions but suffer of the expected statespace explosion problem. Another approach using discrete-event representation of time and simulation has been proposed to minimize this statespace explosion problem. In this paper, we show how this extension, DEv-PROMELA, can be used in order to model and verify software designs by combining simulation and formal verification.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127884699","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
Modeling a Million-Node Slim Fly Network Using Parallel Discrete-Event Simulation 基于并行离散事件仿真的百万节点瘦飞网络建模
Noah Wolfe, C. Carothers, M. Mubarak, R. Ross, P. Carns
{"title":"Modeling a Million-Node Slim Fly Network Using Parallel Discrete-Event Simulation","authors":"Noah Wolfe, C. Carothers, M. Mubarak, R. Ross, P. Carns","doi":"10.1145/2901378.2901389","DOIUrl":"https://doi.org/10.1145/2901378.2901389","url":null,"abstract":"As supercomputers close in on exascale performance, the increased number of processors and processing power translates to an increased demand on the underlying network interconnect. The Slim Fly network topology, a new lowdiameter and low-latency interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this paper, we present a high-fidelity Slim Fly it-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate our Slim Fly model with the Kathareios et al. Slim Fly model results provided at moderately sized network scales. We further scale the model size up to n unprecedented 1 million compute nodes; and through visualization of network simulation metrics such as link bandwidth, packet latency, and port occupancy, we get an insight into the network behavior at the million-node scale. We also show linear strong scaling of the Slim Fly model on an Intel cluster achieving a peak event rate of 36 million events per second using 128 MPI tasks to process 7 billion events. Detailed analysis of the underlying discrete-event simulation performance shows how the million-node Slim Fly model simulation executes in 198 seconds on the Intel cluster.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131798805","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}
引用次数: 22
Granular Time Warp Objects 粒度时间扭曲对象
Nazzareno Marziale, Francesco Nobilia, Alessandro Pellegrini, F. Quaglia
{"title":"Granular Time Warp Objects","authors":"Nazzareno Marziale, Francesco Nobilia, Alessandro Pellegrini, F. Quaglia","doi":"10.1145/2901378.2901390","DOIUrl":"https://doi.org/10.1145/2901378.2901390","url":null,"abstract":"A recent trend has shown the relevance of PDES paradigms where simulation objects are no longer seen as fully disjoint entities only interacting via events' scheduling. Particularly, mutual cross-state access (as a form of state sharing) can represent an approach enabling the simplification of the programmer's job. In this article, we present a multi-core oriented Time Warp platform supporting so called granular objects, where cross-state access is transparently enabled jointly with the dynamic clustering (granulation) of objects into groups depending on the volume of mutual state accesses along phases of the model execution. Each group represents an island where activities are sequentially dispatched in timestamp order. Concurrency is still preserved by enabling the optimistic execution of the different islands. Granulated objects do not pay synchronization costs due to mutual causal inconsistencies. Also, the underlying Time Warp platform does not pay memory management (e.g. memory access tracing) overheads to determine that mutual accesses are taking place within a group. Overall, the platform transparently (and dynamically) determines a well-suited granulation of the overall model state, and a corresponding level of concurrency, depending on the actual state access pattern by the simulation code. As far as we know, this is the first study where the problem of clustering Time Warp simulation objects is addressed for the case of in-place cross-object state accesses by the application code, and where dynamic granulation of multiple objects in a larger one is supported in a fully transparent manner. We integrated our proposal in the open source ROOT-Sim platform.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131846679","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}
引用次数: 12
An Adaptive Road Traffic Regulation with Simulation and Internet of Things 基于仿真和物联网的自适应道路交通管理
S. Rajendran, S. Chelladurai, A. Aravind
{"title":"An Adaptive Road Traffic Regulation with Simulation and Internet of Things","authors":"S. Rajendran, S. Chelladurai, A. Aravind","doi":"10.1145/2901378.2901406","DOIUrl":"https://doi.org/10.1145/2901378.2901406","url":null,"abstract":"Traffic congestion is a growing concern in most cities across the world. It is primarily caused by a sudden increase in the number of vehicles in a relatively small number of roads and intersections, while other roads have the capacity to accommodate more traffic. In such situations, distributing traffic to roads in a balanced way could alleviate congestion. With the help of modern technology such as Internet of Things (IoT) and simulation, road users can be encouraged to choose their route on-the-fly, by providing necessary information such as projected travel time on the next leg. In extreme situations, traffic on some critical roads could be adaptively reduced by even introducing levy. A simple solution like providing road traffic information, benefits and penalties, etc., ahead in each intersection would allow travellers to make cognizant choices and therefore could lead to a better, more efficient traffic distribution. To implement the proposed system, simulation and IoT must be brought together by a suitable communication middleware system so that they can work in synchrony. Implementing an actual IoT infrastructure and then testing the cause and effects of traffic congestion with the system in-place is a daunting task. Simulation would help us to test and validate the IoT system for functionality, performance, and scalability. In this paper, we propose a novel framework for integrating IoT and simulation using a message-oriented middleware in the context of an adaptive traffic regulation system and then demonstrate the framework with the help of a prototype implementation.","PeriodicalId":325258,"journal":{"name":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121434879","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
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学术文献互助群
群 号:481959085
Book学术官方微信