Asynchronous analysis of parallel dynamic programming algorithms

We examine a very simple asynchronous model of parallel computation that assumes the time to compute a task is random, following some probability distribution. The goal of this model is to capture the effects of unpredictable delays on processors, due to communication delays or cache misses, for exa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems Jg. 7; H. 4; S. 425 - 438
Hauptverfasser: Lewandowski, G., Condon, A., Bach, E.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Los Alamitos, CA IEEE 01.04.1996
IEEE Computer Society
Schlagworte:
Algorithm design and analysis
Applied sciences
Computational modeling
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Computer systems performance. Reliability
Concurrent computing
Delay effects
Distributed computing
Dynamic programming
Exact sciences and technology
Heuristic algorithms
Pipeline processing
Probability distribution
Queueing analysis
Software
Multiprocessor
Communication process
Asynchronous
Parallel programming
Probability distribution
Dynamic programming
Queueing network
Algorithm analysis
Delay
Pipeline
ISSN:1045-9219
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We examine a very simple asynchronous model of parallel computation that assumes the time to compute a task is random, following some probability distribution. The goal of this model is to capture the effects of unpredictable delays on processors, due to communication delays or cache misses, for example. Using techniques from queueing theory and occupancy problems, we use this model to analyze two parallel dynamic programming algorithms. We show that this model is simple to analyze and correctly predicts which algorithm will perform better in practice. The algorithms we consider are a pipeline algorithm, where each processor i computes in order the entries of rows i, i+p, and so on, where p is the number of processors; and a diagonal algorithm, where entries along each diagonal extending from the left to the top of the table are computed in turn. It is likely that the techniques used here can be useful in the analysis of other algorithms that use barriers or pipelining techniques.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1045-9219
DOI:10.1109/71.494636