loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'04)
A Static Task Scheduling Heuristic for Homogeneous Computing Environments
A Coruna, Spain
February 11-February 13
ISBN: 0-7695-2083-9
ASCII Text
x 
 
Tarek Hagras, Jan Janeček, "A Static Task Scheduling Heuristic for Homogeneous Computing Environments," Parallel, Distributed, and Network-Based Processing, Euromicro Conference on, pp. 192, 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/EMPDP.2004.1271445,
author = {Tarek Hagras and Jan Janeček},
title = {A Static Task Scheduling Heuristic for Homogeneous Computing Environments},
journal ={Parallel, Distributed, and Network-Based Processing, Euromicro Conference on},
volume = {0},
year = {2004},
issn = {1066-6192},
pages = {192},
doi = {http://doi.ieeecomputersociety.org/10.1109/EMPDP.2004.1271445},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
TI - A Static Task Scheduling Heuristic for Homogeneous Computing Environments
SN - 1066-6192
SP
EP
A1 - Tarek Hagras,
A1 - Jan Janeček,
PY - 2004
KW - list scheduling
KW - compile time scheduling
KW - task graph scheduling
KW - homogeneous computing
VL - 0
JA - Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
ER -
 
Tarek Hagras, Czech Technical University in Prague
Jan Janeček, Czech Technical University in Prague
List-based scheduling is generally accepted as an attractive approach to static task scheduling in a homogeneous environment, since it pairs low complexity with good results. This paper presents a low complexity algorithm based on list-scheduling and task-duplication on a bounded number of fully connected homogeneous machines. The algorithm is called Critical Unlisted Parents with Fast Duplicator (CUPFD). The CUPFD algorithm consists of two phases: the listing phase, which is a simple listing heuristic based on list-scheduling, and a low complexity machine assigning phase based on task-duplication. The experimental work has shown that CUPFD outperformed on average all other higher complexity algorithms.
Index Terms:
list scheduling, compile time scheduling, task graph scheduling, homogeneous computing
Citation:
Tarek Hagras, Jan Janeček, "A Static Task Scheduling Heuristic for Homogeneous Computing Environments," pdp, pp.192, 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.