✦ LIBER ✦

Contention-Free Complexity of Shared Memory Algorithms

✍ Scribed by Rajeev Alur; Gadi Taubenfeld

Book ID: 112252223
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 497 KB
Volume: 126
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0034

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Virtual Shared Memory: Algorithms and Co

Virtual Shared Memory: Algorithms and Complexity

✍ A. Chin; W.F. Mccoll 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 971 KB

Contention resolution on a broadcast-bas

Contention resolution on a broadcast-based distributed shared memory multiprocessor

✍ Akay, M.F.; Katsinis, C. 📂 Article 📅 2008 🏛 The Institution of Engineering and Technology 🌐 English ⚖ 854 KB

Design of efficient parallel algorithms

Design of efficient parallel algorithms on shared memory multiprocessors

✍ Qiao Xiangzhen 📂 Article 📅 1996 🏛 Wuhan University 🌐 English ⚖ 431 KB

Distributed shared memory: a survey of i

Distributed shared memory: a survey of issues and algorithms

✍ Nitzberg, B.; Lo, V. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 871 KB

Self-Stabilization of Wait-Free Shared M

Self-Stabilization of Wait-Free Shared Memory Objects

✍ Jaap-Henk Hoepman; Marina Papatriantafilou; Philippas Tsigas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 337 KB

This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every execution after a transient memory failure is linearizable except for an a priori bounded number of actions. Shared registers have

Energy-performance trade-off analysis of

Energy-performance trade-off analysis of parallel algorithms for shared memory architectures

✍ Vijay Anand Korthikanti; Gul Agha 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 514 KB