On scheduling send-graphs and receive-graphs under the LogP-model

Information Processing Letters

Volumn 82, Issue 2, 2002, Pages 83-92

  Zimmermann, W ^a   Lowe W ^a   Trystram, D ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b ID Antenne De l'Ensimag   (France)

Author keywords

Algorithms; Parallel processing

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; SCHEDULING; SYNCHRONIZATION;

COMMUNICATION DELAYS;

PARALLEL PROCESSING SYSTEMS;

EID: 0037197532     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00257-5     Document Type: Article

References (8)

1. LogP: Towards a realistic model of parallel computation
2. LogP: A practical model of parallel computation
3. Bounds on multiprocessing timing anomalies
4. Using dual approximation algorithms for scheduling problems: Theoretical and practical results
5. A catalog of complexity classes
6. Optimal broadcast and summation in the LogP-model
7. Towards an architecture-independent analysis of parallel algorithms