Issue No. 02 - February (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.342129
<p><it>Abstract—</it>We address the problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. </p><p>We describe polynomial exact and approximate algorithms for this class that are better than any of the previously reported algorithms. Our approach is based on a preprocessing step that condenses the given chain or tree structured task into a <it>monotonic</it> chain or tree. The partitioning of this monotonic task can then be carried out using fast search techniques.</p><p><it>Index Terms—</it>Approximation algorithms, assignments, chains, distributed computing, host-satellite systems, load balancing, partitioning, parallel processing, trees.</p>
S. H. Bokhari and M. A. Iqbal, "Efficient Algorithms for a Class of Partitioning Problems," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 170-175, 1995.