Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
An on-the-fly reference counting garbage collector for Java
Autore:
Levanoni, Y; Petrank, E;
Indirizzi:
Microsoft Corp, Redmond, WA 98052 USA Microsoft Corp Redmond WA USA 98052Microsoft Corp, Redmond, WA 98052 USA Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel Technion Israel Inst Technol Haifa Israel IL-32000 L-32000 Haifa, Israel
Titolo Testata:
ACM SIGPLAN NOTICES
fascicolo: 11, volume: 36, anno: 2001,
pagine: 367 - 380
SICI:
1523-2867(200111)36:11<367:AORCGC>2.0.ZU;2-Q
Fonte:
ISI
Lingua:
ENG
Soggetto:
REAL-TIME;
Keywords:
runtime systems; memory management; garbage collection; reference counting;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
43
Recensione:
Indirizzi per estratti:
Indirizzo: Levanoni, Y Microsoft Corp, 1 Microsoft Way, Redmond, WA 98052 USA Microsoft Corp 1 Microsoft Way Redmond WA USA 98052 98052 USA
Citazione:
Y. Levanoni e E. Petrank, "An on-the-fly reference counting garbage collector for Java", ACM SIGPL N, 36(11), 2001, pp. 367-380

Abstract

Reference counting is not naturally suitable for running on multiprocessors. The update of pointers and reference counts requires atomic and synchronized operations. We present a novel reference counting algorithm suitable for a multiprocessor that does not require any synchronized operation in itswrite barrier (not even a compare-and-swap type of synchronization). The algorithm is efficient and may compete with any tracing algorithm. We have implemented our algorithm on SUN's Java Virtual Machine 1.2.2 and ran it on a 4-way IBM Netfinity 8500R server with 550MHz Intel Pentium III Xeon and 2GB of physical memory. It turns out that our algorithm has an extremely low latency and throughput that is comparable to the mark and sweep algorithm used in the original JVM.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 25/01/20 alle ore 19:00:25