### 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.

Original language | English |
---|---|

Pages (from-to) | 1678-1689 |

Number of pages | 12 |

Journal | Simulation Modelling Practice and Theory |

Volume | 17 |

Issue number | 10 |

DOIs | |

Publication status | Published - 1 Nov 2009 |

Externally published | Yes |

### Fingerprint

### Keywords

- DAG (Directed Acyclic Graph)
- Grid computing
- PDES (Parallel Discrete Event Simulation)
- Scheduling algorithm

### ASJC Scopus subject areas

- Hardware and Architecture
- Software
- Modelling and Simulation

### Cite this

*Simulation Modelling Practice and Theory*,

*17*(10), 1678-1689. https://doi.org/10.1016/j.simpat.2009.08.002

**The Triangular Pyramid Scheduling Model and algorithm for PDES in Grid.** / Du, Zhihui; Wang, Man; Chen, Yinong; Ye, Yin; Chai, Xudong.

Research output: Contribution to journal › Article

*Simulation Modelling Practice and Theory*, vol. 17, no. 10, pp. 1678-1689. https://doi.org/10.1016/j.simpat.2009.08.002

}

TY - JOUR

T1 - The Triangular Pyramid Scheduling Model and algorithm for PDES in Grid

AU - Du, Zhihui

AU - Wang, Man

AU - Chen, Yinong

AU - Ye, Yin

AU - Chai, Xudong

PY - 2009/11/1

Y1 - 2009/11/1

N2 - 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.

AB - 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.

KW - DAG (Directed Acyclic Graph)

KW - Grid computing

KW - PDES (Parallel Discrete Event Simulation)

KW - Scheduling algorithm

UR - http://www.scopus.com/inward/record.url?scp=70349233747&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349233747&partnerID=8YFLogxK

U2 - 10.1016/j.simpat.2009.08.002

DO - 10.1016/j.simpat.2009.08.002

M3 - Article

AN - SCOPUS:70349233747

VL - 17

SP - 1678

EP - 1689

JO - Simulation Modelling Practice and Theory

JF - Simulation Modelling Practice and Theory

SN - 1569-190X

IS - 10

ER -