The complexity of deterministic PRAM simulation on distributed memory machines

In this paper we present lower and upper bounds for the deterministic simulation of a Parallel Random Access Machine (PRAM) withn processors andm variables on a Distributed Memory Machine (DMM) withp less than or equal to n processors. The bounds are expressed as a function of the redundancyr of the...

Full description

Saved in:
Bibliographic Details
Published inTheory of computing systems Vol. 30; no. 3; pp. 231 - 247
Main Authors Pietracaprina, A., Pucci, G.
Format Journal Article
LanguageEnglish
Published 01.06.1997
Subjects
Computer simulation
Distributed memory
Mathematical analysis
Mathematical models
Polynomials
Processors
Reproduction
Upper bounds
Online AccessGet full text

Cover

More Information
Summary:In this paper we present lower and upper bounds for the deterministic simulation of a Parallel Random Access Machine (PRAM) withn processors andm variables on a Distributed Memory Machine (DMM) withp less than or equal to n processors. The bounds are expressed as a function of the redundancyr of the scheme (i.e., the number of copies used to represent each PRAM variable in the DMM), and become tight for anym polynomial inn andr= Theta (1).
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1432-4350
1433-0490
DOI:10.1007/BF02679461