The Community for Technology Leaders
High Performance Computing and Grid in Asia Pacific Region, International Conference on (1997)
Seoul, Korea
Apr. 28, 1997 to May 2, 1997
ISBN: 0-8186-7901-8
pp: 204
Tag Con Kim , Dept. of Comput. Eng., Yeungnam Univ., Kyungsangbook-do, South Korea
Kyu Ho Park , Dept. of Comput. Eng., Yeungnam Univ., Kyungsangbook-do, South Korea
Ki Hyung Kim , Dept. of Comput. Eng., Yeungnam Univ., Kyungsangbook-do, South Korea
ABSTRACT
The paper presents a concurrency preserving partitioning algorithm for the optimistic parallel simulation of hierarchical, modular discrete event models. The proposed algorithm pursues the following three goals to achieve the overall objective of a minimum simulation time: (1) balance the computational loads of partitions; (2) maximize the parallel execution of independent models; and (3) minimize inter-processor communication. To estimate the parallelism inherent in models, the proposed algorithm utilizes the inherent hierarchical structural information of DEVS models. The paper describes how the proposed algorithm works through an example partitioning process.
INDEX TERMS
parallel algorithms; concurrency preserving partitioning algorithm; optimistic parallel simulation; hierarchical modular discrete event models; minimum simulation time; computational load balancing; maximized parallel execution; minimized inter-processor communication; parallelism; inherent hierarchical structural information; independent model
CITATION
Tag Con Kim, Kyu Ho Park, Ki Hyung Kim, "A concurrency preserving partitioning algorithm for parallel simulation of hierarchical, modular discrete event models", High Performance Computing and Grid in Asia Pacific Region, International Conference on, vol. 00, no. , pp. 204, 1997, doi:10.1109/HPC.1997.592147
89 ms
(Ver 3.3 (11022016))