A standard task graph set for fair evaluation of multiprocessor scheduling algorithms

Journal of Scheduling

Volumn 5, Issue 5, 2002, Pages 379-394

  Tobita, Takao ^a   Kasahara, Hironori ^a  

^a WASEDA UNIVERSITY   (Japan)

Author keywords

Benchmark; Multiprocessor scheduling; Optimization; Performance evaluation; Task graph

Indexed keywords

ALGORITHMS; BENCHMARKING; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING;

MULTIPROCESSOR SCHEDULING; PERFORMANCE EVALUATION; SCHEDULING ALGORITHMS; TASK GRAPH;

MULTIPROCESSING PROGRAMS;

EID: 27744573276     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.116     Document Type: Article

References (35)

1. Coffman EG. Computer and Job-shop Scheduling Theory. Wiley: New York, 1976.
2. Hu TC. Parallel sequencing and assembly line problem. Operations Research 1961; 9:841-848.
3. Coffman EG, Graham RL. Optimal scheduling for two-processor systems. Acta Informatica 1972; 1(3): 200-213.
4. Ramamoorthy CV, Chandy KM, Gonzalez MJ. Optimal scheduling strategies in a multiprocessor system. IEEE Transactions on Computers 1972; C-21(2):137-146.
5. Kasahara H, Narita S. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Transactions on Computers 1984; C-33(11): 1023-1029.
6. Adam TL, Chandy KM, Dickson JR. A comparison of list schedules for parallel processing systems. Communications of the ACM 1974; 17(12):685-690.
7. Bokhari SH. A shortest tree algorithm for optimal assignments across space and time in a distributed processor system. IEEE Transactions on Software Engineering 1981; SE-7(6):583-589.
8. Chretienne P. A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. European Journal of Operational Research 1989; 43:225-230.
9. Palis MA, Liou J, Wei DSL. Task clustering and scheduling for distributed memory parallel architectures. IEEE Transactions on Parallel and Distributed Systems 1998; 7(1):46-55.
10. Varvarigou TA, Roychowdhury VP, Kailath T, Lawler E. Scheduling in and out forests in the presence of communication delays. IEEE Transactions on Parallel and Distributed Systems 1996; 7(10): 1065-1074.
11. Anger FD, Hwang J, Chow Y. Scheduling with sufficient loosely coupled processors. Journal of Parallel and Distributed Computing 1990; 9:87-92.
12. Hwang J, Chow Y, Anger FD, Lee C. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal on Computing 1989; 18(2):244-257.
13. Gerasoulis A, Venugopal S, Yang T. Clustering task graphs for message passing architectures. In Proceedings of the 4th ACM International Conference of Supercomputing 1990; 447-456.
14. Yang T, Gerasoulis A. A fast static scheduling algorithm for dags on an unbounded number of processors. In Proceedings of Supercomputing '91, 1991; 633-642.
15. Gerasoulis A, Yang T. A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors. Journal of Parallel and Distributed Computing 1992; 16:276-291.
16. Gerasoulis A, Yang T. On the granularity and clustering of directed acyclic task graphs. IEEE Transactions on Parallel and Distributed Systems 1993; 4(6):686-701.
17. Yang T, Gerasoulis A. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems 1994; 5(9):951-967.
18. El-Rewini H, Lewis TG. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing 1990; 9:138-153.
19. Yang T, Gerasoulis A. List scheduling with and without communication delays. Parallel Computing 1993; 19(12):1321-1344.
20. Kwok Y, Ahmad I. Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems 1996; 7(5):506-521.
21. Darbha S, Agrawal DP. Optimal scheduling algorithm for distributed-memory machines. IEEE Transactions on Parallel and Distributed Systems 1998; 9(1):87-95.
22. Shirazi B, Wang M, Pathak G. Analysis and evaluation of heuristic methods for static task scheduling. Journal of Parallel and Distributed Computing 1990; 10:222-232.
23. Almeida VAF, Vasconcelos IMM, Árabe JNC, Menascé DA. Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems. In Proceedings of Supercomputing '92 1992; 683-691.
24. Manimaran G, Siva Ram Murthy C. An efficient dynamic scheduling algorithm for multiprocessor real-time systems. IEEE Transactions on Parallel and Distributed Systems 1998; 9(3):312-319.
25. Kasahara H, Narita S. Parallel processing of robot-arm control computation on a multimicroprocessor system. IEEE Journal of Robotics and Automation 1985; RA-1(2):104-113.
26. Llosa J, Valero M, Ayguadé E, González A. Modulo scheduling with reduced register pressure. IEEE Transactions on Computers 1998; 47(6):625-638.
27. Hurson AR, Lee B, Shirazi B, Wang M. A program allocation scheme for data flow computers. In Proceedings of the 1990 International Conference on Parallel Processing, 1990; I 415-I 423.
28. Yoshida A, Koshizuka K, Kasahara H. Data-localization for fortran macrodataflow computation using partial static task assignment. In Proceedings of the 10th ACM International Conference on Supercomputing 1996; 61-68.
29. Kasahara H, Honda H, Narita S. Parallel processing of near fine grain tasks using static scheduling on oscar. In Proceedings of the IEEE ACM Supercomputing '90, November 1990.
30. Kasahra H, Honda H, Mogi A, Ogura A, Fujiwara K, Narita S. A multi-grain parallelizing compilation scheme for oscar (optimally scheduled advanced multiprocessor). In Proceedings of the 4th Workshop on Languages and Compilers for Parallel Computing, August 1991.
31. Kasahara H. Parallel processing of robot arm dynamic control computation on multimicroprocessors. Microprocessors and Microsystems 1990; 14(1):3-9.
32. Fernández EB, Bussell B. Bounds on the number of processors and time for multiprocessor optimal schedules. IEEE Transactions on Computers 1973; C-22(8):745-751.
33. Kasahara H, Wada H, Kai M, Narita S. An application of df/ihs to minimum total weighted flow time multiprocessor scheduling problem. Transactions of the Institute of Electronics, Information and Communication Engineers, Japan 1987; J70-D(6):1083-1091.
34. Kasahara H, Fujii T, Nakayama H, Narita S, Chua LO. A parallel processing scheme for the solution of sparse linear equations using static optimal-multiprocessor-scheduling algorithms. In Proceedings of the 2nd International Conference on Supercomputing, May 1987.
35. Kasahara H, Narita S. An approach to supercomputing using multiprocessor scheduling algorithms. In Proceedings of the IEEE 1st International Conference on Supercomputing, December 1985; 139-148.