Title :
An optimal linked list prefix algorithm on a local memory computer
Author_Institution :
Dept. of Comput. Sci., Kentucky Univ., Lexington, KY, USA
fDate :
10/1/1991 12:00:00 AM
Abstract :
The author presents a deterministic parallel algorithm for the linked list prefix problem. It computes linked list prefixs for an input list of n elements in time O(n/p+log n) on a local memory PRAM model using p processors and p shared memory cells
Keywords :
computational complexity; data structures; list processing; parallel algorithms; deterministic parallel algorithm; input list; linked list prefix algorithm; local memory PRAM model; local memory computer; processors; shared memory cells; Algorithm design and analysis; Computer science; Concurrent computing; Parallel algorithms; Partitioning algorithms; Phase change random access memory; Read-write memory; Sorting; Time sharing computer systems; Writing;
Journal_Title :
Computers, IEEE Transactions on
