An efficient algorithm for a task allocation problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of the ACM (JACM) Année : 1992

An efficient algorithm for a task allocation problem

Résumé

This paper presents an efficient algorithm to solve one of the task allocation problems. Task assignment in an heterogeneous multiple processors system is investigated. The cost function is formulated in order to measure the intertask communication and processing costs in an uncapacited network. A formulation of the problem in terms of the minimization of a submodular quadratic pseudo-Boolean function with assignment constraints is then presented. The use of a branch-and-bound algorithm using a Lagrangean relaxation of these constraints is proposed. The lower bound is the value of an approximate solution to the Lagrangean dual problem. A zero-duality gap, that is, a saddle point, is characterized by checking the consistency of a pseudo-Boolean equation. A solution is found for large-scale problems (e.g., 20 processors, 50 tasks, and 200 task communications or 10 processors, 100 tasks, and 300 task communications). Excellent experimental results were obtained which are due to the weak frequency of a duality gap and the efficient characterization of the zero-gap (for practical purposes, this is achieved in linear time). Moreover, from the saddle point, it is possible to derive the optimal task assignment.
Fichier non déposé

Dates et versions

hal-01124505 , version 1 (06-03-2015)

Identifiants

Citer

Alain Billionnet, Marie-Christine Costa, Alain Sutter. An efficient algorithm for a task allocation problem. Journal of the ACM (JACM), 1992, 39 (3), pp.502-518. ⟨10.1145/146637.146646⟩. ⟨hal-01124505⟩

Collections

CNAM CEDRIC-CNAM
35 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More