Deterministic parallel list ranking

Deterministic parallel list ranking

In this paper we describe a simple parallel algorithm for list ranking. The algorithm is deterministic and runs in O(log n) time on EREW P-RAM with n/log n processor. The algorithm matches the performance of the Cole-Vishkin [CV86a] algorithm but is simple and has reasonable constant factors.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Anderson, Richard J., Miller, Gary L.
Format: Buchkapitel
Sprache:eng
Schlagworte:
Accounting Scheme
Efficient Parallel Algorithm
List Ranking
Parallel Algorithm
Parallel Prefix
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we describe a simple parallel algorithm for list ranking. The algorithm is deterministic and runs in O(log n) time on EREW P-RAM with n/log n processor. The algorithm matches the performance of the Cole-Vishkin [CV86a] algorithm but is simple and has reasonable constant factors.
ISSN:0302-9743
1611-3349
DOI:10.1007/BFb0040376