Entry Helary:1988:DAM from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Helary:1988:DAM,
author = "J.-M. H{\'e}lary and N. Plouzeau and M. Raynal",
title = "A Distributed Algorithm for Mutual Exclusion in an
Arbitrary Network",
journal = j-COMP-J,
volume = "31",
number = "4",
pages = "289--295",
month = aug,
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.4.289",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68M10",
MRnumber = "962 701",
bibdate = "Tue Dec 4 14:48:25 MST 2012",
bibsource = "Compendex database; Distributed/CCR.bib;
http://comjnl.oxfordjournals.org/content/31/4.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/",
URL = "http://comjnl.oxfordjournals.org/content/31/4/289.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/289.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/290.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/291.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/292.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/293.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/294.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_04/tiff/295.tif",
abstract = "A distributed algorithm for mutual exclusion is
presented. No particular assumptions on the network
topology are required, except connectivity; the
communications graph may be arbitrary. The processes
communicate by using messages only and there is no
global controller. Furthermore, no process needs to
know or learn the global network topology. In that
sense, the algorithm is more general than the mutual
exclusion algorithms which make use of an {\it a
priori} knowledge of the network topology (for example
either ring or complete network). A proof of the
correctness of the algorithm is provided. The
algorithm's complexity is examined by evaluating the
number of messages required for the mutual exclusion
protocol.",
acknowledgement = ack-nhfb,
affiliation = "Univ de Rennes, Rennes, Fr",
affiliationaddress = "Univ de Rennes, Rennes, Fr",
classcodes = "C4240 (Programming and algorithm theory); C5620
(Computer networks and techniques)",
classification = "723",
corpsource = "Rennes 1 Univ., France",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "arbitrary network; communication graph; complexity;
computational complexity; computer networks; computer
programming --- Algorithms; distributed; distributed
algorithm; exclusion; Local Networks; message traffic;
mutual; mutual exclusion; processing; program
correctness; program verification; programming theory;
protocol; protocols",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 68M10,
28(1)5,
30(4)298
- arbitrary,
25(1)32,
25(1)114,
28(1)5,
30(4)298,
30(5)425,
30(5)437,
31(4)325,
32(4)362
- assumption,
28(2)112
- communication, 23-3-255b-255,
23(4)369,
24(1)25,
24(1)78,
25(1)22,
25(1)87,
25(2)161,
25(4)410,
25(4)494,
26(3)247,
28(1)5,
28(3)200,
29(2)109,
29(6)506,
30(3)254,
30(5)437,
30(5)458,
31(2)175,
31(4)296,
32(3)252,
32(3)262,
32(3)267,
32(4)362,
32(5)461
- communications,
23(2)141,
25(4)410,
30(3)254,
31(4)296,
31(5)474,
32(2)162,
32(3)252,
32(3)267
- complete,
24(2)143,
25(2)227,
27(2)184,
32(3)220,
32(5)422
- complexity,
25(1)63,
25(3)379,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)340,
28(1)5,
28(1)78,
28(5)487,
28(5)496,
29(2)103,
29(2)161,
29(2)176,
29(2)182,
29(4)300,
29(4)322,
29(4)330,
29(5)451,
30(1)43,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)258,
30(3)282,
30(4)308,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(6)490,
31(6)545,
31(6)553,
31(6)561,
31(6)567,
32(4)362,
32(5)474
- computational,
23(2)123,
23(2)187,
26(2)164,
26(3)224,
26(4)293,
26(4)354,
27(1)72,
27(2)135,
27(4)315,
27(4)375,
28(3)335,
28(4)433,
28(5)496,
29(1)76,
29(2)103,
29(2)176,
29(4)322,
29(4)330,
29(4)373,
29(5)467,
30(1)43,
30(1)87,
30(2)176,
30(3)201,
30(3)223,
30(3)233,
30(3)282,
30(4)376,
30(5)433,
31(1)56,
31(1)71,
31(1)83,
31(3)283,
31(6)490,
31(6)545,
31(6)553,
31(6)561,
31(6)567,
32(1)93,
32(4)377,
32(5)453,
32(5)474
- connectivity,
32(3)252
- controller,
24(2)97,
27(3)254
- correctness,
23(1)41,
27(3)230,
29(5)423,
29(6)531,
30(2)168,
30(4)376,
31(3)229,
31(6)503,
32(5)437
- evaluating,
30(3)228
- example,
24(4)320,
25(2)188,
25(4)401,
28(2)97,
30(6)551,
32(1)93,
32(2)98,
32(2)142
- except,
30(5)437,
32(2)122
- exclusion,
30(1)16,
32(1)45
- general,
28(3)343,
30(4)355,
31(5)386,
32(6)533
- global,
25(1)52,
31(2)110
- graph,
23(3)237,
24(1)85,
25(3)338,
25(3)397,
27(1)86,
27(2)165,
28(1)5,
28(1)44,
28(1)78,
28(2)105,
29(6)531,
29(6)553,
30(1)16,
30(1)20,
30(2)128,
30(6)498,
31(1)71,
31(1)76,
31(2)155,
31(3)253,
31(4)304,
31(6)545,
32(1)45,
32(2)175,
32(4)290,
32(5)461,
32(5)474
- knowledge,
26(1)1,
26(3)255,
28(2)112,
28(3)195,
28(3)200,
29(3)241,
29(4)340,
29(5)385,
29(6)572,
30(1)8,
30(3)193,
30(5)404,
31(5)445,
31(6)481,
31(6)525
- local,
23(2)115,
23(3)201,
26(1)15,
28(3)231,
28(3)243,
30(3)193,
30(4)295,
31(3)209,
31(4)296,
32(3)252
- make,
31(3)243
- may,
24(4)320,
26(3)235,
31(3)243,
32(2)108,
32(2)152
- message,
24(1)17,
24(1)56,
25(4)410,
29(2)109,
30(5)437,
30(6)541,
31(4)313,
32(1)13,
32(1)29,
32(4)362
- more,
23(2)142,
28(2)162,
30(5)437,
32(1)13,
32(2)152
- mutual,
30(1)16,
32(1)45
- need,
28(2)97,
28(3)203,
30(5)437,
31(5)391,
31(5)420,
31(5)426,
31(5)431,
32(2)142,
32(4)370,
32(5)461
- number,
24(4)339,
25(1)48,
25(3)388,
25(4)471,
26(2)187,
26(3)224,
26(3)282,
27(4)375,
28(2)179,
29(1)90,
29(4)289,
30(3)214,
30(3)249,
31(1)12,
31(1)76,
32(4)374
- only,
23(2)142,
25(1)52,
30(3)283
- particular,
30(5)437,
32(2)98,
32(2)122,
32(2)162,
32(2)175
- presented,
31(4)296,
32(5)453
- priori,
28(1)5
- process,
23(2)147,
24(1)78,
25(1)7,
25(1)34,
25(1)44,
25(1)116,
25(2)231,
26(1)10,
26(2)113,
26(2)134,
26(3)277,
26(4)381,
27(1)18,
27(4)328,
28(1)73,
28(4)409,
29(2)109,
29(4)373,
29(4)380,
29(5)396,
29(5)423,
29(6)500,
29(6)506,
30(1)20,
30(1)52,
30(2)149,
30(3)201,
30(4)372,
30(5)393,
30(6)487,
30(6)498,
30(6)541,
31(3)201,
31(3)248,
31(4)296,
31(5)426,
32(1)16,
32(1)24,
32(1)45,
32(2)162
- proof,
27(3)230,
28(5)474,
29(1)17,
29(5)404,
29(6)531,
30(4)376,
30(6)507,
32(2)122
- protocol,
25(1)22,
27(1)86,
29(4)289,
31(4)296,
31(5)474,
31(6)496,
32(3)252,
32(3)267,
32(4)362,
32(5)437
- required,
25(4)471,
29(4)289,
31(4)296,
32(1)13
- ring,
28(3)243,
31(5)474
- than,
24(1)95,
24(4)320,
32(1)13,
32(5)461
- there,
30(5)437,
32(2)122,
32(2)162
- topology,
23(3)270,
23(4)324,
25(1)87,
27(3)254,
28(1)5,
31(4)296
- use,
23(2)107,
24(1)95,
25(2)218,
26(1)93,
26(3)235,
28(2)162,
28(3)203,
29(1)52,
29(2)167,
29(4)289,
29(5)430,
30(1)80,
30(3)214,
30(4)362,
30(5)437,
30(5)451,
31(3)243,
31(5)420,
32(2)122,
32(2)152,
32(4)333,
z(z)z
- using,
23(1)41,
23(2)142,
23(4)380,
23(4)381,
24(2)118,
24(3)263,
24(3)271,
24(4)295,
24(4)324,
25(1)63,
25(1)84,
26(2)113,
26(4)344,
28(2)112,
28(4)409,
28(4)414,
29(2)118,
29(2)176,
29(2)182,
29(3)201,
29(5)423,
29(6)564,
30(1)87,
30(2)176,
30(4)298,
30(4)343,
30(5)437,
30(6)541,
31(3)201,
31(3)269,
31(6)525,
31(6)567,
31(6)570,
32(2)142,
32(3)273,
32(4)341,
32(5)470
- verification,
24(2)139,
30(1)27,
30(3)223,
30(3)228,
30(3)233,
30(3)239,
31(1)17,
31(6)490,
31(6)503
- which,
23(2)142,
24(4)320,
29(3)201,
30(3)214,
30(5)437,
31(3)243,
31(4)296,
32(1)13,
32(1)45,
32(1)93,
32(2)108,
32(2)122,
32(2)142,
32(2)162,
32(5)461