This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Approximation of the Bulk Synchronous Task Scheduling Problem
November 2003 (vol. 14 no. 11)
pp. 1191-1199
Noriyuki Fujimoto, IEEE Computer Society

Abstract—The bulk synchronous task scheduling problem (BSSPO) is known as an effective task scheduling problem for distributed-memory machines. This paper presents a proof of NP-completeness 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 \frac{6}{5} unless P=NP. This paper also gives an approximation algorithm with a performance guarantee of two for BSSPO in several restricted cases.

[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. 872-892, Sept. 1998.
[2] H.H. Ali and H. El-Rewini, The Time Complexity of Scheduling Interval Orders with Communication Is Polynomial Parallel Processing Letters, vol. 3, no. 1, pp. 53-58, 1994.
[3] P. Chrétienne, A Polynomial Algorithm to Optimally Schedule Tasks on a Virtual Distributed System under Tree-Like Precedence Constraints European J. Operations Research, vol. 43, pp. 225-230, 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. 680-684, 1991.
[5] S. Darbha and D.P. Agrawal, Optimal Scheduling Algorithm for Distributed-Memory Machines IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 1, pp. 87-95, Jan. 1998.
[6] H. El-Rewini, 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. 236-241, 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. 271-287, 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. 285-306, 2001.
[10] N. Fujimoto and K. Hagihara, Optimal Task Scheduling of a Complete K-ary Tree with Communication Delays Lecture Notes in Computer Science, vol. 2328, pp. 71-78, 2001.
[11] N. Fujimoto and K. Hagihara, Near-Optimal Task Scheduling of a Complete K-ary Tree with Communication Delays Recent Advances in Computers, Computing, and Comm., N. Mastorakis and V. Mladenov, eds., pp. 1-6, WSEAS Press, 2002.
[12] Y. Fukazawa, S. Kurino, and Y. Nonomura, A Parallel Reduction Algorithm with Communication Delay The Massively Parallel Processing System JUMP-1, H. Tanaka, Y. Muraoka, M. Amamiya, N. Saito, and S. Tomita, eds., pp. 50-60, 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. 686-701, June 1993.
[14] A. Goldman and G. Mounié, and D. Trystram, 1-Optimality of Static BSP Computations: Scheduling Independent Chains as a Case Study Theoretical Computer Science, vol. 290, no. 3, pp. 1331-1359, 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. 165-177, 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. 94-104, 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. 459-476, 2002.
[19] J.K. Lenstra and D.B. Shmoys, Computing Near-Optimal Schedules Scheduling Theory and its Applications, P. Chrétienne, E.G. Coffman, Jr., J.K. Lenstra, and Z. Liu, eds., pp. 1-14, 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. 22-35, 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. 76-90, 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. 46-55, Jan. 1996.
[23] C.H. Papadimitriou and M. Yannakakis, Towards An Architecture-Independent Analysis of Parallel Algorithms SIAM J. Computing, vol. 19, no. 2, pp. 322-328, 1990.
[24] V.J. Rayward-Smith, Net Scheduling with Unit Interprocessor Communication Delays J. Discrete Applied Mathematics, vol. 18, pp. 55-71, 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. 249-274, 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. 229-236, 1992.
[27] J.D. Ullman, NP-Complete Scheduling Problems J. Computer and System Science, vol. 10, pp. 384-393, 1975.
[28] L.G. Valiant, A Bridging Model for Parallel Computation Comm. ACM, vol. 33, no. 8, pp. 103-111, 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. 1065-1074, 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. 951-967, 1994.

Index Terms:
Task scheduling, distributed memory, fine grain, software overhead, message packaging, bulk synchronous schedule, NP-complete, approximation, nonapproximability.
Citation:
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. 1191-1199, Nov. 2003, doi:10.1109/TPDS.2003.1247678
Usage of this product signifies your acceptance of the Terms of Use.