• Home
  • Search
  • Towards Better Shared Memory Programming Models
  • Cite Icon4
  • https://doi.org/10.1007/978-1-4613-9668-0_13Copy DOI Icon

Towards Better Shared Memory Programming Models

  • Jan 1, 1989
  • Phillip B. Gibbons
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In an often-cited paper, A. Karp [1] commented on the “sorry state” of parallel programming, lamenting the difficulties in programming and debugging parallel programs on existing programming models. Indeed, a variety of programming models have been proposed with not entirely satisfactory results. In this note, we focus on the world of massively parallel shared memory machines and examine programming models for these machines. A shared memory parallel computer is one in which the processors communicate by reading and writing data words to a shared memory. We consider shared memory parallel computers with the following characteristics. Each processor has some fast, relatively small, private memory (e.g. registers, cache). There is a large shared memory composed of a series of memory banks that are accessible by all processors via an interconnection network. Each processor has one such memory bank which is local to it, i.e. it can access the bank without going through the interconnection network. The access time to a memory bank for a processor depends in part on the lengths of the links traversed and the number of hops in the path from the processor to the bank. Special coprocessors take care of interprocessor communication: both programmers and processors are relieved of the burden of routing the parallel requests to shared memory, including handling intermediate hops of requests traveling to their destinations. In order to overcome the high latency of accessing global memory, the parallel computer supports the pipelining of global memory accesses through the network. This implies that the interconnection network has sufficient bandwidth to handle the multiple requests per processor.

Similar Papers
  • Research Article
  • Citations1

Performance visualization for distributed shared memory systems

  • Jan 01, 2001
  • Scalable Computing Practice and Experience
  • James E Lumpp +3
  • Conference Article
  • Citations1

Rethinking Communication in Multiple-kernel OSes for New Shared Memory Interconnects

  • Oct 27, 2019
  • Antonio Barbalace +2
  • Book Chapter
  • Citations1

Microtasking versus Message Passing Parallelisation of the 3D-Combustion Code AIOLOS on the NEC SX-4

  • Jan 01, 1998
  • Parallel Computational Fluid Dynamics '97
  • B Risio +3
  • Book Chapter
  • Citations25

A Fully Compliant OpenMP Implementation on Software Distributed Shared Memory

  • Jan 01, 2002
  • Sven Karlsson +2
  • Research Article
  • Citations1

View consistencies and exact implementations

  • Dec 04, 2002
  • Parallel Computing
  • Hon F Li +1
  • PDF
  • Research Article
  • Citations1

Effective On-Chip Communication for Message Passing Programs on Multi-Core Processors

  • Nov 03, 2021
  • Electronics
  • Joonmoo Huh +1
  • Conference Article

M-PVM: An Implementation of PVM for Multithreaded and Shared-Memory Environments

  • Oct 07, 1997
  • Cláudio M P Santos +1
  • Conference Article
  • Citations22

A programming model for deterministic task parallelism

  • Jun 05, 2011
  • Polyvios Pratikakis +3
  • Conference Article
  • Citations28

LEAP Shared Memories: Automating the Construction of FPGA Coherent Memories

  • May 01, 2014
  • Hsin Jung Yang +3
  • Research Article
  • Citations17

Data Structures and Algorithms for Counting Problems on Graphs using GPU

  • Jan 01, 2013
  • International Journal of Networking and Computing
  • Amlan Chatterjee +2
  • Conference Article
  • Citations1

Liquid metal combustion modeling on a shared memory parallel computer - Simulation of jet-driven circulation

  • Jul 10, 1995
  • L Parnell +1
  • Conference Article

Session 1: performance analysis

  • Jan 09, 2002
  • N Podhorszki
  • Conference Article
  • Citations7

The MULTIPLUS/MULPLIX parallel processing environment

  • Jun 12, 1996
  • J.S Aude +7
  • Book Chapter
  • Citations3

Balancing Shared and Distributed Heaps on NUMA Architectures

  • Dec 27, 2014
  • Malak Aljabri +2
  • Research Article
  • Citations15

Parallel computation with adaptive methods for elliptic and hyperbolic systems

  • Sep 01, 1990
  • Computer Methods in Applied Mechanics and Engineering
  • Messaoud Benantar +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.