Document
About this Digital Document
The Mindicator is a shared object that stores one value for each thread in a system, and can return the minimum of all thread's values in constant time. In this paper, we explore applications of the Mindicator in synchronization algorithms. We introduce three new algorithms, designed for scalable Read-Copy-Update (RCU), fair Readers-Writer locking, and Group Mutual Exclusion. Experimental evaluation shows these algorithms to perform well while avoiding contention.
Full Title
Scalable Synchronization with Mindicators
Member of
Contributor(s)
Creator: McNamara, Logan
Creator: Liu, Yujie
Publisher
Lehigh University
Date Issued
2013-05-01
Language
English
Type
Genre
Form
electronic documents
Media type
Subject (LCSH)
Date Other
2013
McNamara, . L., & Liu, . Y. (2013). Scalable Synchronization with Mindicators (1–). https://preserve.lehigh.edu/lehigh-scholarship/undergraduate-publications/eckardt-scholars/scalable-synchronization-mindicators
McNamara, Logan, and Yujie Liu. 2013. “Scalable Synchronization With Mindicators”. https://preserve.lehigh.edu/lehigh-scholarship/undergraduate-publications/eckardt-scholars/scalable-synchronization-mindicators.
McNamara, Logan, and Yujie Liu. Scalable Synchronization With Mindicators. 1 May 2013, https://preserve.lehigh.edu/lehigh-scholarship/undergraduate-publications/eckardt-scholars/scalable-synchronization-mindicators.