Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Andrew W. Appel 3 Department of Computer Science
 

Summary: Andrew W. Appel 3
Department of Computer Science
Princeton University
Princeton, NJ 08544
November 1988
Keywords: garbage collection, dynamic memory allocation, concurrency
Abstract
In a programming environment with both concurrency and automatic
garbage collection, the allocation and initialization of a new record is
a sensitive matter: if it is interrupted halfway through, the allocating
3 Supported in part by NSF Grants DCR­8603453 and CCR­8806121 and by a Digital
Equipment Corp. Faculty Incentive Grant
1

process may be in a state that the garbage collector can't understand. In
particular, the collector won't know which words of the new record have
been initialized and which are meaningless (and unsafe to traverse).
For this reason, parallel implementations usually use a locking or
semaphore mechanism to ensure that allocation is an atomic operation.
The locking significantly adds to the cost of allocation. This paper shows

  

Source: Appel, Andrew W. - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences