Garbage collection : algorithms for automatic dynamic memory management
Author(s)
Bibliographic Information
Garbage collection : algorithms for automatic dynamic memory management
Wiley, 1999, c1996
Related Bibliography 1 items
Available at 15 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references (p. [329]-364) and index
"This reprinting has given me the chance to make some small improvements to the book"--P. xxvii.
Description and Table of Contents
Description
Modern software places increasing reliance on dynamic memory allocation, but its direct management is not only notoriously error-prone. Garbage collection eliminates many of these bugs. This reference presents each of the most important algorithms in detail, often with illustrations of its characteristic features and animations of its use.
Table of Contents
The Classical Algorithms.
Reference Counting.
Mark-Sweep Garbage Collection.
Mark-Compact Garbage Collection.
Copying Garbage Collection.
Generational Garbage Collection.
Incremental and Concurrent Garbage Collection.
Garbage Collection for C. Garbage Collection for C++.
Cache-Conscious Garbage Collection.
Distributed Garbage Collection.
Glossary.
Bibliography.
Index.
by "Nielsen BookData"