19 - 380C lecture 19 Where are we & where we...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 380C lecture 19 Where are we & where we are going Managed languages Dynamic compilation Inlining Garbage collection Opportunity to improve data locality on-the-fly Other opportunities? Why you need to care about workloads Alias analysis Dependence analysis Loop transformations EDGE architectures 1 CS380C Lecture 19 2 Garbage Collection Advantage: Improving Program Locality Xianglong Huang (UT) Stephen M Blackburn (ANU), Kathryn S McKinley (UT) J Eliot B Moss (UMass), Zhenlin Wang (MTU), Perry Cheng (IBM) CS380C Lecture 19 3 Today: Advanced Topics Generational Garbage Collection Copying objects is an opportunity Xianglong Huang (UT), Stephen M Blackburn (ANU), Kathryn S McKinley (UT), J Eliot B Moss (UMass), Zhenlin Wang (MTU), Perry Cheng (IBM), The Garbage Collection Advantage: Improving Program Locality, OOPSLA 2004. CS380C Lecture 19 4 Motivation Memory gap problem OO programs become more popular OO programs exacerbates memory gap problem Automatic memory management Pointer data structures Many small methods Goal: improve OO program locality CS380C Lecture 19 5 Allocation Mechanisms Fast (increment & bounds check) contemporaneous object locality Can't incrementally free & reuse: must free en masse Bump-Pointer CS380C Lecture 19 6 Allocation Mechanisms Fast (increment & bounds check) contemporaneous object locality Can't incrementally free & reuse: must free en masse Bump-Pointer CS380C Lecture 19 7 Allocation Mechanisms Fast (increment & bounds check) contemporaneous object locality Can't incrementally free & reuse: must free en masse Bump-Pointer Free-List Slightly slower (consult list...
View Full Document

This note was uploaded on 03/09/2012 for the course CS 380 taught by Professor Shmat during the Fall '08 term at University of Texas at Austin.

Page1 / 36

19 - 380C lecture 19 Where are we & where we...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online