The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2011 vol.60)
pp: 1006-1016
Satoshi Fujita , Hiroshima University, Higashi-Hiroshima
ABSTRACT
In branch-and-bound (B&B) schemes for solving a minimization problem, a better lower bound could prune many meaningless branches which do not lead to an optimum solution. In this paper, we propose several techniques to refine the lower bound on the makespan in the multiprocessor scheduling problem (MSP). The key idea of our proposed method is to combine an efficient quadratic-time algorithm for calculating the Fernández's bound, which is known as the best lower bounding technique proposed in the literature with two improvements based on the notions of binary search and recursion. The proposed method was implemented as a part of a B&B algorithm for solving MSP, and was evaluated experimentally. The result of experiments indicates that the proposed method certainly improves the performance of the underlying B&B scheme. In particular, we found that it improves solutions generated by conventional heuristic schemes for more than 20 percent of randomly generated instances, and for more than 80 percent of instances, it could provide a certification of optimality of the resulting solutions, even when the execution time of the B&B scheme is limited by one minute.
INDEX TERMS
Branch-and-bound algorithm, multiprocessor scheduling problem, lower bound on the execution time.
CITATION
Satoshi Fujita, "A Branch-and-Bound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques", IEEE Transactions on Computers, vol.60, no. 7, pp. 1006-1016, July 2011, doi:10.1109/TC.2010.120
REFERENCES
[1] T.L. Adam, K.M. Chandy, and J.R. Dickson, "A Comparison of List Scheduling for Parallel Processing Systems," Comm. ACM, vol. 17, no. 12, pp. 685-690, 1974.
[2] M.A. Al-Mouhamed, "Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs," IEEE Trans. Software Eng., vol. 16, no. 12, pp. 1390-1401, Dec. 1990.
[3] M.A. Mouhamed and A.A. Maasarani, "Performance Evaluation of Scheduling Precedence-Constrained Computations on Message-Passing Systems," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 12, pp. 1317-1321, Dec. 1994.
[4] P. Brucker, Scheduling Algorithms, third ed. Springer, 1997.
[5] Y.E. Chen and D.L. Epley, "Bounds on Memory Requirements on Multiprocessor Systems," Proc. Sixth Ann. Allerton Conf. Circuit and System Theory, pp. 523-531, 1968.
[6] Scheduling Theory and Its Applications, P. Chretienne et al., eds. John Wiley & Sons, 1997.
[7] E. Coffman,Jr., and R. Graham, "Optimal Scheduling for Two Processor Systems," Acta Informatica, vol. 1, no. 3, pp. 200-213, 1972.
[8] H. El-Rewini and T.G. Lewis, "Scheduling Parallel Program Tasks onto Arbitrary Target Machines," J. Parallel and Distributed Computing, vol. 9, no. 2, pp. 138-153, 1990.
[9] E.B. Fernández and B. Bussell, "Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules," IEEE Trans. Computers, vol. 22, no. 8, pp. 745-751, Aug. 1973.
[10] S. Fujita and T. Nakagawa, "Lower Bounding Techniques for the Multiprocessor Scheduling Problem with Communication Delay," Proc. Int'l Conf. Parallel Architectures and Compilation Techniques (PACT '99), pp. 212-220, 1999.
[11] S. Fujita and M. Yamashita, "Approximation Algorithms for Multiprocessor Scheduling Problem," IEICE Trans. Information and Systems, vol. E83-D, no. 3, pp. 503-509, 2000.
[12] T.C. Hu, "Parallel Sequencing and Assembly Line Problems," Operations Research, vol. 9, no. 6, pp. 841-848, 1961.
[13] 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. 244-257, 1989.
[14] K.K. Jain and V. Rajaraman, "Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 879-886, Aug. 1994.
[15] H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing," IEEE Trans. Computers, vol. 33, no. 11, pp. 1023-1029, Nov. 1985.
[16] Y.-K. Kwok, I. Ahmad, and J. Gu, "FAST: A Low-Complexity Algorithm for Efficient Scheduling of DAGs on Parallel Processors," Proc. Int'l Conf. Parallel Processing (ICPP '96), vol. 2, pp. 150-157, 1996.
[17] Y.-K. Kwok and I. Ahmad, "Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors," ACM Computing Surveys, vol. 31, no. 4, pp. 406-471, 1999.
[18] V. Sarkar, Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, 1989.
[19] G.C. Sih and E.A. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 175-187, Feb. 1993.
[20] C.V. Ramamoorthy, K.M. Chandy, and M.J. Gonzalez,Jr., "Optimal Scheduling Strategies in a Multiprocessor System," IEEE Trans. Computers, vol. 21, no. 2, pp. 137-146, Feb. 1972.
[21] http://www.kasahara.elec.waseda.ac.jp/schedule index.html., 2010.
[22] J.D. Ullman, "NP-Complete Scheduling Problems," J. Computer and System Sciences, vol. 10, no. 3, pp. 384-393, 1975.
[23] M.-Y. Wu and D.D. Gajski, "Hypertool: A Programming Aid for Message-Passing Systems," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 3, pp. 330-343, July 1990.
[24] T. Yang and A. Gerasoulis, "DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, pp. 951-967, Sept. 1994.
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool