Shared-memory Algorithms
Shared-Memory Algorithms is a class of parallel algorithms designed to solve computational problems by enabling multiple processing units to access and manipulate a common memory space, distinguished by their reliance on shared variables and synchronization mechanisms to coordinate concurrent execution in contrast to message-passing or distributed-memory models.
508
Publications
31.3K
Citations
1.2K
Authors
396
Institutions
Publications per year
2017–2026
48
508
HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Feng Niu, Benjamin Recht, Christopher Ré et al. · arXiv (Cornell University) · 2011 · 1.2K citations · Full text
Parallel models of associative memory
Richard A. Heath · Journal of Mathematical Psychology · 1982 · 1.1K citations
Parallelism in random access machines
Steven Fortune, James Wyllie · 1978 · 885 citations
1–5 of 508
1.2K
10
h-index
8
h-index
7
h-index
7
h-index
6
h-index
1–5 of 1.2K
396

University of Toronto
Toronto, Canada
13 h-index
19 publications
1.1K citations
Technion – Israel Institute of Technology
Haifa, Israel
13 h-index
17 publications
1.3K citations
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
22 publications
840 citations
Carnegie Mellon University
Pittsburgh, United States
12 h-index
36 publications
4K citations
IBM (United States)
Armonk, United States
12 h-index
19 publications
1.9K citations
The University of Texas at Austin
Austin, United States
11 h-index
24 publications
1.2K citations
University of California, Berkeley
Berkeley, United States
11 h-index
21 publications
1.4K citations
Stanford University
Stanford, United States
11 h-index
16 publications
2.1K citations
1–8 of 396
14 publications · 395 citations
13
h-index
Repository · 11 publications · 1.4K citations
10
h-index
TPDS · 11 publications · 314 citations
10
h-index
10 publications · 806 citations
10
h-index
JACM · 9 publications · 1.1K citations
9
h-index
1–5