Effectiveness of Garbage Collection in MIT/GNU Scheme

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 figures, 3 tables

Scientific paper

Scheme uses garbage collection for heap memory management. Ideally, garbage collectors should be able to reclaim all dead objects, i.e. objects that will not be used in future. However, garbage collectors collect only those dead objects that are not reachable from any program variable. Dead objects that are reachable from program variables are not reclaimed. In this paper we describe our experiments to measure the effectiveness of garbage collection in MIT/GNU Scheme. We compute the drag time of objects, i.e. the time for which an object remains in heap memory after its last use. The number of dead objects and the drag time together indicate opportunities for improving garbage collection. Our experiments reveal that up to 26% of dead objects remain in memory. The average drag time is up to 37% of execution time. Overall, we observe memory saving potential ranging from 9% to 65%.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Effectiveness of Garbage Collection in MIT/GNU Scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Effectiveness of Garbage Collection in MIT/GNU Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effectiveness of Garbage Collection in MIT/GNU Scheme will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-120541

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.