Abstract
A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of all tasks and spreads these tasks to use few processors per cluster, for a DAG with small communication delays. It also avoids message contention, and always delivers messages on time. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Colin, J. Y., & Nakechbandi, M. (2011). Scheduling tasks and communications on a hierarchical system with message contention. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7017 LNCS, pp. 89–98). https://doi.org/10.1007/978-3-642-24669-2_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
