The Community for Technology Leaders
Green Image
Issue No. 10 - October (1991 vol. 40)
ISSN: 0018-9340
pp: 1149-1153
<p>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+logn) on a local memory PRAM model using p processors and p shared memory cells.</p>
linked list prefix algorithm; local memory computer; deterministic parallel algorithm; input list; local memory PRAM model; processors; shared memory cells; computational complexity; data structures; list processing; parallel algorithms.

Y. Han, "An Optimal Linked List Prefix Algorithm on a Local Memory Computer," in IEEE Transactions on Computers, vol. 40, no. , pp. 1149-1153, 1991.
84 ms
(Ver 3.3 (11022016))