A BOUNDED 1ST-IN, 1ST-ENABLED SOLUTION TO THE L-EXCLUSION PROBLEM

被引：30

作者：

AFEK, Y

DOLEV, D

GAFNI, E

MERRITT, M

SHAVIT, N

机构：

[1] TEL AVIV UNIV,IL-69978 TEL AVIV,ISRAEL

[2] HEBREW UNIV JERUSALEM,JERUSALEM,ISRAEL

[3] UNIV CALIF LOS ANGELES,LOS ANGELES,CA 90024

[4] IBM CORP,ALMADEN RES CTR,SAN JOSE,CA 95114

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1994年 / 16卷 / 03期

关键词：

RELIABILITY; ATOMIC REGISTERS; CONCURRENCY; TIMESTAMPS;

D O I：

10.1145/177492.177731

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

This article presents a solution to the first-come, first-enabled l-exclusion problem of Fischer et al. [1979]. Unlike their solution, this solution does not use powerful read-modify-write synchronization primitives and requires only bounded shared memory. Use of the concurrent timestamp system of Dolev and Shavit [1989] is key in solving the problem within bounded shared memory.

引用

页码：939 / 953

页数：15

共 21 条

[1]

AFEK Y, 1990, 9TH P ANN S PRINC DI, P1

[2]

ATTIYA H, 1987, ACM FOCS, P337

[3]

CHANDY KM, 1984, ACM T PROGR LANG SYS, V6, P632, DOI 10.1145/1780.1804

[4]

Dijkstra E. W., 1971, ACTA INFORM, V1, P115, DOI [10.1007/BF00289519, DOI 10.1007/BF00289519]

[5] SOLUTION OF A PROBLEM IN CONCURRENT PROGRAMMING CONTROL [J].

DIJKSTRA, EW .

COMMUNICATIONS OF THE ACM, 1965, 8 (09) :569-&

[6] SELF-STABILIZING SYSTEMS IN SPITE OF DISTRIBUTED CONTROL [J].

DIJKSTRA, EW .

COMMUNICATIONS OF THE ACM, 1974, 17 (11) :643-644

[7]

DOLEV D, 1989, 21ST P ACM S THEOR C, P454

[8]

DOLEV D, 1988, 19TH P ACM SIGACT S, P78

[9]

DWORK C, 1992, 1ST P ISR S THEOR CO, P276

[10]

DWORK C, 1992, 24TH P ANN ACM S THE, P655

← 1 2 3 →