On the assignment problem of arbitrary process systems toheterogeneous distributed computer systems
Bowen, N.S.; Nikolaou, C.N.; Ghafoor, A.
Computers, IEEE Transactions on
Volume 41, Issue 3, Mar 1992 Page(s):257 - 273
Digital Object Identifier 10.1109/12.127439
Summary:The authors propose and evaluate an efficient hierarchical
clustering and allocation algorithm that drastically reduces the
interprocess communications cost while observing lower and upper bounds
of utilization for the individual processors. They compare the algorithm
with branch-and-bound-type algorithms that can produce allocations with
minimal communication cost, and show a very encouraging time
complexity/suboptimality tradeoff in favor of the algorithm, at least
for a class of process clusters and their random combinations which it
is believed occur naturally in distributed applications. The heuristic
allocation is well suited for a changing environment, where processors
may fail or be added to the system and where the workload patterns may
change unpredictably and/or periodically
View citation and abstract |
Cart
