Space-efficient scheduling of multithreaded computations

This paper considers the problem of scheduling dynamic parallel computations to achieve linear speedup without using significantly more space per processor than that required for a single-processor execution. Utilizing a new graph-theoretic model of multithreaded computation, execution efficiency is...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 1998-02, Vol.27 (1), p.202-229
Hauptverfasser:	BLUMOFE, R. D, LEISERSON, C. E
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science Computer science control theory systems Exact sciences and technology Laboratories Schedules Scheduling Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!