Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01124500
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 10:37:13 AM
Last modification on : Friday, January 24, 2020 - 11:00:15 AM

Identifiers

  • HAL Id : hal-01124500, version 1

Collections

Citation

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

Share

Metrics

Record views

86