
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
CheolHoon Lee, Dongmyun Lee, Myunghwan Kim, "Optimal Task Assignment in Linear Array Networks," IEEE Transactions on Computers, vol. 41, no. 7, pp. 877880, July, 1992.  
BibTex  x  
@article{ 10.1109/12.256461, author = {CheolHoon Lee and Dongmyun Lee and Myunghwan Kim}, title = {Optimal Task Assignment in Linear Array Networks}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {7}, issn = {00189340}, year = {1992}, pages = {877880}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.256461}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Optimal Task Assignment in Linear Array Networks IS  7 SN  00189340 SP877 EP880 EPD  877880 A1  CheolHoon Lee, A1  Dongmyun Lee, A1  Myunghwan Kim, PY  1992 KW  optimal task assignment; linear array networks; distributed computing system; communication costs; NPcomplete; network flow approach; task assignment; twoterminal network flow problem; computational complexity; computer networks; distributed processing. VL  41 JA  IEEE Transactions on Computers ER   
The problem of assigning tasks to the processors of a distributed computing system such that the sum of execution and communication costs is minimized is discussed. This problem is known to be NPcomplete in the general case, and thus intractable for systems with a large number of processors. H.S. Stone's (1977) network flow approach for a twoprocessor system is extended to the case for a linear array of any number of processors. The task assignment problem for a linear array network is first transformed into the twoterminal network flow problem, and then solved by applying the GoldbergTarjan (1987) network flow algorithm in time no worse than O(n/sup 2/m/sup 3/ log n), where n and m are the number of processors and the number of tasks, respectively.
[1] R. K. Arora and S. P. Rana, "Heuristic methods for process assignment in distributed computing systems,"Inform. Processing Lett., vol. 11, pp. 199203, Dec. 1980.
[2] S. H. Bokhari, "Dual processor scheduling with dynamic reassignment,"IEEE Trans. Software Eng., vol. SE5, pp. 341349, July 1979.
[3] S. H. Bokhari, "A shortest tree algorithm for optimal assignments across space and time in a distributed processor systems,"IEEE Trans. Software Eng., vol. SE7, pp. 583589, Nov. 1981.
[4] S. H. Bokhari,Assignment Problems in Parallel and Distributed Computing. Boston, MA: Kluwer Academic, 1987.
[5] S. H. Bokhari, "Partitioning problems in parallel, pipelined and distributed computing,"IEEE Trans. Comput., vol. C37, pp. 4857, Jan. 1988.
[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. 248264, Apr. 1972.
[7] L. R. Ford, Jr. and D. R. Fulkerson,Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
[8] A. Goldberg and R. Tarjan, "A new approach to the maximum flow problem," inProc. 18th ACM Symp. Theory Comput., 1986, pp. 136146.
[9] V. M. Lo, "Heuristic algorithms for task assignment in distributed systems,"IEEE Trans. Comput., vol. C37, pp. 13841397, Nov. 1988.
[10] D. M. Nicol, "Parallel algorithms for mapping pipelined and parallel computations," ICASE Rep. 882, NASA Contractor Rep. 181655, Apr. 1988.
[11] H. S. Stone, "Multiprocessor scheduling with the aid of network flow algorithms,"IEEE Trans. Software Eng., vol. SE3, pp. 8593, Jan. 1977.
[12] H. S. Stone, "Critical load factors in distributed computer systems,"IEEE Trans. Software Eng., vol. SE4, pp. 254258, May 1978.
[13] H. S. Stone and S. H. Bokhari, "Control of distributed processes,"IEEE Comput. Mag., vol. 11, pp. 97106, July 1978.
[14] D. Towsley, "Allocating programs containing branches and loops within a multiple processor system,"IEEE Trans. Software Eng., vol. SE12, pp. 10181024, Oct. 1986.