Quantifying the Performance of Garbage Collection vs. Explicit Memory Management
ā¢Download as PPT, PDFā¢
1 likeā¢1,656 views
This talk answers an age-old question: is garbage collection faster/slower/the same speed as malloc/free? We introduce oracular memory management, an approach that lets us measure unaltered Java programs as if they used malloc and free. The result: a good GC can match the performance of a good allocator, but it takes 5X more space. If physical memory is tight, however, conventional garbage collectors suffer an order-of-magnitude performance penalty.
![Explicit Memory Management ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Recommended
More Related Content
What's hot
What's hot (20)
Viewers also liked
Viewers also liked (19)
Similar to Quantifying the Performance of Garbage Collection vs. Explicit Memory Management
Similar to Quantifying the Performance of Garbage Collection vs. Explicit Memory Management (20)
More from Emery Berger
More from Emery Berger (20)
Recently uploaded
Recently uploaded (20)
Quantifying the Performance of Garbage Collection vs. Explicit Memory Management
- 1. Quantifying the Performance of Garbage Collection vs. Explicit Memory Management Matthew Hertz Canisius College Emery Berger University of Massachusetts Amherst
- 11. Comparing Memory Managers BDW Collector Node v = malloc(sizeof(Node)); v->data= malloc(sizeof(NodeData)); memcpy(v->data, old->data, sizeof(NodeData)); free(old->data); v->next = old->next; v->next->prev = v; v->prev = old->prev; v->prev->next = v; free(old); Using GC in C/C++ is easy:
- 12. Comparing Memory Managers BDW Collector Node v = malloc(sizeof(Node)); v->data= malloc(sizeof(NodeData)); memcpy(v->data, old->data, sizeof(NodeData)); free(old->data); v->next = old->next; v->next->prev = v; v->prev = old->prev; v->prev->next = v; free(old); ā¦ ignore calls to free .
- 13. Comparing Memory Managers Lea Allocator Node node = new Node(); node.data = new NodeData(); useNode(node); node = null; ... node = new Node(); ... node.data = new NodeData(); ... Adding malloc/free to Java: not easyā¦
- 14. Comparing Memory Managers Lea Allocator Node node = new Node(); node.data = new NodeData(); useNode(node); node = null; ... node = new Node(); ... node.data = new NodeData(); ... ... where should free be inserted? free(node.data)? free(node)?
- 25. Execution Time for pseudoJBB GC performance can be competitive
- 26. Footprint at Quickest Run GC uses much more memory
- 27. Footprint at Quickest Run GC uses much more memory 1.00 1.38 1.61 5.10 5.66 4.84 7.69 7.09 0.63
- 28. Avg. Relative Cycles and Footprint GC trades space for time
- 29. Javac Paging Performance Much slower in limited physical RAM
- 30. pseudoJBB Paging Performance Lifetime analysis adds little