List ranking on processor arrays

List ranking finds for each cell in a linked list the number of cells that precede it in the list. This paper presents a work-efficient list-ranking algorithm for fine-grained processor arrays. This algorithm runs on an array of n/log 2 n processors with the expected run-time of O(log 2 n). As list...

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of systems and software Vol. 55; no. 2; pp. 185 - 192
Main Author:	Hasan, Cam
Format:	Journal Article
Language:	English
Published:	New York Elsevier Inc 29.12.2000 Elsevier Sequoia S.A
Subjects:	Algorithms Arrays List ranking Parallel algorithm Processor array Studies Work-efficient PRAM algorithm List ranking Parallel algorithm Processor array Work-efficient PRAM algorithm
ISSN:	0164-1212, 1873-1228
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!