A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments

Proceedings of the International Conference on Parallel Processing Workshops

Volumn 2003-January, Issue , 2003, Pages 149-155

  Hagras, T ^a   Janecek J ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Clustering algorithms; Computer networks; Computer science; Costs; Digital communication; Distributed computing; High performance computing; High speed networks; Processor scheduling; Scheduling algorithm

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SCIENCE; COSTS; DIGITAL COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED PARAMETER NETWORKS; HIGH SPEED NETWORKS; PARALLEL PROCESSING SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS; TREES (MATHEMATICS);

COMPUTING ENVIRONMENTS; DIGITAL COMMUNICATIONS; HIGH PERFORMANCE COMPUTING; LIST SCHEDULING ALGORITHMS; LOW COMPLEXITY ALGORITHM; PROCESSOR SCHEDULING; STATIC APPROACH; VERY LOW COMPLEXITY;

CLUSTERING ALGORITHMS;

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

References (17)

1. D.Feitelson, L.Rudolph, U.Schwiegelshohm, K.Sevcik, and P.Wong. Theory and Practice in Parallel Job Scheduling. Lecture notes in computer science, 1291:1-34, 1997.
2. Y.Kwok and I.Ahmed. Benchmarking the Task Graph Scheduling Algorithms. Proc IPPS/SPDP, 1998.
3. J.Liou, and M.Palis. A Comparison of General Approaches to Multiprocessor Scheduling. Proc. Int'l Parallel Processing Symp., 152-156, 1997.
4. A.Khan, C. McCreary, and M. Jones. A Comparison of Multiprocessor Scheduling Heuristics. ICPP, 2:243-250, 1994.
5. A.Gerasoulis, and T.Yang. A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors. Journal of Parallel and Distributed Computing, 16:276-291, 1992.
6. M.Wu, D.Gajski. Hypertool: A Programming Aid for Message-Passing Systems. IEEE Trans. Parallel and Distributed Systems, 1:330-343, 1990.
7. J. Hwang, Y. Chow, E. Anger, and C. Lee. Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM Journal on Computing, 18:244-257, 1989.
8. G.Sih, and E.Lee. A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures. IEEE Trans. In Parallel and Distributed Systems, 4:75-87, 1993.
9. H.Zhou. Scheduling DAGs on a bounded Number of Processors. Int'l Conf., Parallel and Distributed Processing Techniques and Applications, 1996.
10. R.Lepere, and D. Trustram. A new Clustering Algorithm for Scheduling Task Graph with Large Communication Delays. IPDPS, 2001.
11. Y.Kwok, and I.Ahmed. Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graph to Multiprocessors. IEEE Trans. Parallel and Distributed Systems, 7:506-521, 1996.
12. A.Gerasoulis, and T.Yang. On The Granularity and Clustering of Directed Acyclic Task Graphs. IEEE Trans. Parallel and Distributed Systems, 4:686-701, 1993.
13. I.Ahmed, and Y.Kwork. A New Approach to Scheduling Parallel Program Using Task Duplication. Int'l Conf. Parallel Processing, 2:47-51, 1994.
14. G.Park, B.Shirazi, and J.Marquis. DFRN: A New Approach for Duplication Based Scheduling for Distributed Memory Multiprocessor System. Proc. Int'l Conf., Parallel Processing, 157-166, 1997.
15. M.Solar, F.Kri, and V.Parada. A Parallel Genetic Scheduling Algorithm to Generate High Quality Solutions in a Short Time. 4th Metaheuristic Int'l Conf., 115-119, 2001.
16. L.Wang, H.Siegel, and V. Roychowdhury. A Genetic-Algorithm-Based Approach for Task Matching and Scheduling in Heterogeneous Computing Environments. IEEE Trans. Parallel and Distributed Systems, 5:113-120, 1994.
17. S.Kim and J.Browne. A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures. Proc. Int'l Conf. Parallel Processing, 2:1-8, 1988.