The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1992 vol.41)
pp: 257-273
ABSTRACT
<p>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.</p>
INDEX TERMS
lower bounds; assignment problem; arbitrary process systems; heterogeneous distributed computer systems; hierarchical clustering; allocation algorithm; upper bounds; branch-and-bound-type algorithms; time complexity; suboptimality tradeoff; heuristic allocation; workload patterns; distributed databases; heuristic programming; performance evaluation.
CITATION
C.N. Nikolaou, N.S. Bowen, "On the Assignment Problem of Arbitrary Process Systems to Heterogeneous Distributed Computer Systems", IEEE Transactions on Computers, vol.41, no. 3, pp. 257-273, March 1992, doi:10.1109/12.127439
11 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool