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

Authors:
W. Zimmermann;W. Löwe;D. Trystram
Affiliations:
Universität Karlsruhe, Institut für Programmstrukturen und Datenorganisation, D-76128 Karlsruhe, Germany;-;ID-Antenne de l'ENSIMAG, 51 Rue Kuntzmann, 38330 Montbonnot St. Martin, France
Venue:
Information Processing Letters
Year:
2002

Citing 6
Cited 0

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Optimal broadcast and summation in the LogP model

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
LogP: a practical model of parallel computation

Communications of the ACM

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we consider scheduling of send-graphs (i.e., a root sends a message to all its leaves) and receive-graphs (i.e., a root receives messages from all its leaves) under the LogP-model. It turns out that even for these simple task-graphs it is NP-complete to decide whether there is a schedule under the LogP-model with makespan at most D for any fixed number of processors. We present approximation algorithms for these problems.