The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1991 vol.40)
pp: 1149-1153
ABSTRACT
<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>
INDEX TERMS
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.
CITATION
Y. Han, "An Optimal Linked List Prefix Algorithm on a Local Memory Computer", IEEE Transactions on Computers, vol.40, no. 10, pp. 1149-1153, October 1991, doi:10.1109/12.93747
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool