Duplication-based scheduling algorithm for interconnection-constrained distributed memory machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2552, Issue , 2002, Pages 52-62

  Bansal, Savina ^a,b   Kumar, Padam ^a   Singh, Kuldip ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY ROORKEE   (India)

^b GZS College of Engineering and Technology   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUNICATION LATENCY; CONSTRAINED TASKS; DE BRUIJN NETWORKS; DISTRIBUTED MEMORY MACHINES; DUPLICATION BASED SCHEDULING; MULTIPROCESSOR NETWORKS; PERFORMANCE DEGRADATION; PROCESSOR NETWORKS;

SCHEDULING ALGORITHMS;

EID: 0041454264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36265-7_6     Document Type: Conference Paper

References (15)

1. Gerasoulis, A., Yang, T.: A Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs onto Multiprocessors. Journal of Parallel and Distributed Computing 16 (1992) 276-291
2. Kruatrachue, B., Lewis, T.G.: Grain Size Determination for Parallel Processing. IEEE Transactions on Software Engineering (1988) 23-32
3. Sih, G.C., Lee, E.A.: A Compile-Time Scheduling Heuristic for Interconnection Constrained Heterogeneous Processor Architectures. IEEE Transactions on Parallel and Distributed Systems.4 (1993) 75-87
4. Rewini, H.E.I., Lewis, T.G., Ali, H.H.: Task Scheduling in Parallel and Distributed Systems. Prentice Hall, NJ (1994)
5. Ahmed, I., Kwok, Y.K.: On Exploiting Task Duplication in Parallel Program Scheduling. IEEE Transactions on Parallel and Distributed Systems (1998) 872-892
6. Dikaiakos, M.D., et. al.: A Comparative Study of Heuristics for Mapping Parallel Algorithms to Message Passing Multiprocessors. Tech. Report Princeton University (1994)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co. (1979)
8. Wu, M.Y., Gajski, D.S.: Hypertool: A Programming Aid for Message-Passing Systems. IEEE Transactions on Parallel and Distributed Systems 1(1990) 330-343
9. Wu, M.Y., Shu, W., Gu, J.: Efficient Local Search for DAG Scheduling. IEEE Transactions on Parallel and Distributed Systems 12 (2001) 617-627
10. Sevalkumar, S., Ramamoorthy, C.V.: Scheduling Precedence Constrained Task Graphs with Non-Negligible Inter Task Communication onto Multiprocessors. IEEE Transactions on Parallel and Distributed Systems (1994) 328-336
11. Darbha, S., Agrawal, D.P.: Optimal Scheduling Algorithm for Distributed Memory Machines, IEEE Transactions on Parallel and Distributed systems (1998) 87-95
12. Yang T., Gerasoulis, A.: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Transactions on Parallel and Distributed Systems 5 (1994) 951-967
13. Kwok, Y.K., Ahmad, I.: Benchmarking and Comparison of the Task Graph Scheduling Algorithms. Journal of Parallel and Distributed Computing 59 (1999) 381-422
14. Samatham, M.R., Pradhan, D.K.: The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI. IEEE Transactions on Computers 38 (1989) 567-581
15. Bansal, S., Kumar, P., Singh, K.: A Cost-effective Scheduling Algorithm for Message Passing Multiprocessor Systems. (Accepted for publication in Proc. PDCS-2002, Louisville, Kentucky, USA, Sept. 19-21, 2002)