<- People Behind Informatics


All 0-9 A B C D E F G H I J K L M N O P Q R S T U V W XY Z




 
Garbage Collection
In the mid seventies Dijkstra (together with other authors) introduced two useful abstractions (mutator and collector) to the study of garbage collection (Dijkstra, 1975b). The mutator abstracts the process that performs the computation, including allocation of a new storage cell. The collector is the process that automatically reclaims garbage. Furthermore this paper gives a formalization of “tri-color marking” that is basic to incremental garbage collection. Although the garbage collection algorithm developed in this paper is not necessarily the most efficient one, it has been generally accepted to be correct, an important feature not all garbage collectors can claim. A number of other garbage collection algorithms have been shown to be isomorphic to the tri-color marking algorithm and thus are also believed to be correct. See also: Automatic memory management including garbage collection [Sources: Edsger W. Dijkstra; on-the-fly garbage collection
Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman; Compilers – Principles, Techniques, and Tools]
 

 

<- People Behind Informatics


Home  |  Top  |  Search  |  Gallery  | Glossary  | Sitemap  |  Making Of  |  Help