Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers

Volumn C-33, Issue 11, 1984, Pages 1023-1029

  Kasahara, Hironori ^a   Narita, Seinosuke ^a  

^a WASEDA UNIVERSITY   (Japan)

Author keywords

Approximation; branch and bound method; heuristic algorithm; MIMD system; multiprocessor scheduling algorithm; optimization; parallel processing; strong NP hard; task graph

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

BRANCH-AND-BOUND METHOD; MIMD SYSTEM; MULTIPROCESSOR SCHEDULING ALGORITHMS; NP-HARD;

COMPUTER SYSTEMS, DIGITAL;

EID: 0021529549     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1984.1676376     Document Type: Article

References (25)

1. T. C. Hu, “Parallel sequencing and assembly line problem,” Oper. Res., vol. 9, pp. 841–848, Nov. 1961.
2. E. G. Coffman, Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
3. E. G. Coffman and D. L. Graham, “Optimal scheduling for two-processor systems,” Acta. Informatica, vol. 1, pp. 200–213, 1972.
4. J. K. Lenstra and A. H. G. R. Kan, “Complexity of scheduling under precedence constraints,” Oper. Res., vol. 26, pp. 22–35, Jan. 1978.
5. C. V. Ramamoorthy, K. M. Chandy, and M. J. Gonzalez, “Optimal scheduling strategies in a multiprocessor system,” IEEE Trans. Comput., vol. C-21, pp. 137–146, Feb. 1972.
6. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974
7. M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
8. H. Kasahara and S. Narita, “Parallel processing for realtime control and simulation of DCCS,” in Proc. 4th IFAC Workshop on Distrib. Comput. Contr. Syst. Oxford: Pergamon, 1982, pp. 103–113.
9. K. Taniguchi, “Difficult combinatorial problems and approximation algorithms,” J. Inform. Processing Soc. Japan, vol. 21, pp. 1184–1191, Nov. 1980.
10. T. Ohtsuki, “Recent development in graph theory and its applications,” J. Inform. Processing Soc. Japan, vol. 21, pp. 786–796, July 1980.
11. “Heuristic algorithms for large-scale combinatorial problems,” J. Inst. Electron. Commun. Eng. Japan, vol. 58, pp. 417–423, Apr. 1975.
12. R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM J. Appl. Math., vol. 17, pp. 416–429, Mar. 1969.
13. T. L. Adam, K. M. Chandy, and J. R. Dickson, “A comparison of list schedules for parallel processing systems,” Commun. Ass. Comput. Mach., vol. 17, 685–690, Dec. 1974.
14. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
15. E. B. Fernandez and B. Bussel, “Bounds on the number of processors and time for multiprocessor optimal schedules,” IEEE Trans. Comput., vol. C-22, pp. 745–751, Aug. 1973.
16. E. L. Lawler and D. E. Wood, “Branch-and-bound methods: A survey,” Oper. Res., vol. 14, pp. 699–719, July 1966.
17. W. H. Kohler, “Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems,” J. Ass. Comput. Mach., vol. 21, pp. 140–156, Jan. 1974.
18. I. Nishikawa, N. Sanmiya, and T. Ibaraki, Optimization. Tokyo: Iwanami Syoten, 1982.
19. T. Ibaraki, Combinatorial Optimization. Tokyo: Sangyo Tosyo, 1979.
20. H. Kasahara and S. Narita, “Parallel processing scheme for multiprocessor continuous-time dynamical system simulator,” J. Japan Soc. Simulation Technol., vol. 2, pp. 142–151, 1983.
21. M. R. Garey and D. S. Johnson, “Strong NP-completeness results: Motivation, example and implications,” J. Ass. Comput. Mach., vol. 25, pp. 499–508, July 1978.
22. S. Sahni and E. Horowitz, “Combinatorial problems: Reducibility and approximation,” Oper. Res., vol. 26, pp. 718–759, Sept. 1978.
23. W. H. Kohler and K. Steiglitz, “Exact, approximate and guaranteed accuracy algorithms for the flow-shop problem n/2/F/F,” J. Ass. Comput. Mach., vol. 22, pp. 106–114, Jan. 1975.
24. M. R. Garey, R. L. Graham, and D. S. Johnson, “Performance guarantees for scheduling algorithms,” Oper. Res., vol. 26, pp. 3–21, Jan. 1978.
25. H. Kasahara and S. Narita, “Load distribution among real-time control computers connected via communication media,” in Proc. 9th IFAC World Cong. Oxford: Pergamon, 1984.