A fast branch-and-bound scheme for the multiprocessor scheduling problem with communication time

Proceedings of the International Conference on Parallel Processing Workshops

Volumn 2003-January, Issue , 2003, Pages 104-111

  Fujita, S ^a   Masukawa, M ^a   Tagashira, S ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Delay; High performance computing; NP hard problem; Partitioning algorithms; Processor scheduling; Program processors; Random number generation; Scheduling algorithm; Signal processing algorithms; Upper bound

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MULTIPROCESSING SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; RANDOM NUMBER GENERATION; SCHEDULING; SCHEDULING ALGORITHMS; SIGNAL PROCESSING;

DELAY; HIGH PERFORMANCE COMPUTING; PARTITIONING ALGORITHMS; PROCESSOR SCHEDULING; SIGNAL PROCESSING ALGORITHMS; UPPER BOUND;

HEURISTIC METHODS;

EID: 22144448819     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2003.1240360     Document Type: Conference Paper

References (19)

1. I. Ahmad and Y.-K. Kwok. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Trans. on Parallel and Distributed Systems, 7(5):506-521, May 1998.
2. P. Brucker. "Scheduling algorithms (third edition)," Springer, 1997.
3. K. M. Chandy C. V. Ramamoorthy and M. J. Gonzalez Jr. Optimal scheduling strategies in a multiprocessor systems. IEEE Trans. Comput., C-21(2):137-146, 1972.
4. Y. E. Chen, D. L. Epley, "Bounds on memory requirements on multiprocessor systems," Proc. 6th Annu. Allerton Conf. Circuit and Syst. Theory, pages 523-531, 1968.
5. P. Chretienne, et al. (Eds.). Scheduling theory and its applications, John Wiley & Sons, 1997.
6. E. Coffman Jr. and R. Graham. "Optimal scheduling for two processor systems," Acta Informatica, 1(3):200-213, 1972.
7. E. B. Fernandez and B. Bussell. "Bounds on the number of processors and time for multiprocessor optimal schedules," IEEE Trans. Comput., C-22(8):745-751, Aug. 1973.
8. S. Fujita, T. Nakagawa. "Lower Bounding Techniques for the Multiprocessor Scheduling Problem with Communication Delay," Proc. PACT, pages 212-220, 1999.
9. S. Fujita and M. Yamashita. "Approximation algorithms for multiprocessor scheduling problem," IEICE Trans. Inf. & Syst., E83-D(3):503-509, Mar. 2000.
10. S. Fujita, M. Masukawa, S. Tagashira. "A Fast Branch-and-Bound Algorithm with an Improved Lower Bound for Solving the Multiprocessor Scheduling Problem," Proc. ICPADS 2002, pages 611-616, 2000.
11. T. C. Hu. "Parallel sequencing and assembly line problems," Oper. Res., 9:841-848, Nov. 1961.
12. K. K. Jain, V. Rajaraman. "Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules," IEEE Trans. Parallel and Distributed Systems, 5(8): 879-886 (1994).
13. J. Jonsson and K. G. Shin. A parameterized branch-and-bound strategy for scheduling precedence-constrained tasks on a multiprocessor system. In Proc. of the Int'l Conf. on Parallel Processing, pages 158-165, August 11-15 1997.
14. H. Kasahara and S. Narita. "Practical multiprocessor scheduling algorithms for efficient parallel processing," IEEE Trans. Comput., C-33(11):1023-1029, Nov. 1985.
15. C. V. Ramamoorthy, K. M. Chandy, and M.J. Gonzalez Jr. Optimal scheduling strategies in a multiprocessor system. IEEE Trans. Comput., C-21(2):137-146, February 1972.
16. http://www.kasahara.elec.waseda.ac.jp/schedule/index.html
17. T. Yang and A. Gerasoulis. On the granularity and clustering of directed acyclic task graphs. IEEE Trans. Parallel and Distributed Systems, 4(6):686-701, June 1993.
18. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. Parallel and Distributed Systems, 5(9):951-967, September 1994.
19. J. D. Ullman. "NP-complete scheduling problems," Journal of Computer and System Sciences, 10(3):384-393, June 1975.