Speeding Lamport's Fast Mutual Exclusion Algorithm
暂无分享,去创建一个
Abstract A linked list is used to speed up a mutual exclusion algorithm. This optimization permits additional concurrency by allowing scans of the list to be concurrent with insertions and deletions of list entries.
[1] G. Taubenfeld,et al. Results about fast mutual exclusion , 1992, [1992] Proceedings Real-Time Systems Symposium.
[2] Leslie Lamport,et al. A fast mutual exclusion algorithm , 1987, TOCS.