Entry Plouzeau:1992:ECD from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | 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{Plouzeau:1992:ECD,
  author =       "N. Plouzeau and M. Raynal",
  title =        "Elements for a course on the design of distributed
                 algorithms",
  journal =      j-SIGCSE,
  volume =       "24",
  number =       "2",
  pages =        "35--40",
  month =        jun,
  year =         "1992",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/130962.130968",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:19 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "Sequential algorithms design and operating system
                 principles have always been fundamental courses in any
                 computer science curriculum. Protocols are now a well
                 established discipline, and parallelism and concurrency
                 issues are becoming more and more popular in academic
                 courses. Along these guidelines distributed algorithms
                 have now emerged as a proper topic of computer science;
                 studying them demands some prerequisite on algorithms,
                 parallelism and protocols but they cannot themselves be
                 reduced to these three domains. In this paper we
                 present elements for a course on the design of
                 distributed algorithms performing common operating
                 system services. The fundamental aspects of this course
                 lie in teaching the students that no global state can
                 be instantaneously caught because of the asynchronism
                 of the processes and message transmission delays. We
                 state basis problems addressed during the lecture
                 (mutual exclusion, rendezvous implementation, snapshot
                 computation, network traversals and distributed
                 evaluation of predicates) and present how students are
                 faced with distributed problems in practical classes,
                 using a distributed memory parallel machine to
                 implement their solutions.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries