Improving the efficiency of functional parallelism by means of hyper-scheduling

By means of a comprehensive test bench of 36000 test cases we evaluated the efficiency of functional parallel programs. For all the test cases schedules have been computed by various well known heuristics. We assumed a homogeneous target system (e.g. a compute cluster of equally powerful interconnected nodes) that can be part of a grid computing environment which supports the execution of parallel programs. Unfortunately, the efficiencies of the investigated schedules were pretty low. For this reason, we propose a new hyper-scheduling approach that reduces the amount of idle times by interweaving subsequent schedules from the parallel job queue. First results confirm that hyper-scheduling significantly improves efficiency

[1]  Ishfaq Ahmad,et al.  Efficient Scheduling of Arbitrary TAsk Graphs to Multiprocessors Using a Parallel Genetic Algorithm , 1997, J. Parallel Distributed Comput..

[2]  Rajkumar Buyya,et al.  A taxonomy of scientific workflow systems for grid computing , 2005, SGMD.

[3]  Wolfram Schiffmann,et al.  A Parallel Branch-and-Bound Algorithm for Computing Optimal Task Graph Schedules , 2003, GCC.

[4]  Ishfaq Ahmad,et al.  Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

[5]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[6]  Radu Prodan,et al.  Scheduling of scientific workflows in the ASKALON grid environment , 2005, SGMD.

[7]  Ishfaq Ahmad,et al.  Benchmarking and Comparison of the Task Graph Scheduling Algorithms , 1999, J. Parallel Distributed Comput..

[8]  Yolanda Gil,et al.  Pegasus: Mapping Scientific Workflows onto the Grid , 2004, European Across Grids Conference.

[9]  Wolfram Schiffmann,et al.  Fast Optimal Task Graph Scheduling by Means of an Optimized Parallel A*-Algorithm , 2004, PDPTA.

[10]  Wolfram Schiffmann,et al.  Comparison of nature inspired and deterministic scheduling heuristics considering optimal schedules , 2005 .

[11]  Wolfram Schiffmann,et al.  An ACO-based approach for scheduling task graphs with communication costs , 2005, 2005 International Conference on Parallel Processing (ICPP'05).

[12]  Thomas Fahringer,et al.  A-GWL: Abstract Grid Workflow Language , 2004, International Conference on Computational Science.

[13]  ProdanRadu,et al.  Scheduling of scientific workflows in the ASKALON grid environment , 2005 .

[14]  Kuldip Singh,et al.  An Improved Duplication Strategy for Scheduling Precedence Constrained Graphs in Multiprocessor Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[15]  W. Schiffmann,et al.  A COMPREHENSIVE TEST BENCH FOR THE EVALUATION OF SCHEDULING HEURISTICS , 2004 .

[16]  Y.-K. Kwok,et al.  Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.