A lower bound for the QRQW PRAM

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 PR...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing s. 231 - 237
Hlavný autor: MacKenzie, P.D.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 1995
Predmet:
Algorithm design and analysis
Broadcasting
Compaction
Costs
Laboratories
Linear approximation
Los Angeles Council
Network address translation
Phase change random access memory
Read-write memory
ISBN:9780818671951, 0818671955
ISSN:1063-6374
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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(/spl radic/log n) expected n time randomized algorithm for LAC on the QRQW PRAM. We prove a lower bound of /spl Omega/(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 /spl Omega/(log* n) time, taken from the known lower bound for LAC on the CRCW PRAM.
ISBN:9780818671951
0818671955
ISSN:1063-6374
DOI:10.1109/SPDP.1995.530689