Scheduling fork graphs under logp with an unbounded number of processors

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

Volumn 1470 LNCS, Issue , 1998, Pages 940-943

  Kort, Iskander ^a   Trystram, Denis ^a  

^a IPAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

COMPUTATIONAL MODEL; LOGP MODEL; TASK GRAPH;

SCHEDULING ALGORITHMS;

EID: 0343572888     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0057951     Document Type: Conference Paper

References (6)

1. P. Chrétienne. Task Scheduling over Distributed Memory Machines. In North Holland, editor, International Workshop on Parallel and Distributed Algorithms, 1989.
2. P. Chrétienne. Complexity of Tree-scheduling with Interprocessor Communication Delays. Technical Report 90.5, MASI, Pierre and Marie Curie University, Paris, 1990.
3. D. E. Culler et al. LogP: A practical model of parallel computation. Communications of the ACM, 39(ll):78-85, November 1996.
4. L. Finta and Z. Liu. Complexity of Task Graph Scheduling with Fixed Communication Capacity. International Journal of Foundations of Computer Science, 8(1):43-66, 1997.
5. W. Löwe, M. Middendorf, and W. Zimmermann. Scheduling Inverse Trees under the Communication Model of the LogP-Machine. Theoretical Computer Science, 1997. to appear.
6. J. Verriet. Scheduling Tree-structured Programs in the Logp Model. Technical Report UU-CS-1997-18, Department of Computer Science, Utrecht University, 1997.