Entry Ben-Ari:1997:DAJ 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{Ben-Ari:1997:DAJ,
  author =       "Mordechai Ben-Ari",
  title =        "Distributed algorithms in {Java}",
  journal =      j-SIGCSE,
  volume =       "29",
  number =       "3",
  pages =        "62--64",
  month =        sep,
  year =         "1997",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/268809.268840",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 18:57:41 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "We show how Java can be used to develop portable
                 implementations of distributed algorithms for class
                 demonstrations and laboratory exploration. The programs
                 can be used in two modes: (a) TCP/IP communications
                 over a net, or (b) applet-to-applet communications on a
                 single HTML page. The latter mode is important during
                 program development and can also be used if your lab
                 malfunctions or for homework assignments. Programs were
                 written for four distributed algorithms: Byzantine
                 generals, Ricart--Agrawala mutual exclusion,
                 Dijkstra--Scholten termination and Chandy-Lamport
                 snapshots.",
  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