Paper Info
Title
Simulation of task graph systems in heterogeneous computing environments
Abstract
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological representation of the task graph that takes advantage of directly modeling precedence constraints and other characteristics inherent in generalized stochastic Petri nets (GSPN). The GSPN representation is enhanced with enabling functions that govern the sequence of firings of transitions representing execution of tasks. The regulated flow of activity is carried out observing not only precedence constraints but specific allocation heuristics and communication delays. The tool is useful in evaluating different heuristics described by the corresponding implemented algorithm, or using a deterministic time-span given by a Gantt chart
Year
DOI
Venue
1999
10.1109/HCW.1999.765116
Heterogeneous Computing Workshop, 1999.
Keywords
Field
DocType
Petri nets,delays,parallel processing,virtual machines,Gantt chart,Petri net based topological representation,allocation heuristics,communication delays,complex jobs,deterministic time-span,generalized stochastic Petri nets,heterogeneous computing environments,precedence constraint modelling,simulation,task graph systems,transition firing sequence
Graph,Virtual machine,Petri net,Computer science,Symmetric multiprocessor system,Stochastic Petri net,Theoretical computer science,Heuristics,Gantt chart,Discrete event simulation,Distributed computing
Conference
ISSN
ISBN
Citations 
1097-5209
0-7695-0107-9
7
PageRank 
References 
Authors
1.08
18
2
Name
Order
Citations
PageRank
Lopez-Benitez, N.171.08
Ja-Young Hyon271.08