License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-15315
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1531/
Go to the corresponding Portal


Lopez-Ortiz, Alejandro ; Dorrigiv, Reza ; Salinger, Alejandro

Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM)

pdf-format:
Document 1.pdf (294 KB)


Abstract

We propose a new model with small degreee of parallelism that reflects current and future multicore architectures in practice. The model is based on the PRAM architecture and hence it inherits many of its interesting theoretical properties. The key observations and differences are that the degree of parallelism (i.e. number of processors or cores) is bounded by O(log n), the synchronization model is looser and the use of parallelism is at a higher level unless explicitly specified otherwise. Surprisingly, these three rather minor variants result in a model in which obtaining work optimal algorithms is significantly easier than for the PRAM. The new model is called Low-degree PRAM or LoPRAM for short. Lastly we observe that there are thresholds in complexity of programming at p=O(log n) and p=O(sqrt(n)) and provide references for specific problems for which this threshold has been formally proven.

BibTeX - Entry

@InProceedings{lopezortiz_et_al:DSP:2008:1531,
  author =	{Alejandro Lopez-Ortiz and Reza Dorrigiv and Alejandro Salinger},
  title =	{Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM)},
  booktitle =	{Data Structures},
  year =	{2008},
  editor =	{Lars Arge and Robert Sedgewick and Raimund Seidel},
  number =	{08081},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1531},
  annote =	{Keywords: PRAM, multicore architectures, parallelism, algorithms, dynamic programming, divide and conquer}
}

Keywords: PRAM, multicore architectures, parallelism, algorithms, dynamic programming, divide and conquer
Seminar: 08081 - Data Structures
Issue Date: 2008
Date of publication: 16.06.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI