• RRP: £59.99
  • You Save: £12.00 (20%)
FREE Delivery in the UK.
Only 1 left in stock (more on the way).
Dispatched from and sold by Amazon.
Gift-wrap available.
Garbage Collection: Algor... has been added to your Basket
+ £2.80 UK delivery
Used: Good | Details
Sold by rbmbooks
Condition: Used: Good
Comment: Used, good: average wear, reasonable shape, may have limited notes and/or highlighting. Delivered in 10-12 business days from the USA. Money-back guarantee.
Trade in your item
Get a £6.43
Gift Card.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Garbage Collection: Algorithms for Automatic Dynamic Memory Management (Computer Science) Hardcover – 12 Jul 1996

See all formats and editions Hide other formats and editions
Amazon Price New from Used from
"Please retry"
£31.29 £26.80
£47.99 FREE Delivery in the UK. Only 1 left in stock (more on the way). Dispatched from and sold by Amazon. Gift-wrap available.

Special Offers and Product Promotions

  • When you trade in £15 or more you’ll receive an additional £5 Amazon.co.uk Gift Card for the next time you spend £10 or more.

Frequently Bought Together

Garbage Collection: Algorithms for Automatic Dynamic Memory Management (Computer Science) + The Garbage Collection Handbook: The Art of Automatic Memory Management (Chapman & Hall/CRC Applied Algorithms and Data Structures Series)
Price For Both: £105.98

Buy the selected items together

Trade In this Item for up to £6.43
Trade in Garbage Collection: Algorithms for Automatic Dynamic Memory Management (Computer Science) for an Amazon Gift Card of up to £6.43, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more

Product details

  • Hardcover: 404 pages
  • Publisher: John Wiley & Sons; 1 edition (12 July 1996)
  • Language: English
  • ISBN-10: 0471941484
  • ISBN-13: 978-0471941484
  • Product Dimensions: 19.7 x 2.9 x 23.9 cm
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Bestsellers Rank: 207,893 in Books (See Top 100 in Books)
  • See Complete Table of Contents

More About the Author

Richard is Professor of Computer Systems in the School of Computing at the University of Kent, Canterbury. He received a B.A. in Mathematics from Oxford University in 1976. He spent a few years teaching at school and college before returning to higher education at the University of Kent, where he has remained ever since, receiving an M.Sc. in Computer Science in 1989. In 1998 Richard co-founded the ACM/SIGPLAN International Symposium on Memory Management, of which he was the inaugural Programme Chair. He has published numerous papers on garbage collection, heap visualisation and electronic publishing, and he regularly sits on the programme committees of leading international conferences. He is a member of the Editorial Board of the journal Software Practice and Experience (Wiley). He was made an Honorary Fellow of the University of Glasgow in 2005 in recognition of his research and scholarship in dynamic memory management, and a Distinguished Scientist of the ACM in 2006.

Richard is the prime author of Garbage Collection: Algorithms for Automatic Dynamic Memory Management, Wiley, 1996. Garbage Collection is the process of automatically recycling unused memory. It is an essential component of all modern programming languages. Since its publication, the book has received huge acclaim:
"The sort of comprehensive engineering manual that is so rare in computing", Gregory V. Wilson, Dr. Dobb's Journal, September, 1997.
"I like the book because of its high standards of scholarship. I put it alongside Knuth's series", Mario Wolzko, Distinguished Engineer, Sun Microsystems Laboratories.

The 1996 book continues to be an excellent introduction to the topic. However, the state of the art has moved on considerably since 1996, and problems that were once considered impossible have now been conquered. Richard was joined by Dr. Tony Hosking (Purdue University) and Prof. Eliot Moss (University of Massachusetts) to write the Garbage Collection Handbook: the Art of Automatic Memory Management, Chapman and Hall, 2011. This book addresses the state of the art. In particular, it covers topics such as parallel, concurrent and real-time garbage collection. It also considers the trickier aspects of implementation such as the interface with the run-time system and support for language-specific features.

The first book (400 pages) took one person 2 years to plan, and 2 years to write. Tony and Richard first hatched the plan for a new book in 2002. A contract was signed with Chapman and Hall in 2007 but the new book (500+ pages) took the three of us more than 3 years to write. I am deeply grateful to my wife Robbie for putting with me while I wrote, and doing so not once but twice!

Richard is married, with three children. In his spare time, he races Dart 18 catamarans.

Product Description

From the Back Cover

The memory storage requirements of complex programs are extremely difficult to manage correctly by hand. A single error may lead to indeterminate and inexplicable program crashes. Worse still, failures are often unrepeatable and may surface only long after the program has been delivered to the customer. The eradication of memory errors typically consumes a substantial amount of development time. And yet the answer is relatively easy – garbage collection; removing the clutter of memory management from module interfaces, which then frees the programmer to concentrate on the problem at hand rather than low–level book–keeping details. For this reason, most modern object–oriented languages such as Smalltalk, Eiffel, Java and Dylan, are supported by garbage collection. Garbage collecting, libraries are even available for such uncooperative languages as C and C++. This book considers how dynamic memory can be recycled automatically to guarantee error–free memory management. There is an abundant but disparate literature on the subject, largely confined to research papers. This book sets out to pool this experience in a single accessible and unified framework. Visit this book′s companion Website for updates, revisions, online gc resources, bibliography and links to more gc sites ′Whatever else Java has accomplished, it has finally brought garbage collection into the mainstream. The efficiency and correctness of garbage collection algorithms is henceforth going to be of concern to hundreds of thousands of programmers; those who really care about this could do no better than to start with Garbage Collection: Algorithms for Automatic Dynamic Memory Management... the sort of comprehensive engineering manual that is so rare in computing.′ Dr Dobb′s Journal

Inside This Book (Learn More)
First Sentence
The chief drawback of copying collectors is the need to divide the available memory into two semi-spaces. Read the first page
Explore More
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

4.5 out of 5 stars
5 star
4 star
3 star
2 star
1 star
See both customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

2 of 2 people found the following review helpful By Amazon Customer on 14 Jun. 2011
Format: Hardcover Verified Purchase
A surprisingly readable text, given the esoteric nature of the subject.

Comprehensive, clear, and interesting.

Not a "must read" for 99.9% of programmers; you won't learn how to better use a garbage-collecting language like Java or C# from reading this book; rather it's a detailed and technical overview of garbage collection techniques.

The organization is a little odd - rather than dealing with GC methods one-at-a-time, the book takes a more "layered" view, first covering a brief overview of all techniques, then covering each in more detail. Combined with some terminological inconsistencies, this makes it awkward to follow at times, requiring some flipping back and forth and manual cross-references. Nonetheless an excellent guide if you're interested enough in the subject to put the effort into following it.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
Format: Hardcover Verified Purchase
I find it hard to write good reviews. This is simply a brilliant book. It does what it says on the cover. It is the definitive book on garbage collection. What I thought I knew was put into a little dot. Well written, comprehensive, complete (so far as I know).

If you are curious about how these things work underneath; this is the book to read.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: 10 reviews
23 of 24 people found the following review helpful
Excellent book 22 Mar. 2003
By Ambika N. Sukla - Published on Amazon.com
Format: Hardcover
Garbage collection is a very interesting and complicated topic. To understand different garbage collection algorithms, one has to go through various research papers published over last 30 years or read the simplified descriptions presented in Java site and Bill Venners artima.com. This book does an excellent job in putting together all these algorithms in a logical order that gives us a chance to understand the different challenges sceintists and programming language authors faced and how the algorithms evolved over the time. The book starts with basic overview and history of commonly known algorithms: Reference counting, Mark and Sweep, and Copying algorithms. It then elaborates each of these algorithms, enumerates their pros and cons, and presents imporvements done by different researchers. After this, the book moves on to advanced algorithms like Generational algorithm and concurrent mark and sweep algorithm. I recommend this book to anyone interested in garbage collection. I haven't seen any other book on this topic. Even for programmers who mostly don't have to worry about GC as it is "automatically" done, this is a good book to understand and appreciate what goes on behind the scenes. Also, knowledge of the concepts in this book will be invaluable in performance tuning.
10 of 10 people found the following review helpful
Category killer 4 May 2007
By Jason Evans - Published on Amazon.com
Format: Hardcover
This book is superb. It is thorough enough that there is little need for a practitioner to read the primary literature, even when contemplating sophisticated garbage collector designs. I remember being intimidated by garbage collection prior to reading this book, but now I am instead enthralled by garbage collection. Given the trend toward automatic memory management in programming languages, I think this book is an increasingly important part of the practicing programmer's library.

The first time I read the book, it seemed a bit repetitive, because the first two chapters provide the basic framework for the rest of the book. As a result, topics such as copying collection are discussed in at least two places. Upon reflection though, I think that there is no better way to organize the book, because there exists no straight path through all of the concepts the book covers.

Over the past eight years I have read portions of this book over and over as I've contemplated garbage collector designs for various software projects. I continue to be surprised at just how well this book meets my needs.
8 of 8 people found the following review helpful
Great book 22 Oct. 2005
By Jos van Roosmalen - Published on Amazon.com
Format: Hardcover
This is really a great book. It's really a must have for people who want to write their own modern virtual machine (like I).

This is simply the only book about Garbage Collection you can get. It's very complete: all GC Algorithmes are covered by this book in depth! All topics are properly introduced it has a nice layout, and offer snippets of pseudocode. It is not really a dry text.

If you want to read scientific papers about Garbage Collectors (like of ACM), it's recommended to read first this book, to get a proper introduction in this topic.
2 of 2 people found the following review helpful
An absolute must 18 Jan. 2007
By A. Malviya - Published on Amazon.com
Format: Hardcover
I'd bought this book for personal reading. Even though I'm not directly into GC algos, I found this book amazingly lucid to read and follow. It has thorough coverage of all the GC algos I've heard of till date.

It goes about explaining the algos with a very broad level view, then goes a little deep, then deeper, so its very easy to follow, and the reader can decide to what extent (s)he wants to understand the algo.

A must have for anybody directly working on GC, or like me, people who develop high performance systems on GC aware languages/platforms. It can help you extract the most out of your platform.
Excellent In-Depth Discussion of GC Algorithms 23 Dec. 2011
By Chrysanthemum Hyphus - Published on Amazon.com
Format: Hardcover Verified Purchase
This is the most thorough and readable tract I could have imagined on the complicated subject of GC. It has an excellent introductory chapter, then a survey chapter on the different algorithms, then some in-depth chapters on each algorithm and their many variants, trade-offs, and histories, all copiously referenced to scholarly literature, and each wrapped up with issues to be considered, and then goes on to special topics, such as concurrency. It uses no particular computer language to describe the details of its algorithms, preferring pseudo-code, which I think is a major benefit. It was easier to me to see what was going on without all of the baggage of language syntax. Every term is defined clearly, and there is a good index and glossary. I can't overstate how well-written it is from a purely English point of view.

While it has had a few minor updates from its original 1996 publication, I would have liked to see a much more extensive refresh. At the time it was published, garbage collection was not mainstream. Java was very new, so the examples, references, and studies refer almost exclusively to functional languages such as Lisp and ML (which require GC to be usable), and to antiquated hardware. Everything in the book is still as relevant now as it was in 1996 (meaning the final draft was probably submitted in 1995, if not earlier), but with Java and .NET in ascendance for over 10 years now, and 64-bit multicore processors with *megabytes* of L2 and even L3 cache now in mainstream personal computers, it would have been even better for me if there were more attention to concurrency now that it is the norm. I could probably count on one hand the number of times the x86 (let alone the x86-64) was mentioned. Scholarly publications on GC did not end in 1996 either.

In conclusion, this is a must-read if one is looking for a well-written, very solid basis in the options for algorithms for GC and the trade-offs of each. The authors spoiled me. They did such a great job laying out the results of so much research for me up to 1996, it just made me wish they could take me all the way to the cutting edge of variants and studies as nicely. The bright side, though, is that after reading this book, I have I've been able to understand anything I've found online since, be it scholarly papers, reference manuals, etc. on this topic, so it succeeded in what I wanted it to do when I ordered it.
Were these reviews helpful? Let us know