The Triangular Pyramid Scheduling Model and algorithm for PDES in Grid

Zhihui Du, Man Wang, Yinong Chen, Yin Ye, Xudong Chai

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 languageEnglish
Pages (from-to)1678-1689
Number of pages12
JournalSimulation Modelling Practice and Theory
Volume17
Issue number10
DOIs
Publication statusPublished - 1 Nov 2009
Externally publishedYes

Fingerprint

Parallel Discrete Event Simulation
Triangular pyramid
Discrete event simulation
Scheduling
Grid
Simulation
Scheduling algorithms
Directed Acyclic Graph
Scheduling Algorithm
Resources
Model
Graph in graph theory
Congestion
Join
Triangular

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

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

In: Simulation Modelling Practice and Theory, Vol. 17, No. 10, 01.11.2009, p. 1678-1689.

Research output: Contribution to journalArticle

Du, Zhihui ; Wang, Man ; Chen, Yinong ; Ye, Yin ; Chai, Xudong. / The Triangular Pyramid Scheduling Model and algorithm for PDES in Grid. In: Simulation Modelling Practice and Theory. 2009 ; Vol. 17, No. 10. pp. 1678-1689.
@article{612cc1b25fa24da38716964072ad00cd,
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.",
keywords = "DAG (Directed Acyclic Graph), Grid computing, PDES (Parallel Discrete Event Simulation), Scheduling algorithm",
author = "Zhihui Du and Man Wang and Yinong Chen and Yin Ye and Xudong Chai",
year = "2009",
month = "11",
day = "1",
doi = "10.1016/j.simpat.2009.08.002",
language = "English",
volume = "17",
pages = "1678--1689",
journal = "Simulation Modelling Practice and Theory",
issn = "1569-190X",
publisher = "Elsevier",
number = "10",

}

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

VL - 17

SP - 1678

EP - 1689

JO - Simulation Modelling Practice and Theory

JF - Simulation Modelling Practice and Theory

SN - 1569-190X

IS - 10

ER -