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 Ω = { A 1,..., A K } of a given task allocation problem is a set of allocations such that no allocation A which is not contained in Ω is better than any A 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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
