Efficient computation of optimal assignments for distributed tasks
Journal of Parallel and Distributed Computing
Parametric Combinatorial Computing and a Problem of Program Module Distribution
Journal of the ACM (JACM)
Measured performance of an Ethernet local network
Communications of the ACM
Computer Networks
Computer Communications Network Design and Analysis
Computer Communications Network Design and Analysis
A queueing network approach to the module allocation problem in distributed systems
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Parametric Module Allocation on Partial k-Trees
IEEE Transactions on Computers
| Hi-index | 14.98 |
A program whose execution is distributed among several processors in a broadcast system has a total execution cost equal to the sum of processor costs and communication costs, which are functions of the amount of data transmitted and the average transmission delays. A critical delay x is a value of average transmission delay such that no assignment is minimum-cost for average delays both smaller and larger than x. An algorithm is presented for finding the set of all q critical delays of a program that requires computing O(q) optimal assignments at fixed values of average delay. For p=2 processors, H.S. Stone's (1977) assignment graph approach can be used to find an optimal assignment, while for p