A lower bound for the QRQW PRAM

PDF Version Also Available for Download.

Description

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. Here we present a lower bound specific to the QRQW PRAM. This lower bound ... continued below

Physical Description

11 p.

Creation Information

MacKenzie, P. D. May 2, 1995.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Sponsor

Publisher

  • Sandia National Laboratories
    Publisher Info: Sandia National Labs., Albuquerque, NM (United States)
    Place of Publication: Albuquerque, New Mexico

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

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. Here 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 rn marked items in an array of size 0(m). There is an O({radical}log n), expected time randomized algorithm for LAC on the QRQW PRAM. We prove a lower bound of {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 {Omega}(log* n) time, taken from the known lower bound for LAC on the CRCW PRAM.

Physical Description

11 p.

Notes

OSTI as DE95013020

Source

  • 7. IEEE symposium on parallel and distributed processing, San Antonio, TX (United States), 25-28 Oct 1995

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE95013020
  • Report No.: SAND--95-1081C
  • Report No.: CONF-951069--1
  • Grant Number: AC04-94AL85000
  • Office of Scientific & Technical Information Report Number: 93994
  • Archival Resource Key: ark:/67531/metadc794705

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • May 2, 1995

Added to The UNT Digital Library

  • Dec. 19, 2015, 7:14 p.m.

Description Last Updated

  • April 14, 2016, 4:17 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 1
Total Uses: 9

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

MacKenzie, P. D. A lower bound for the QRQW PRAM, article, May 2, 1995; Albuquerque, New Mexico. (digital.library.unt.edu/ark:/67531/metadc794705/: accessed June 20, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.