By Topic

A lower bound for the QRQW PRAM

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
$31 $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

1 Author(s)
MacKenzie, P.D. ; Sandia Nat. Labs., Albuquerque, NM, USA

The queue-read, queue-write (QRQW) parallel random access machine (PRAM) model is a shared memory model which allows concurrent reading and writing with a time cost proportional to the contention. This is designed to model currently available parallel machines more accurately than either the CRCW PRAM or EREW PRAM models. Many algorithmic results have been developed for the QRQW PRAM. However, the only lower bound results have been fairly simple reductions from lower bounds for other models, such as the EREW PRAM or the “few-write” CREW PRAM. We present a lower bound specific to the QRQW PRAM. This lower bound is on the problem of linear approximate compaction (LAC), whose input consists of at most m marked items in an array of size n, and whose output consists of the m marked items in an array of size O(m). There is an O(√log n) expected n time randomized algorithm for LAC on the QRQW PRAM. We prove a lower bound of Ω(log log log n) expected time for any randomized algorithm for LAC. This bound applies regardless of the number of processors and memory cells of the QRQW PRAM. The previous best lower bound was Ω(log* n) time, taken from the known lower bound for LAC on the CRCW PRAM

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995