The Triangular Pyramid Scheduling Model and algorithm for PDES in Grid |
| |
| Authors: | Zhihui Du Man Wang Yinong Chen Yin Ye Xudong Chai |
| |
| Affiliation: | 1. Tsinghua National Laboratory for Information Science and Technology, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China;2. School of Computing, Informatics and Decision Systems Eng., Arizona State University, Tempe AZ85287, USA;3. Beijing Simulation Center, Beijing 100854, China;1. Departamento de Ingeniería de Sistemas y Automática, Escuela Superior de Ingenieros, Universidad de Sevilla, Sevilla, Spain;2. Advanced Control Systems Research Group (SAC), Institut de Robotica i Informatica Industrial (CSIC-UPC), Barcelona, Spain;1. Department of Mathematics and Statistics, Washington State University, Pullman, 99163, United States;2. Department of Computer Science, Washington State University, Richland, 99354, United States;1. Department of Community Medicine and Public Health, Lucknow, Uttar Pradesh, India;2. Department of Pediatrics, King George''s Medical University, Lucknow, Uttar Pradesh, India;3. Community Empowerment Lab, Lucknow, Uttar Pradesh, India |
| |
| Abstract: | Grid is a perfect environment for the large scale Parallel Discrete Event Simulation (PDES), because its distribution and collaboration features match the PDES applications well. The PDES tasks or applications are modeled as a Directed Acyclic Graph (DAG), in which the simulation resources consist of three critical factors, simulation hosting machine (SHM), simulation service (SS) and simulation data (SD) in Grid environment. By solving the model we attempt to obtain an optimized triangular matching of the simulation resources on Grid, so that it can support the PDES activities better. We name the algorithm of solving the model Triangular Pyramid Scheduling (TPS). The PDES DAG is divided into three basic graph structures: Sequential structure, Fork structure, and Join structure. The TPS algorithm is developed based on these graph structures. The simulation results show that TPS algorithm can reduce the makespan and congestion, improve the simulation efficiency, and increase the resource utilization efficiency, compared to the existing algorithms. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
