Entry Helary:1988:DAM from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

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