A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs

Abstract

In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor and the p slaves have different computation and communication capabilities. We assume communication-computation overlap for each slave (and for the master), but the communication medium is exclusive: the master can only communicate with a single slave at each time-step. We give a polynomial-time algorithm to solve the following scheduling problem: given a time-bound T, what is the maximal number of tasks that can be processed by the master and the p slaves within T time-units?.
No file

Dates and versions

hal-00807403 , version 1 (03-04-2013)

Identifiers

  • HAL Id : hal-00807403 , version 1

Cite

Olivier Beaumont, Arnaud Legrand, Yves Robert. A polynomial-time algorithm for allocating independent tasks on heterogeneous fork-graphs. [Research Report] 2002-7, 2002. ⟨hal-00807403⟩
132 View
0 Download

Share

Gmail Facebook X LinkedIn More