TY - JOUR
T1 - Speeding Lamport's fast mutual exclusion algorithm
AU - Merritt, Michael
AU - Taubenfeld, Gadi
PY - 1993/3/8
Y1 - 1993/3/8
N2 - 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.
AB - 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.
KW - Fast mutual exclusion
KW - algorithms
KW - concurrency
KW - contention sensitive
UR - http://www.scopus.com/inward/record.url?scp=0027911721&partnerID=8YFLogxK
U2 - 10.1016/0020-0190(93)90015-2
DO - 10.1016/0020-0190(93)90015-2
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0027911721
SN - 0020-0190
VL - 45
SP - 137
EP - 142
JO - Information Processing Letters
JF - Information Processing Letters
IS - 3
ER -