A hierarchical parallel discrete event simulation kernel for multicore platform

被引:1
作者
Tang Wenjie
Yao Yiping
Zhu Feng
机构
[1] National University of Defense Technology,School of Computer Science
来源
Cluster Computing | 2013年 / 16卷
关键词
Multicore; Parallel discrete event simulation; Hierarchical simulation kernel;
D O I
暂无
中图分类号
学科分类号
摘要
The development of CPU has stepped into the era of multicore. Current parallel simulation kernel utilizes multicore resource by multi-process, which leads to inefficiency on communication and synchronization. To fulfill this gap, we proposed a HPSK (hierarchical parallel simulation kernel) model, which schedules logical processes and executes events in parallel with multithread paradigm. Based on this model, three key algorithms were proposed to support high performance: (1) An event management algorithm was proposed to improve the efficiency of creation and release of events. It uses a lock-free creation and asynchronous commitment mechanism to decouple the relationship between threads, hence reduce the overhead of locks. (2) A pointer-based communication algorithm was proposed to improve efficiency of communication between threads. It uses a buffer mechanism to avoid interrupting the execution of target thread. The target thread will read events from the buffers when it needs. By using ring-structure buffers, synchronization between sending and receiving of threads can be annihilated. (3) An approximate method was proposed to compute LBTS (Lower Bound on Time Stamp). It uses an asynchronous mechanism to eliminate disturbing of thread execution and a two-level filter mechanism to reduce redundant LBTS computation. A series of experiments with a modified phold model show that HPSK can achieve good performance for applications on different conditions. It can run 8× faster than μsik when event locality and lookahead is low.
引用
收藏
页码:379 / 387
页数:8
相关论文
共 16 条
  • [1] Bagrodia R.(1998)Parsec: a parallel simulation environment for complex systems Computer 31 77-85
  • [2] Takai M.(2008)Solution for analytic simulation based on parallel processing J. Syst. Simul. 20 6617-6621
  • [3] Chen Y.(2004)Scalable lock-free dynamic memory allocation ACM SIGPLAN Not. 39 35-46
  • [4] Zeng X.(1993)Efficient algorithms for distributed snapshots and global virtual time approximation J. Parallel Distrib. Comput. 18 423-434
  • [5] Martin J.(1997)Computing global virtual time in shared-memory multiprocessors ACM Trans. Model. Comput. Simul. 7 425-446
  • [6] Yao Y.(2010)Synchronization in federation community networks J. Parallel Distrib. Comput. 70 144-159
  • [7] Zhang Y.(2009)Intersecting-information-based matching algorithm for dynamic DDM Chin. J. Comput 32 1375-1381
  • [8] Michael M.M.(undefined)undefined undefined undefined undefined-undefined
  • [9] Mattern F.(undefined)undefined undefined undefined undefined-undefined
  • [10] Fujimoto R.M.(undefined)undefined undefined undefined undefined-undefined