Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Shared memory

Known as: Shared, SMA, Shared-memory 
In computer science, shared memory is memory that may be simultaneously accessed by multiple programs with an intent to provide communication among… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
At its most elemental level, OpenMP is a set of compiler directives and callable runtime library routines that extend Fortran… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Scalable shared-memory multiprocessors distribute memory among the processors and use scalable interconnection networks to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We present the Stanford Parallel Applications for Shared-Memory (SPLASH), a set of parallel applications for use in the design… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Busy-wait techniques are heavily used for mutual exclusion andbarrier synchronization in shared-memory parallel programs… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A new model of memory consistency, called release consistency, that allows for more buffering and pipelining than previously… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Publisher Summary This chapter discusses parallel algorithms for shared-memory machines. Parallel computation is rapidly… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
  • T. Anderson
  • IEEE Trans. Parallel Distributed Syst.
  • 1990
  • Corpus ID: 3923335
The author examines the questions of whether there are efficient algorithms for software spin-waiting given hardware support for… Expand
  • figure 2
  • table III
  • table V
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
This paper introduces a general formulation of atonuc wzap~hot rnenzory, a shared memory partitioned into words written (apduted… Expand
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Abstract We give a new randomized algorithm for achieving consensus among asynchronous processes that communicate by reading and… Expand
Is this relevant?