Titlebook: Recoverable Mutual Exclusion; Sahil Dhoked,Wojciech Golab,Neeraj Mittal Book 2023 The Editor(s) (if applicable) and The Author(s), under e

頌揚(yáng)本人

cortisol

Classify

978-3-031-20004-5The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl

透明

Recoverable Mutual Exclusion978-3-031-20002-1Series ISSN 2155-1626 Series E-ISSN 2155-1634

帽子

glacial

A保存的

敏捷

Conserve

Tight Lower Bound,In this chapter, we describe a tight lower bound on the RMR complexity of an RME algorithm when, in addition to read, write and comparison-based primitives, processes can also use certain non-comparison-based primitives such as fetch-and-increment and fetch-and-store.

miniature

Discussion and Open Problems,While many efficient algorithms have been proposed to solve the RME problem, several scientific questions remain to be addressed, including how to reclaim dynamically allocated memory (e.g., nodes used in queue-based locks).