Abstract
We present a parallel algorithm for the prefix sums problem which runs in time O ( log n /log log n ) using n log logn/log n processors (optimal speedup). This algorithm leads to a parallel list ranking algorithm which runs in O (log n ) time using n /log n processors (optimal speedup).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
