Paper Info
Title
The Triangular Pyramid Scheduling Model and algorithm for PDES in Grid
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.
Year
DOI
Venue
2009
10.1016/j.simpat.2009.08.002
Simulation Modelling Practice and Theory
Keywords
Field
DocType
Grid computing,PDES (Parallel Discrete Event Simulation),Scheduling algorithm,DAG (Directed Acyclic Graph)
Fork (system call),Job shop scheduling,Grid computing,Computer science,Scheduling (computing),Algorithm,Directed acyclic graph,Pyramid (geometry),Grid,Discrete event simulation
Journal
Volume
Issue
ISSN
17
10
1569-190X
Citations 
PageRank 
References 
4
0.45
16
Authors
5
Name
Order
Citations
PageRank
PengLiuZhihui Du138348.74
man wang2385.09
Yinong Chen31361127.89
Yin Ye491.57
Xudong Chai512619.46