Entry Stone:1993:MRO from ieeepardisttech.bib

Last update: Fri Mar 2 02:06:23 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | 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{Stone:1993:MRO,
  author =       "Janice M. Stone and Harold S. Stone and Philip
                 Heidelberger and John Turek",
  title =        "Multiple reservations and the {Oklahoma} update",
  journal =      j-IEEE-PAR-DIST-TECH,
  volume =       "1",
  number =       "4",
  pages =        "58--71",
  month =        nov,
  year =         "1993",
  CODEN =        "IPDTEX",
  DOI =          "https://doi.org/10.1109/88.260295",
  ISSN =         "1063-6552 (print), 1558-1861 (electronic)",
  ISSN-L =       "1063-6552",
  bibdate =      "Fri Apr 11 07:24:28 MDT 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/ieeepardisttech.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "IBM",
  classification = "723; B6120B (Codes); B6150M (Protocols); C6120 (File
                 organisation)C5640 (Protocols)",
  corpsource =   "IBM Thomas J. Watson Res. Center, Yorktown Heights,
                 NY, USA",
  journalabr =   "IEEE Parallel Distrib Technol",
  keywords =     "atomic updates; automatic restart; avoidance; cache;
                 Cache protocols; codes; concurrent codes; data
                 structures; linked lists; livelock; Multiple
                 reservation approach; Multiple reservation registers;
                 multiple reservations; multiple shared variables;
                 Network protocols; nonblocking; Oklahoma update;
                 performance improvement; protocol; protocols; queues;
                 shared data structures; Single-reservation schemes;
                 write access",
  treatment =    "P Practical",
}

Related entries