A comparison of multiprocessor scheduling heuristics

Proceedings of the International Conference on Parallel Processing

Volumn 2, Issue , 1994, Pages

  Khan, A A ^a   McCreary, C L ^a   Jones, M S ^a  

^a AUBURN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MULTIPROCESSING SYSTEMS; SCHEDULING ALGORITHMS; TURNAROUND TIME;

CLASSIFICATION CRITERION; CRITICAL PATH METHOD; EMPIRICAL PERFORMANCE; GRAPH-BASED METHODS; LIST SCHEDULING HEURISTICS; MULTI PROCESSOR SCHEDULING; PERFORMANCE GUARANTEES; RANDOMLY GENERATED DAGS;

SCHEDULING;

EID: 84904337623     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1994.19     Document Type: Conference Paper

References (21)

1. Sarkar V. Partitioning and scheduling parallel programs for execution on multiprocessors. PhD thesis, Stanford University, 1989.
2. Kruatrachue B. and Lewis T. Grain Size Determination for Parallel Processing. IEEE Software, pages 23-32, Jan 1988. (Pubitemid 18596651)
3. Kim S. and Browne J. A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures. In Proceedings of 1988 IEEE International Conf. on Parallel Processing, pages 1-8. IEEE, 1988.
4. Yu W. LU Decomposition on a Multiprocessing System with Communication Delay. PhD thesis, University of California, Berkley, 1984.
5. E. Coffman. Computer and Job-Shop Scheduling Theory. John Wiley and Sons, 1976.
6. Papadimitrou C. and Ullman J. A Communication Time Tradeoff. SIAM J. of Computing, 16(4):639-646, August 1976.
7. Gerasoulis A. and Yang T. A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors. In The Proceedings of the ACM 1990 International Supercomputing Conf. ACM, 1990.
8. Gerasoulis A., Vengopal S., and Yang T. Clustering Task Graphs for Message Passing Architectures. In Proceedings of ACM International Conf. on Supercomputing, pages 447-456, 1990.
9. Wu M. and Gadjski D. Hypertool: A Programming Aid for Message Passing Systems. IEEE Trans. Parallel and Distributed Systems, 1(3):101-119, July 1990.
10. Hu T. Parallel Sequencing and Assembly Line Problems. Operations Research, 9:841-848, 1961.
11. H. Anger, Hwang J., and Y. C. Chow. Scheduling with Sufficient Loosely Coupled Processors. J. of Parallel and Distributed Comp., 9:87-92, 1990. (Pubitemid 20717230)
12. Hwang J., Chow Y., Anger F., and Lee B. Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM J. of Computing, 18(2):l-8, April 1989.
13. Lee C, Hwang J. Chow Y., and Anger F. Multiprocessor Scheduling with Interprocessor Communication Delays. Operations Research Letters, 7(3):141-147, 1988. (Pubitemid 18651168)
14. Liu Z. A Note on Graham's Bound. Information Processing Letters, 36:1-5, October 1990.
15. El-Rewini H. and Lewis T. Scheduling Parallel Program Tasks onto Arbitrary Target Machines. IEEE J. of Parallel and Distributed Comp., 9:138-153, 1990. (Pubitemid 20729738)
16. McCreary C. and Gill H. Automatic Determination of Grain Size for Efficient Parallel Processing. Comm. of the ACM, 32(9):1073-1078, Sept. 1989. (Pubitemid 20600841)
17. McCreary C, Thompson J., Gill H., Smith T., and Zhu Y. Partitioning and Scheduling Using Graph Decomposition. Depart, of Comp. Science and Engin. CSE-93-06, Auburn University, 1993.
18. Yang T. and Gerasoulis A. A Fast Scheduling Algorithm for DAGs on an Unbounded Number of Processors. In Proce. of the 5th ACM Intl Conf. on Supercomp., pages 633-642. ACM, 1991.
19. Lewis T. and El-Rewini H. Parallax: A Tool for Parallel Program Scheduling. In IEEE Parallel and Distributed Tech., pages 62-71. May 1993.
20. Khan A., McCreary C and Jones M. A Comparison of Multiprocessor Scheduling Heuristics. Depart, of Computer Science and Engineering CSE-94-02, Auburn University, 1994.
21. McCreary C. L., Khan A. A., Thompson J. J., McArdle M. E. A Comparison of Heuristics for Scheduling DAGS on Multiprocessors. In 8th International Parallel Processing Symposium. IEEE, 1994.