
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
P. Hansen, K.W. Lih, "Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing," IEEE Transactions on Computers, vol. 41, no. 6, pp. 769771, June, 1992.  
BibTex  x  
@article{ 10.1109/12.144628, author = {P. Hansen and K.W. Lih}, title = {Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {6}, issn = {00189340}, year = {1992}, pages = {769771}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.144628}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing IS  6 SN  00189340 SP769 EP771 EPD  769771 A1  P. Hansen, A1  K.W. Lih, PY  1992 KW  partitioning problems; parallel; pipelined; distributed computing; parallel program; bottleneck value; time complexity; computational complexity; parallel programming. VL  41 JA  IEEE Transactions on Computers ER   
S.H. Bokhari has studied the assignment of the modules of a parallel program to the processors of a multiplecomputer system. He proposed algorithms to solve optimally the following problems: (1) partition chainstructured parallel or pipelined programs over chainconnected systems; (2) partition multiple chainstructured parallel or pipelined programs over singlehost multiple satellite systems; (3) partition multiple arbitrarily structured serial programs over singlehost multiplesatellite systems; (4) partition singletree structured parallel or pipelined programs over singlehost multiple identical satellite systems. The authors solve here problem 1 by dynamic programming and problem 2 by sorting and using bisection search for the bottleneck value. They also note that Bokhari's algorithms for problems 3 and 4 can be improved by using recent results of G. Gallo et al. (1989), and by implementing E.W. Dijkstra's (1959) algorithm, which is used as a subroutine, with a heap structure. The time complexity of all algorithms is thus reduced.
[1] S. H. Bokhari,Assignment Problems in Parallel and Distributed Computing. Boston, MA: Kluwer Academic, 1987.
[2] S. H. Bokhari, "Partitioning problems in parallel, pipelined, and distributed computing,"IEEE Trans. Comput., vol. C37, pp. 4857, Jan. 1988.
[3] E. W. Dijkstra, "A note on two problems in connexion with graphs,"Numerische Mathematik, vol. 1, pp. 269271, 1959.
[4] M. J. Eisner and D. G. Severance, "Mathematical techniques for efficient record segmentation in large shared databases,"J. ACM, vol. 23, pp. 619635, Oct. 1976.
[5] G. Gallo, M. D. Grigoriadis, and R. E. Tarjan, "A fast parametric maximum flow algorithm,"SIAM J. Comput., vol. 18, no. 1, pp. 3055, 1989.
[6] H. S. Stone, "Critical load factors in twoprocessor distributed systems,"IEEE Trans. Software Eng., vol. SE4, pp. 254258, May 1978.