• DocumentCode
    1990142
  • Title

    The Shared Memory Hierarchy: The PRAM is as Powerful as the BSR

  • Author

    Bruda, Stefan D. ; Zhang, Yuanqiao

  • Author_Institution
    Dept. of Comput. Sci., Bishop´´s Univ., Sherbrooke, QC, Canada
  • fYear
    2008
  • fDate
    1-5 July 2008
  • Firstpage
    179
  • Lastpage
    185
  • Abstract
    We investigate the relative computational power of parallel models with shared memory. Based on feasibility considerations present in the literature, we split these models into "lightweight" and "heavyweight," and then find that the heavyweight class is strictly more powerful than the lightweight class, as expected. On the other hand, we contradict the long held belief that the heavyweight models (namely, the Combining CRCW PRAM and the BSR) form a hierarchy, showing that they are identical in computational power with each other. We thus introduce the BSR into the family of practically meaningful massively parallel models. This result also has significant implications in the area of real-time computations.
  • Keywords
    concurrency theory; shared memory systems; CRCW PRAM; parallel computation; parallel random access machine; shared memory hierarchy; shared memory parallel models; Algorithm design and analysis; Broadcasting; Computational modeling; Computer science; Concurrent computing; Distributed computing; Educational institutions; Phase change random access memory; Polynomials; Time sharing computer systems; broadcast with selective reduction; concurrent-read concurrent-write conflict resolution rules; parallel computation; parallel random access machine; real time; shared memory parallel models;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Computing, 2008. ISPDC '08. International Symposium on
  • Conference_Location
    Krakow
  • Print_ISBN
    978-0-7695-3472-5
  • Type

    conf

  • DOI
    10.1109/ISPDC.2008.8
  • Filename
    4724245