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
Conference Papers Year : 2002

A Polynomial-Time Algorithm for Allocating Independent Tasks on Heterogeneous Fork-Graphs

Arnaud Legrand
Yves Robert

Abstract

In this paper, we consider the problem of allocating a large number ofindependent, equal-sized tasks to a heterogeneous processor farm. Themaster processor P 0 can process a task within w 0 time-units; it communicatesa task in d i time-units to the i-th slave P i , 1 i p, which requiresw i time-units to process it. We assume communication-computationoverlap capabilities for each slave (and for the master), but the communicationmedium is exclusive: the master can only communicate with asingle slave at each time-step.
No file

Dates and versions

hal-00789456 , version 1 (18-02-2013)

Identifiers

  • HAL Id : hal-00789456 , version 1

Cite

Olivier Beaumont, Arnaud Legrand, Yves Robert. A Polynomial-Time Algorithm for Allocating Independent Tasks on Heterogeneous Fork-Graphs. ISCIS XVII, Seventeenth International Symposium On Computer and Information Sciences, 2002, Unknown, pp.115―119. ⟨hal-00789456⟩
61 View
0 Download

Share

Gmail Facebook X LinkedIn More