By Topic

The complexity of parallel prefix problems on small domains

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Chaudhuri ; Dept. of Comput. Sci., Waterloo Univ., Ont., Canada ; J. Radhakrishnan

The authors study the complexity of some prefix problems in the CRCW PRAM model. The main result is an Ω(α(n)) lower bound for chaining, matching a previous upper bound and solving an open problem. They give reductions to show an Ω(α(n)) lower bound on the complexity of the prefix maxima and range maxima problems even when the domain is {1,...,n}. An interesting consequence is that prefix maximum is strictly harder than simple maximum. They also give a reduction to show an Ω(α(n)) lower bound on a parenthesis matching problem, matching the upper bound. No lower bounds were previously known for any of these problems. The lower bounds contribute to the study of very fast parallel algorithms by introducing techniques for proving lower bounds for small domain problems

Published in:

Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on

Date of Conference:

24-27 Oct 1992