This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
January 1988 (vol. 37 no. 1)
pp. 48-57
The problem of optimally assigning the modules of a parallel program over the processors of a multiple-computer system is addressed. A sum-bottleneck path algorithm is developed that permits the efficient solution of many variants of this problem under some constraints on the structure of the partitions. In particular, the following problems are solved optimally for a single-host, multiple-sate

[1] S. H. Bokhari, "Dual processor scheduling with dynamic reassignment,"IEEE Trans. Software Eng., vol. SE-5, pp. 341-349, July 1979.
[2] S. H. Bokhari, "A shortest tree algorithm for optimal assignments across space and time in a distributed processor system,"IEEE Trans. Software Eng., vol. SE-7, pp. 583-589, Nov. 1981.
[3] G. Bolch, F. Hofman, B. Hoppe, H. J. Kolb, C. U. Linster, R. Polzer, W. Schussler, G. Wackersreuther, and F. X. Wurm, "A multiprocessor system for simulating data transmission systems (MUPSI),"Microprocessing Microprogram., vol. 12, pp. 267-277, 1983.
[4] E. W. Dijkstra, "A note on two problems in connexion with graphs,"Numer. Math., vol. 1, pp. 269-271, 1959.
[5] K. Doty, P. L. McEntire, and J. G. O'Reilly, "Task allocation in a distributed computer system," inProc. IEEE INFOCOM, 1982, pp. 33-38.
[6] J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems,"J. Ass. Comput. Mach., vol. 19, no. 2, pp. 248-264, Apr. 1972.
[7] M. J. Eisner and D. G. Severance, "Mathematical techniques for efficient record segmentation in large shared databases,"J. ACM, vol. 23, pp. 619-635, Oct. 1976.
[8] M. A. Iqbal, "Approximate algorithms for partitioning and assignment problems," ICASE Rep. 86-40, NASA Contractor Rep. 178130, June 1986.
[9] M. A. Iqbal, J. Saltz, and S. Bokhari, "A comparative analysis of static and dynamic load balancing strategies," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 1040-1047.
[10] E. L. Lawler,Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart, and Winston, 1976.
[11] V. M. Lo, "Heuristic algorithms for task assignments in distributed processor systems," inProc. 4th Int. Conf. Distributed Processing Syst., May 1984, pp. 30-39.
[12] H. Lu and M. J. Carey, "Load-balanced task allocation in locally distributed computer systems," inProc. 1986 Int. Conf. Parallel Processing, Aug. 1986, pp. 1037-1039.
[13] G. S. Rao, H. S. Stone, and T. C. Hu, "Assignment of tasks in a distributed system with limited memory,"IEEE Trans. Comput., vol. C-28, pp. 291-299, Apr. 1979.
[14] J. H. Saltz, "Parallel and adaptive algorithms for problems in scientific and medical computing," Ph.D. dissertation, Dep. Comput. Sci., Duke Univ., 1985.
[15] S. R. Sternberg, "Biomedical image processing,"Computer, vol. 16, pp. 22-34, Jan. 1983.
[16] H. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,"IEEE Trans. Software Eng., vol. SE-3, pp. 85-93, Jan. 1977.
[17] H. Stone, "Critical load factors in distributed computer systems,"IEEE Trans. Software Eng., vol. SE-4, pp. 254-258, May 1978.
[18] H. Stone and S. H. Bokhari, "Control of distributed processes,"Computer, vol. 11, pp. 97-106, July 1978.

Index Terms:
optimal program module assignment; computational resource allocation; scheduling; partition structure constraints; program partitioning; multiple-computer system; sum-bottleneck path algorithm; multiple chain-structures parallel programs; multiple arbitrarily structured serial programs; single-tree structured parallel programs; chain-connected systems; pipelined programs; distributed processing; programming theory; scheduling.
Citation:
S.H. Bokhari, "Partitioning Problems in Parallel, Pipeline, and Distributed Computing," IEEE Transactions on Computers, vol. 37, no. 1, pp. 48-57, Jan. 1988, doi:10.1109/12.75137
Usage of this product signifies your acceptance of the Terms of Use.