An algorithm for finding the k-best allocations of a tree-structured program - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Parallel and Distributed Computing Année : 1995

An algorithm for finding the k-best allocations of a tree-structured program

Résumé

We consider the problem of allocating n tasks of a distributed program to m processors of a distributed system in order to minimize total communication and processing costs. If the intertask communication can be represented by a tree and if the communication costs are uniform, it is known that an optimal allocation can be determined in O (nm) time. A K-optimal solution set = {1,..., K} of a given task allocation problem is a set of allocations such that no allocation which is not contained in is better than any i, i = 1,..., K. In this paper, an algorithm is presented which computes a K-optimal set for the considered task allocation problem in O (Knm). Copyright 1995, 1999 Academic Press, Inc.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01124500 , version 1

Citer

Alain Billionnet, Sourour Elloumi. An algorithm for finding the k-best allocations of a tree-structured program. Journal of Parallel and Distributed Computing, 1995, 26, pp.225-232. ⟨hal-01124500⟩

Collections

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

Partager

Gmail Facebook X LinkedIn More