|
 
|
[BE95] An algorithm for finding the k-best allocations of a tree-structured program
Revue Internationale avec comité de lecture : Journal journal of parallel and distributed computing, vol. 26(2), pp. 225-232, 1995
motcle:
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.
BibTeX
| @article { | |||
| BE95, | |||
| title | = | "{An algorithm for finding the k-best allocations of a tree-structured program}", | |
| author | = | "A. Billionnet and S. Elloumi", | |
| journal | = | "journal of parallel and distributed computing", | |
| year | = | 1995, | |
| volume | = | 26, | |
| number | = | 2, | |
| pages | = | "225-232", | |
| } | |||
