Analysis of an asynchronous PRAM algorithm

Analysis of an asynchronous PRAM algorithm

We consider the asynchronous PRAM model of Martel, Park, and Subramoniam and show that the computation of the n-way composition of any associative function requires expected work O(n log ∗n) with n/log n processors.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 1991-09, Vol.39 (5), p.253-256
1. Verfasser: Ragde, Prabhakar
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
asynchronous PRAM
composition of associative functions
Computational complexity
Computer science
control theory
systems
Exact sciences and technology
Information processing
Mathematical models
parallel algorithms
Random access
Software
Theory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the asynchronous PRAM model of Martel, Park, and Subramoniam and show that the computation of the n-way composition of any associative function requires expected work O(n log ∗n) with n/log n processors.
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(91)90024-C