
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tsansheng Hsu, Joseph C. Lee, Dian Rae Lopez, William A. Royce, "Task Allocation on a Network of Processors," IEEE Transactions on Computers, vol. 49, no. 12, pp. 13391353, December, 2000.  
BibTex  x  
@article{ 10.1109/12.895858, author = {Tsansheng Hsu and Joseph C. Lee and Dian Rae Lopez and William A. Royce}, title = {Task Allocation on a Network of Processors}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {12}, issn = {00189340}, year = {2000}, pages = {13391353}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.895858}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Task Allocation on a Network of Processors IS  12 SN  00189340 SP1339 EP1353 EPD  13391353 A1  Tsansheng Hsu, A1  Joseph C. Lee, A1  Dian Rae Lopez, A1  William A. Royce, PY  2000 KW  Scheduling KW  parallel/distributed systems KW  approximation algorithms. VL  49 JA  IEEE Transactions on Computers ER   
Abstract—This paper studies the scheduling of tasks on a pool of identical workstations in a network where message passing is used for data transfer and communication between processors and where the precedence relations among tasks form a sendreceive graph. Our parallel computation model differs from previous models by including all of the following practical considerations: 1) The sending and receiving of multiple messages from one processor to another is performed sequentially, 2) communication overhead is proportional to the message size, and 3) the starting and ending task must be performed on the same machine. These factors are crucial when performing parallel task execution using a pool of workstations whose communication primitives are provided by offtheshelf packages, such as PVM, and whose message sizes are nontrivial. Although our model is new, using reduction from other wellknown scheduling results shows that finding a scheduling with the optimal makespan is NPhard. Our focus, therefore, is on developing and analyzing approximation algorithms for this problem. When the number of workstations in the network is abundant, a linear approximation algorithm is given with a proven performance bound of two times the optimal. When the number of available workstations is a fixed constant
[1] F.D. Anger, J.J. Hwang, and Y.C. Chow, “Scheduling with Sufficient Loosely Coupled Processors,” J. Parallel and Distributed Computing, vol. 9, pp. 8792, 1990.
[2] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[3] I. Ahmad and Y.K. Kwok, “On Paralleling the Multiprocessor Scheduling Problem,” IEEE Trans. Parallel and Distributed Systems, vol. 10, pp. 414432, 1999.
[4] J.Y. Colin and P. Chrétienne, “C.P.M. Scheduling with Small Communication Delays and Task Duplication,” Operations Research, vol. 39, no. 3, pp. 680684, 1991.
[5] Scheduling Theory and Its Applications, P. Chrétienne, E.G. Coffman Jr., J.K. Lenstra, and Z. Liu, eds. John Wiley&Sons, 1995.
[6] P. Chrétienne, “A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System under TreeLike Precedence Constraints,” European J. Operational Research, vol. 43, pp. 225230, 1989.
[7] P. Chrétienne, “Task Scheduling over Distributed Memory Machines” Proc. Int'l Workshop Parallel and Distributed Algorithms, pp. 165176, 1989.
[8] P. Chrétienne, “Task Scheduling with Interprocessor Communication Delays,” European J. Operational Research, vol. 57, pp. 348354, 1992.
[9] D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, “LogP—A Practice Model of Parallel Computation,” Comm. ACM, vol. 39, no. 11, pp. 7885, 1996.
[10] Y. Cohen, M.S. Landy, and M. Pavel, “Hierarchical Coding of Binary Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 3, pp. 284298, 1985.
[11] T.C.E. Cheng and C.C.S. Sin, “A StateoftheArt Review of ParallelMachine Scheduling Research,” European J. Operational Research, vol. 47, pp. 271292, 1990.
[12] O. ElDissouki and W. Huen, “Distributed Enumeration on Network Computers,” IEEE Trans. Computers, vol. 29, no. 9, pp. 818825, 1980.
[13] A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM 3 User's Guide and Reference Manual. Oak Ridge, Tenn.: Oak Ridge Nat'l Laboratory, May 1993.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[15] P.B. Gibbons, Y. Matias, and V. Ramachandran, “The QRQW PRAM: Accounting for Contention in Parallel Algorithms,” SIAM J. Computing, vol. 28, no. 2, pp. 733769, 1998.
[16] A. Gerasoulis and T. Yang, “A Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs on Multiprocessors,” J. Parallel and Distributed Computing, vol. 16, pp. 276291, 1992.
[17] A. Gerasoulis and T. Yang,"On the granularity and clustering of directed acyclic task graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 686701, June 1993.
[18] J.J. Hwang,Y.C. Chow,F.D. Anger, and C.Y. Lee,"Scheduling precedence graphs in systems with interprocessor communication times," SIAM J. Computing, vol. 18, no. 2, pp. 244257, Apr. 1989.
[19] L. Hollermann, T.s. Hsu, D.R. Lopez, and K. Vertanen, “Scheduling Problems in a Practical Allocation Model,” J. Combinatorial Optimization, vol. 1, no. 2, pp. 129149, 1997.
[20] V.M. Lo, “Task Assignment in Distributed Systems,” PhD thesis, Univ. of Illinois at UrbanaChampaign, Oct. 1983.
[21] V.M. Lo, "Heuristic Algorithms for Task Assignment in Distributed Systems," IEEE Trans. Computers, vol. 37, no. 11, pp. 1,3841,397, Nov. 1988.
[22] D.R. Lopez, “Models and Algorithms for Task Allocation in a Parallel Environment,” PhD thesis, Texas A&M Univ., Dec. 1992.
[23] H.S. Malvar, “Lapped Transforms for Efficient Transformation/Subband Coding,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 38, no. 6, pp. 969978, 1990.
[24] D.R. McGregor, R.J. Fryer, P. Cockschott, and P. Murray, “Faster Fractal Compression,” Dr. Dobb's J., vol. 21, no. 1, pp. 3438, 1996.
[25] P.R. Ma, E.Y. Lee, and M. Tsuchiya, “A Task Allocation Model for Distributed Computing Systems,” IEEE Trans. Computers, vol. 31, no. 1, pp. 4147, Jan. 1982.
[26] M.G. Norman and P. Thanisch, “Models of Machines and Computation for Mapping in Multicomputers,” ACM Computing Surveys, vol. 25, no. 3, pp. 263302, 1993.
[27] C.H. Papadimitriou and M. Yannakakis,"Towards an architectureindependent analysis of parallel algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322328, Apr. 1990.
[28] S.A. Rees and J.P. Black, “An Experimental Investigation of Distributed Matrix Multiplication Techniques,” Software—Practice and Experience, vol. 21, no. 10, pp. 1,0411,063, 1991.
[29] D. Saupe and M. Ruhl, “Evolutionary Fractal Image Compression,” Proc. IEEE Int'l Conf. Image Processing, pp. 14, 1996.
[30] H.S. Stone, “Multiprocessor Scheduling with the Aid of Network Flow Algorithms,” IEEE Trans. Software Eng., vol. 3, no. 1, pp. 8593, 1977.
[31] P. Strobach, “TreeStructured Scene Adaptive Coder,” IEEE Trans. Comm., vol. 38, no. 4, pp. 477486, 1990.
[32] L.G. Valiant, “A Bridging Model for Parallel Computation,” Comm. ACM, vol. 33, no. 8, pp. 103111, Aug. 1990.
[33] L.G. Valiant, “General Purpose Parallel Architectures,” Handbook of Theoretical Computer Science, J. van Leeuwen, ed., pp. 944971, NorthHolland, 1990.
[34] T. Yang and A. Gerasoulis, “PYRROS: Static Scheduling and Code Generation for Message Passing Multiprocessors,” Proc. Sixth ACM Int'l Conf. Supercomputing, pp. 428437, 1992.
[35] T. Yang and A. Gerasoulis, “DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors,” IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 951967, 1994.