KiWi

Basin, Dmitry; Bortnikov, Edward; Braginsky, Anastasia; Golan-Gueta, Guy; Hillel, Eshcar; Keidar, Idit; Sulamy, Moshe

doi:10.1145/3018743.3018761

Cited by 25 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…KiWi [8] presents a design that provides wait-free scans and lock-free updates without the loss of consistency. Its core intuition is that multi-versioning is essentially intended for consistent synchronization between readers and writers, and thus only makes a snapshot when there are on-going scans; otherwise, updates are overwritten in-place.…”

Section: Kvs Optimizationmentioning

confidence: 99%

JellyFish

Yeon

Kim

Han

et al. 2020

Proceedings of the 21st International Middleware Conference

View full text Add to dashboard Cite

Section: Kvs Optimizationmentioning

confidence: 99%

JellyFish

Yeon

Kim

Han

et al. 2020

Proceedings of the 21st International Middleware Conference

View full text Add to dashboard Cite

“…The normalized form requires that all modifications to the shared memory be executed by the CAS instruction. In recent years, there has been a growing trend of using the Fetch-And-Add (FAA) instruction for synchronization, in addition to CAS [Basin et al 2017;Braginsky et al 2016;Yang and Mellor-Crummey 2016]. Under a high contention, the CAS instruction is likely to "fail", hence necessitating additional attempts to apply the operation and increasing the contention on the memory bus.…”

Section: Normalized Form Of Lock-free Datamentioning

confidence: 99%

Every data structure deserves lock-free memory reclamation

Cohen

2018

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cases, requires redesigning the data structure. In this paper, we present the first lock-free memory-management scheme that is applicable to general (arbitrary) lock-free data structures and that can be applied automatically via a compiler plug-in. In addition to the simplicity of incorporating to data structures, this scheme provides low overhead and does not rely on the lock freedom of any OS services.Nachshon Cohen the data structure into a real application. However, state-of-the-art memory reclamation schemes require the data structure to satisfy certain algorithmic properties that are not met by many practical data-structures. If a data structure does not satisfy the required properties, there is no clear recipe for modifying it so that it would be amenable to memory reclamation. In general, applying a lock-free memory-reclamation scheme to a given data structure might requires expertise that is not available to all practitioners, might modify the properties of the data structure, or might not be possible at all.Consider, for example, Harris's linked list [Harris 2001] that stands at the core of many lock-free data structures. The original hazard pointers paper [Michael 2002a] states that Harris's linked list is "inherently incompatible" with the hazard-pointers scheme 1 . Instead, they designed a variation of this data structure -the Harris-Michael linked list [Michael 2002b] -on which hazard pointers can be applied. The differences between these data structures are subtle, hence it is easy to confuse them. Such confusion can lead even experienced researchers to apply hazard pointers on the wrong data structure, resulting in an incorrect design. Furthermore, it was later shown that the Harris-Herlihy-Shavit linked list [Herlihy and Shavit 2012] is also incompatible with the hazardpointers scheme. This data structure offers stronger progress guarantees (i.e., wait-free searches) and better performance than the Harris-Michael linked list [Cohen and Petrank 2015a]. Other recent memory-reclamation schemes [Alistarh et al. 2015;Balmau et al. 2016;Braginsky et al. 2013;Brown 2015;Cohen and Petrank 2015b;Dice et al. 2016] are similarly incompatible with the Harris and Harris-Herlihy-Shavit linked-list data structures.In this paper, we present Free Access: the first memory-reclamation scheme that stands up to the expectations of the data-structure designers. The Free Access scheme does not require the data structure to satisfy any algorithmic properties, hence making it generally applicable for existing and future lock-free data structures. Instead, it requires only that no instruction simultaneously reads a new pointer and writes to the shared memory. All lock-free data structures we are aware of satisfy this property without any modification. We cannot preclude a f...

show abstract

Achieving Performance and Programmability for MapReduce(-Like) Frameworks

Guo

Agrawal²

2018

2018 IEEE 25th International Conference on High Performance Computing (HiPC)

View full text Add to dashboard Cite

KiWi

Cited by 25 publications

References 24 publications

JellyFish

JellyFish

Every data structure deserves lock-free memory reclamation

Achieving Performance and Programmability for MapReduce(-Like) Frameworks

Contact Info

Product

Resources

About