Fast mutual exclusion by the Triangle algorithm-Reference-Cited by-同舟云学术

Fast mutual exclusion by the Triangle algorithm

Published:2017-11-07 Issue:4 Volume:30 Page:e4183
ISSN:1532-0626
Container-title:Concurrency and Computation: Practice and Experience
language:en
Short-container-title:Concurrency Computat Pract Exper.

Author:

Hesselink Wim H.¹,Buhr Peter A.²^ORCID,Dice David³

Affiliation:

1. Department of Computer Science; University of Groningen; 9700 AK Groningen The Netherlands

2. Cheriton School of Computer Science; University of Waterloo; Waterloo ON Canada

3. Oracle Labs; Burlington MA USA

Funder

Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada

Publisher

Wiley

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software

Reference30 articles.

1. Solution of a problem in concurrent programming control;Dijkstra;Commun ACM,September 1965

2. Additional comments on a problem in concurrent programming control;Knuth;Commun ACM,1966

3. The performance of spin lock alternatives for shared-memory multiprocessors;Anderson;IEEE Trans Parallel Distrib Syst,January 1990

4. Aboulenein NM Goodman JR Gjessing S Woest PJ Hardware support for synchronization in the scalable coherent interface (sci) Cancun, Mexico 1994 141 150

5. A fast mutual exclusion algorithm;Lamport;ACM Trans Comp Syst,1987

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A visit to mutual exclusion in seven dates;Theoretical Computer Science;2022-06

2. Trylock, a case for temporal logic and eternity variables;Science of Computer Programming;2022-04

3. A scalable lock on NUMA multicore;Concurrency and Computation: Practice and Experience;2020-08-14

4. A barrier optimization framework for NUMA multi‐core system;Concurrency and Computation: Practice and Experience;2019-10-21

5. High-contention mutual exclusion by elevator algorithms;Concurrency and Computation: Practice and Experience;2018-05-17