Buy New

or
Sign in to turn on 1-Click ordering.
or
Amazon Prime free trial required. Sign up when you check out. Learn more
Buy Used
Used - Good See details
Price: £26.95

or
Sign in to turn on 1-Click ordering.
 
   
More Buying Choices
Have one to sell? Sell yours here
or
Get a £11.85 Amazon.co.uk Gift Card
Garbage Collection: Algorithms for Automatic Dynamic Memory Management
 
 
Tell the Publisher!
I’d like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Garbage Collection: Algorithms for Automatic Dynamic Memory Management [Hardcover]

Richard Jones , Rafael Lins
4.0 out of 5 stars  See all reviews (1 customer review)
RRP: £53.99
Price: £45.89 & this item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
You Save: £8.10 (15%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In stock.
Dispatched from and sold by Amazon.co.uk. Gift-wrap available.
Only 5 left in stock--order soon (more on the way).
Want guaranteed delivery by Thursday, May 31? Choose Express delivery at checkout. See Details
‹  Return to Product Overview

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
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Concordance (Learn More)
These are the most frequently used words in this book.
1992  active  address  al  algorithm  allocated  allocation  although  area  between  bits  block  cache  cells  chapter  collection  collector  compiler  contain  copying  cost  count  counting  cycle  data  diagram  distributed  does  either  et  example  field  first  found  free  garbage  generation  generational  graph  grey  heap  however  implementation  languages  large  less  list  mark  marked  marking  may  memory  methods  miss  must  mutator  need  new  next  node  number  objects  order  overhead  page  percent  performance  phase  point  pointer  problem  processor  program  rates  rather  reference  require  root  scan  see  set  should  since  size  small  space  stack  structures  system  table  techniques  time  tospace  two  use  used  value  virtual  word  write 
‹  Return to Product Overview

Amazon.co.uk Privacy Statement Amazon.co.uk Delivery Information Amazon.co.uk Returns & Exchanges