Event pool structures for PDES on many-core Beowulf clusters

Event pool structures for PDES on many-core Beowulf clusters
复制标题

多核 Beowulf 集群上 PDES 的事件池结构

DOI:
10.1145/2486092.2486106
复制
发表时间:
2013
期刊:
ACM SIGSIM Conference on Principles of Advanced Discrete Simulation
影响因子:
--
通讯作者:
Wilsey, Philip A.
Wilsey, Philip A.
中科院分区:
--
文献类型:
--
作者:
Dickman, Tom;Gupta, Sounak;Wilsey, Philip A.

文献摘要

参考文献

被引文献

相似文献

多核和众核处理芯片正在变得普遍,并且现在被广泛集成到 Beowulf 集群中。这给分布式仿真带来了一个具有挑战性的问题,因为现在有必要扩展算法以在包括共享内存和分布式内存硬件的平台上运行。此外,随着片上内核数量的增加,开发没有明显共享数据结构争用的解决方案的挑战也随之增加。对于待处理事件列表数据结构尤其如此,其中多个执行线程尝试调度下一个事件来执行。这个问题在并行模拟中尤其严重,其中事件执行通常是细粒度的,很快就会导致对待处理事件列表的非平凡争用。本手稿探讨了软件架构和几种数据结构的设计,以管理在时间扭曲同步并行模拟引擎中执行的待处理事件集。这些实验特别针对包含 8 核至 48 核处理器的多核和众核 Beowulf 集群。这些研究包括使用三种不同的数据结构来保存待处理事件集的两级结构,即:展开树、STL 多重集和梯形队列。给出了使用两种体系结构处理待处理事件集的三种数据结构的性能比较。
Multi-core and many-core processing chips are becoming widespread and are now being widely integrated into Beowulf clusters. This poses a challenging problem for distributed simulation as it now becomes necessary to extend the algorithms to operate on a platform that includes both shared memory and distributed memory hardware. Furthermore, as the number of on-chip cores grows, the challenges for developing solutions without significant contention for shared data structures grows. This is especially true for the pending event list data structures where multiple execution threads attempt to schedule the next event for execution. This problem is especially aggravated in parallel simulation, where event executions are generally fine-grained leading quickly to non-trivial contention for the pending event list.This manuscript explores the design of the software architecture and several data structures to manage the pending event sets for execution in a Time Warp synchronized parallel simulation engine. The experiments are especially targeting multi-core and many-core Beowulf clusters containing 8-core to 48-core processors. These studies include a two-level structure for holding the pending event sets using three different data structures, namely: splay trees, the STL multiset, and ladder queues. Performance comparisons of the three data structures using two architectures for the pending event sets are presented.
集群时间扭曲和逻辑模拟
DOI: 10.1109/pads.1995.404310
发表时间: 1995
期刊: Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)
影响因子: --
作者:
Hervé Avril;C. Tropper
通讯作者: C. Tropper
惰性队列:待处理事件集的高效实现
DOI: 10.1109/simsym.1991.151506
发表时间: 1991
期刊: [1991] Proceedings of the 24th Annual Simulation Symposium
影响因子: --
作者:
R. Rönngren;J. Riboe;R. Ayani
通讯作者: R. Ayani
DOI: 10.1137/0606031
发表时间: 1985-04
期刊: Siam Journal on Algebraic and Discrete Methods
影响因子: --
作者:
R. Tarjan
通讯作者: R. Tarjan
用于乐观仿真系统的低开销恒定时间 LTF 调度程序
DOI: 10.1109/iscc.2010.5546544
发表时间: 2010
期刊: The IEEE symposium on Computers and Communications
影响因子: --
作者:
Tiziano Santoro;F. Quaglia
通讯作者: F. Quaglia
Time Warp 中事件集的高效实现
DOI: 10.1145/158459.158472
发表时间: 1993
期刊: Proceedings 9th Workshop on Parallel and Distributed Simulation (ACM/IEEE)
影响因子: --
作者:
R. Rönngren;R. Ayani;R. Fujimoto;Samir R Das
通讯作者: Samir R Das