Efficient synchronization of multiprocessors with shared memory
From MaRDI portal
Publication:3814768
DOI10.1145/48022.48024zbMath0663.68011OpenAlexW2071226137MaRDI QIDQ3814768
Marc Snir, Clyde P. Kruskal, Larry Rudolph
Publication date: 1988
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1988-10/
synchronizationparallel processinginterconnection networkfetch-and-addparallel prefixarchitecture correctnessmemory reference combiningread-modify-write
Related Items
Solo-valency and the cost of coordination ⋮ Bounded-wait combining: constructing robust and high-throughput shared objects ⋮ A complexity theory of efficient parallel algorithms ⋮ Linearizable counting networks ⋮ Hundreds of impossibility results for distributed computing ⋮ Read-modify-write networks ⋮ A criterion for atomicity ⋮ Efficient randomized test-and-set implementations ⋮ The cost of concurrent, low-contention Read \& Modify \& Write ⋮ Unnamed Item