Group mutual exclusion in linear time and space
He, Yuan; Gopalakrishnan, Krishnan; Gafni, Eli
We present two algorithms for the Group Mutual Exclusion (GME) Problem that satisfy the properties of Mutual Exclusion, Starvation Freedom, Bounded Exit, Concurrent Entry and First Come First Served. Both our algorithms use only simple read and write instructions, have O (N) Shared Space complexity and O (N) Remote Memory Reference (RMR) complexity in the Cache Coherency (CC) model. Our ﬁrst algorithm is developed by generalizing the well-known Lamport’s Bakery Algorithm for the classical mutual exclusion problem, while preserving its simplicity and elegance. However, it uses unbounded shared registers. Our second algorithm uses only bounded registers and is developed by generalizing Taubenfeld’s Black and White Bakery Algorithm to solve the classical mutual exclusion problem using only bounded shared registers. We show that contrary to common perception our algorithms are the ﬁrst to achieve these properties with this combination of complexities.
He, Yuan, & Gopalakrishnan, Krishnan, & Gafni, Eli. (January 2018). Group mutual exclusion in linear time and space. Theoretical Computer Science, (31-47. Retrieved from http://hdl.handle.net/10342/6815
He, Yuan, and Gopalakrishnan, Krishnan, and Gafni, Eli. "Group mutual exclusion in linear time and space". Theoretical Computer Science. . (31-47.), January 2018. October 21, 2020. http://hdl.handle.net/10342/6815.
He, Yuan and Gopalakrishnan, Krishnan and Gafni, Eli, "Group mutual exclusion in linear time and space," Theoretical Computer Science 709, no. (January 2018), http://hdl.handle.net/10342/6815 (accessed October 21, 2020).
He, Yuan, Gopalakrishnan, Krishnan, Gafni, Eli. Group mutual exclusion in linear time and space. Theoretical Computer Science. January 2018; 709() 31-47. http://hdl.handle.net/10342/6815. Accessed October 21, 2020.