Scheduling Instructions on Hierarchical Machines

Abstract : The aim of this work is to study the problem of scheduling fine grain task graphs on hierarchical distributed systems with communication delay. We consider as a case study how to schedule the instructions on a processor that implements incomplete bypass ( ST200). We show first how this problem can be expressed as scheduling unitary tasks on a hierarchical architecture with heavy communications between clustered units. The proposed analysis is generic and can be extended to other challenging problems like scheduling in clusters of multi-cores. Our main result is an approximation algorithm based on list scheduling whose approximation ratio is the minimum of two expressions, the first one depends on the number of clusters while the second one depends on the communication delay. Experiments run on random graphs and on structured graphs demonstrate the effectiveness of the proposed approach.
Complete list of metadatas

https://hal.inria.fr/hal-00798448
Contributor : Grégory Mounié <>
Submitted on : Friday, March 8, 2013 - 3:31:56 PM
Last modification on : Wednesday, March 13, 2019 - 3:02:07 PM

Links full text

Identifiers

Collections

Citation

Florent Blachot, Guillaume Huard, Johnatan Pecero Sanchez, Érik Saule, Denis Trystram. Scheduling Instructions on Hierarchical Machines. 11th International Workshop on Parallel and Distributed Scientific and Engineering Computing (PDSEC 2010), 2010, Atlanta, United States. ⟨10.1109/IPDPSW.2010.5470711⟩. ⟨hal-00798448⟩

Share

Metrics

Record views

359