Jy. Colin et P. Colin, SCHEDULING TASKS AND COMMUNICATIONS ON A VIRTUAL DISTRIBUTED SYSTEM, European journal of operational research, 94(2), 1996, pp. 271-276
Citations number
4
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
A set of tasks has to be scheduled on identical parallel processors su
bject to precedence constraints and small communication delays. A poly
nomial algorithm is known to exist if task duplication is allowed and
the number of available processors is not limited. However the problem
of communications scheduling is not taken into account. In this paper
, we prove that this algorithm also never saturates communication chan
nels and always delivers messages on time, if slightly stronger constr
aints are imposed on the tasks.