On the efficiency of scheduling algorithms for parallel gaussian elimination with communication delays

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

Volumn 1947, Issue , 2001, Pages 74-81

  Čiegis, Raimondas ^a   Starikovičius, Vadimas ^b   Waśniewski, Jerzy ^c  

^a VILNIUS GEDIMINAS TECHNICAL UNIVERSITY   (Lithuania)

^b VILNIUS UNIVERSITY   (Lithuania)

^c UNI C   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); EFFICIENCY; GAUSSIAN DISTRIBUTION;

BLOCK-CYCLIC DISTRIBUTION; COMMUNICATION DELAYS; COMMUNICATION OVERHEADS; DISTRIBUTED-MEMORY COMPUTERS; GAUSSIAN ELIMINATION METHOD; PERFORMANCE PREDICTION; THEORETICAL MODELING; WORK-LOAD DISTRIBUTION;

SCHEDULING ALGORITHMS;

EID: 84956997174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-70734-4     Document Type: Conference Paper

References (4)

1. Amoura, A., Bampis, E., König, J.: Scheduling algorithms for parallel Gaussian elimination with communication costs, IEEE Transactions on Parallel and Distributed systems, 9 (1998) 679-686.
2. Choi, J., Demmel, J., Dhillon, I., Dongarra, J. et al.: ScaLAPACK: a portable linear algebra library for distribution memory computers - design issues and performance, LAPACK Working Note 95, University of Tennessee, 1995.
3. Djordjević, G., Tošić, M.: A heuristic for scheduling task graphs with communication delays onto multiprocessors, Parallel Computing, 22 (1996) 1197-1214.
4. Xu, Z., Hwang, K.: Early prediction of MPP performance: the SP2, T3D, and Paragon experiences, Parallel Computing, 22 (1996) 917-942.