
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Noriyuki Fujimoto, Kenichi Hagihara, "On Approximation of the Bulk Synchronous Task Scheduling Problem," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 11, pp. 11911199, November, 2003.  
BibTex  x  
@article{ 10.1109/TPDS.2003.1247678, author = {Noriyuki Fujimoto and Kenichi Hagihara}, title = {On Approximation of the Bulk Synchronous Task Scheduling Problem}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {14}, number = {11}, issn = {10459219}, year = {2003}, pages = {11911199}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2003.1247678}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  On Approximation of the Bulk Synchronous Task Scheduling Problem IS  11 SN  10459219 SP1191 EP1199 EPD  11911199 A1  Noriyuki Fujimoto, A1  Kenichi Hagihara, PY  2003 KW  Task scheduling KW  distributed memory KW  fine grain KW  software overhead KW  message packaging KW  bulk synchronous schedule KW  NPcomplete KW  approximation KW  nonapproximability. VL  14 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The bulk synchronous task scheduling problem (BSSPO) is known as an effective task scheduling problem for distributedmemory machines. This paper presents a proof of NPcompleteness of the decision counterpart of BSSPO, even in the case of makespan of at most five. This implies nonapproximability of BSSPO, meaning that there is no approximation algorithm with performance guarantee smaller than
[1] I. Ahmad and Y. Kwok, On Exploiting Task Duplication in Parallel Program Scheduling IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 9, pp. 872892, Sept. 1998.
[2] H.H. Ali and H. ElRewini, The Time Complexity of Scheduling Interval Orders with Communication Is Polynomial Parallel Processing Letters, vol. 3, no. 1, pp. 5358, 1994.
[3] P. Chrétienne, A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System under TreeLike Precedence Constraints European J. Operations Research, vol. 43, pp. 225230, 1989.
[4] J.Y. Colin and P. Chrétienne, C.P.M. Scheduling with Small Communication Delays and Task Duplication Operations Research, vol. 39, no. 4, pp. 680684, 1991.
[5] S. Darbha and D.P. Agrawal, Optimal Scheduling Algorithm for DistributedMemory Machines IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 1, pp. 8795, Jan. 1998.
[6] H. ElRewini, T.G. Lewis, and H.H. Ali, Task Scheduling in Parallel and Distributed Systems. Prentice Hall, 1994.
[7] N. Fujimoto, T. Baba, T. Hashimoto, and K. Hagihara, A Task Scheduling Algorithm to Package Messages on Distributed Memory Parallel Machines Proc. Int'l Symp. Parallel Architectures, Algorithms, and Networks, pp. 236241, 1999.
[8] N. Fujimoto, T. Hashimoto, M. Mori, and K. Hagihara, On the Performance Gap between a Task Schedule and Its Corresponding Parallel Program Parallel and Distributed Computing for Symbolic and Irregular Applications, T. Ito and T. Yuasa, eds., pp. 271287, World Scientific, 2000.
[9] N. Fujimoto, T. Baba, T. Hashimoto, and K. Hagihara, On Message Packaging in Task Scheduling for Distributed Memory Parallel Machines Int'l J. Foundations of Computer Science, vol. 12, no. 3, pp. 285306, 2001.
[10] N. Fujimoto and K. Hagihara, Optimal Task Scheduling of a Complete Kary Tree with Communication Delays Lecture Notes in Computer Science, vol. 2328, pp. 7178, 2001.
[11] N. Fujimoto and K. Hagihara, NearOptimal Task Scheduling of a Complete Kary Tree with Communication Delays Recent Advances in Computers, Computing, and Comm., N. Mastorakis and V. Mladenov, eds., pp. 16, WSEAS Press, 2002.
[12] Y. Fukazawa, S. Kurino, and Y. Nonomura, A Parallel Reduction Algorithm with Communication Delay The Massively Parallel Processing System JUMP1, H. Tanaka, Y. Muraoka, M. Amamiya, N. Saito, and S. Tomita, eds., pp. 5060, Ohmsha Press, 1996.
[13] 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.
[14] A. Goldman and G. Mounié, and D. Trystram, 1Optimality of Static BSP Computations: Scheduling Independent Chains as a Case Study Theoretical Computer Science, vol. 290, no. 3, pp. 13311359, 2003.
[15] A. Jakoby and R. Reischuk, The Complexity of Scheduling Problems with Communication Delays for Trees Lecture Notes in Computer Science, vol. 621, pp. 165177, 1992.
[16] H. Jung, L. Kirousis, and P. Spirakis, Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays Information and Computation J., vol. 105, no. 1, pp. 94104, 1993.
[17] B. Kruatrachue, Static Task Scheduling and Packing in Parallel Processing Systems PhD thesis, Dept. of Electrical and Computer Eng., Oregon State Univ., 1987.
[18] W. Kubiak, B. Penz, and D. Trystram, Scheduling Chains on Uniform Processors with Communication Delays J. Scheduling, vol. 5, no. 6, pp. 459476, 2002.
[19] J.K. Lenstra and D.B. Shmoys, Computing NearOptimal Schedules Scheduling Theory and its Applications, P. Chrétienne, E.G. Coffman, Jr., J.K. Lenstra, and Z. Liu, eds., pp. 114, John Wiley and Sons, 1995.
[20] J.K. Lenstra and A.H.G. Rinnooy Kan, Complexity of Scheduling under Precedence Constraints Operations Research, vol. 26, pp. 2235, 1978.
[21] R.H. Möhring, M.W. Schäffter, and A.S. Schulz, Scheduling Jobs with Communication Delay: Using Infeasible Solutions for Approximation Lecture Notes in Computer Science, vol. 1136, pp. 7690, 1996.
[22] M.A. Palis, J.C. Liou, and D.S.L. Wei, “Task Clustering and Scheduling for Distributed Memory Parallel Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 4655, Jan. 1996.
[23] C.H. Papadimitriou and M. Yannakakis, Towards An ArchitectureIndependent Analysis of Parallel Algorithms SIAM J. Computing, vol. 19, no. 2, pp. 322328, 1990.
[24] V.J. RaywardSmith, Net Scheduling with Unit Interprocessor Communication Delays J. Discrete Applied Mathematics, vol. 18, pp. 5571, 1987.
[25] D.B. Skillicorn, J.M.D. Hill, and W.F. McColl, Questions and Answers about BSP Scientific Programming, vol. 6, no. 3, pp. 249274, 1997.
[26] R. Thurimella and Y. Yesha, A Scheduling Principle for Precedence Graphs with Communication Delay Proc. Int'l Conf. Parallel Processing, vol. 3, pp. 229236, 1992.
[27] J.D. Ullman, NPComplete Scheduling Problems J. Computer and System Science, vol. 10, pp. 384393, 1975.
[28] L.G. Valiant, A Bridging Model for Parallel Computation Comm. ACM, vol. 33, no. 8, pp. 103111, 1990.
[29] T.A. Varvarigou, V.P. Roychowdhury, T. Kailath, and E. Lawler, Scheduling In and Out Forests in the Presence of Communication Delays IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 10, pp. 10651074, 1996.
[30] 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.