Entry Levanoni:2006:FRC from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                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{Levanoni:2006:FRC,
  author =       "Yossi Levanoni and Erez Petrank",
  title =        "An on-the-fly reference-counting garbage collector for
                 {Java}",
  journal =      j-TOPLAS,
  volume =       "28",
  number =       "1",
  pages =        "1--69",
  month =        jan,
  year =         "2006",
  CODEN =        "ATPSDT",
  DOI =          "http://doi.acm.org/10.1145/1111596.1111597",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Tue Jan 24 05:55:31 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toplas/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  abstract =     "Reference-counting is traditionally considered
                 unsuitable for multiprocessor systems. According to
                 conventional wisdom, the update of reference slots and
                 reference-counts requires atomic or synchronized
                 operations. In this work we demonstrate this is not the
                 case by presenting a novel reference-counting algorithm
                 suitable for a multiprocessor system that does not
                 require any synchronized operation in its write barrier
                 (not even a compare-and-swap type of synchronization).
                 A second novelty of this algorithm is that it allows
                 eliminating a large fraction of the reference count
                 updates, thus, drastically reducing the
                 reference-counting traditional overhead. This article
                 includes a full proof of the algorithm showing that it
                 is safe (does not reclaim live objects) and live
                 (eventually reclaims all unreachable objects).\par

                 We have implemented our algorithm on Sun Microsystems'
                 Java Virtual Machine (JVM) 1.2.2 and ran it on a
                 four-way IBM Netfinity 8500R server with 550-MHz Intel
                 Pentium III Xeon and 2 GB of physical memory. Our
                 results show that the algorithm has an extremely low
                 latency and throughput that is comparable to the
                 stop-the-world mark and sweep algorithm used in the
                 original JVM",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
}

Related entries