Speeding Lamport's fast mutual exclusion algorithm

Michael Merritt; Gadi Taubenfeld

doi:10.1016/0020-0190(93)90015-2

Speeding Lamport's fast mutual exclusion algorithm

Michael Merritt, Gadi Taubenfeld

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	137-142
Number of pages	6
Journal	Information Processing Letters
Volume	45
Issue number	3
DOIs	https://doi.org/10.1016/0020-0190(93)90015-2
State	Published - 8 Mar 1993
Externally published	Yes

Keywords

Fast mutual exclusion
algorithms
concurrency
contention sensitive

Access to Document

10.1016/0020-0190(93)90015-2

Cite this

@article{b2a57554eaa442d4b0ff8823e9fd0919,

title = "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.",

keywords = "Fast mutual exclusion, algorithms, concurrency, contention sensitive",

author = "Michael Merritt and Gadi Taubenfeld",

year = "1993",

month = mar,

day = "8",

doi = "10.1016/0020-0190(93)90015-2",

language = "אנגלית",

volume = "45",

pages = "137--142",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier BV",

number = "3",

}

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 -

Speeding Lamport's fast mutual exclusion algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this