Sciweavers

VEE
2006
ACM
102views Virtualization» more  VEE 2006»
13 years 11 months ago
A stackless runtime environment for a Pi-calculus
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
Frédéric Peschanski, Samuel Hym
VEE
2006
ACM
116views Virtualization» more  VEE 2006»
13 years 11 months ago
Relative factors in performance analysis of Java virtual machines
Many new Java runtime optimizations report relatively small, single-digit performance improvements. On modern virtual and actual hardware, however, the performance impact of an op...
Dayong Gu, Clark Verbrugge, Etienne M. Gagnon
PLDI
2006
ACM
13 years 11 months ago
The Compressor: concurrent, incremental, and parallel compaction
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
Haim Kermany, Erez Petrank
PLDI
2006
ACM
13 years 11 months ago
Free-Me: a static analysis for automatic individual object reclamation
Garbage collection has proven benefits, including fewer memoryrelated errors and reduced programmer effort. Garbage collection, however, trades space for time. It reclaims memory...
Samuel Z. Guyer, Kathryn S. McKinley, Daniel Framp...
RTSS
2006
IEEE
13 years 11 months ago
An Emprical Evaluation of Memory Management Alternatives for Real-Time Java
Memory management is a critical issue for correctness and performance of hard-real time systems. Java environments usually incorporate high-throughput garbage collection algorithm...
Filip Pizlo, Jan Vitek
ISORC
2006
IEEE
13 years 11 months ago
Real-Time Garbage Collection for Java
Automatic memory management or garbage collection greatly simplifies the development of large systems. However, garbage collection is usually not used in real-time systems due to...
Martin Schoeberl
RTA
2007
Springer
13 years 11 months ago
Adjunction for Garbage Collection with Application to Graph Rewriting
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
Dominique Duval, Rachid Echahed, Fréd&eacut...
OOPSLA
2007
Springer
13 years 11 months ago
The transactional memory / garbage collection analogy
This essay presents remarkable similarities between transactional memory and garbage collection. The connections are fascinating in their own right, and they let us better underst...
Dan Grossman
OOPSLA
2007
Springer
13 years 11 months ago
Microphase: an approach to proactively invoking garbage collection for improved performance
To date, the most commonly used criterion for invoking garbage collection (GC) is based on heap usage; that is garbage collection is invoked when the heap or an area inside the he...
Feng Xian, Witawas Srisa-an, Hong Jiang
IWMM
2007
Springer
146views Hardware» more  IWMM 2007»
13 years 11 months ago
Allocation-phase aware thread scheduling policies to improve garbage collection performance
Past studies have shown that objects are created and then die in phases. Thus, one way to sustain good garbage collection efficiency is to have a large enough heap to allow many ...
Feng Xian, Witawas Srisa-an, Hong Jiang