This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Algorithms for a Class of Partitioning Problems
February 1995 (vol. 6 no. 2)
pp. 170-175

Abstract—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.

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 monotonic chain or tree. The partitioning of this monotonic task can then be carried out using fast search techniques.

Index Terms—Approximation algorithms, assignments, chains, distributed computing, host-satellite systems, load balancing, partitioning, parallel processing, trees.

[1] S.H. Bokhari, Assignment Problems in Parallel and Distributed Computing.Boston: Kluwer Academic, 1987.
[2] ——,“Partitioning problems in parallel, pipelined and distributed computing,”IEEE Trans. Comput., vol. 37, pp. 48–57, Jan. 1988.
[3] ——,“On the mapping problem,”IEEE Trans. Comput., vol. C-30, pp. 207–214, Mar. 1981.
[4] S. Borkar,R. Cohn,G. Cox,S. Gleason,T. Gross,H.T. Kung,M. Lam,B. Moore,C. Peterson,J. Pieper,L. Rankin,P.S. Tseng,J. Sutton,J. Urbanski,, and J. Webb,“iWarp: An integrated solution to high-speed parallel computing,” Proc. Supercomputing’88, Nov. 1988.
[5] G. Bolchet al.,“A multiprocessor system for simulating data transmission systems (MUPSI),”Microprocessing and Microprogramming, vol. 12, no. 5, pp. 267–277, Dec. 1983.
[6] Y. Han, B. Narahari, and H-A. Choi,“Mapping a chain task to chained processors,”Inform. Processing Lett., pp. 141–148, Nov. 1992.
[7] M. Ashraf Iqbal,“Approximate algorithms for partitioning problems,”Int. J. Parallel Programming, vol. 20, no. 5, Oct. 1991.
[8] M. Ashraf Iqbal, J. H. Saltz, and S. H. Bokhari,“A comparative analysis of static and dynamic load balancing strategies,”inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 1040–1047.
[9] D. M. Nicol,“Rectilinear partitioning of irregular data parallel computations,”Tech. Rep. 91-55, ICASE, July 1991; also NASA Contractor Rep. 187601, to appear inJ. Parallel and Distrib. Comput.
[10] D. M. Nicol and D. R. O'Hallaron,“Improved algorithms for mapping parallel and pipelined computations,”IEEE Trans. Comput., vol. 40, pp. 295–306, Mar. 1991.

Citation:
M. Ashraf Iqbal, Shahid H. Bokhari, "Efficient Algorithms for a Class of Partitioning Problems," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, pp. 170-175, Feb. 1995, doi:10.1109/71.342129
Usage of this product signifies your acceptance of the Terms of Use.