PPT-Impact of Data Locality on Garbage Collection in SSDs:

A General Analytical Study Yongkun Li Patrick P C Lee John C S Lui Yinlong Xu The Chinese University of Hong Kong University of Science and Technology of China 1 SSD Storage. How long can I expect the drive to retain my data without needing to plug the drive back in What is Overprovisioning What is Wear Leveling What is Garbage Collection What is Error Correction Code ECC What is Write Amplification Factor WAF What steps from and is going. The First Drives:. Storage Capacity: 3.75 MB. Physical Size: 87.9 ft. 3 . Price for storage: 15,000$/MB. Seek Time: 600 ms. Rotational Speed: 1200 RPM. Platter Specifications. Optimization. Techniques. . Presented by . Preethi Rajaram. CSS 548 Introduction to Compilers . Professor Carol Zander. Fall 2012 . Why?. Processor Speed . -. increasing at a faster rate than the memory speed. CBS Interactive. http://www.apache.org/~billa/oscon2012/. Troubleshooting Slow or Hung Java Applications. Agenda. Tools of the Trade. Case Studies. 2. Tools – Out Of The Box. jinfo. , . jmap. , . jstack. Zhenhua . Guo. , Geoffrey Fox, Mo Zhou. Outline. Introduction. Data Locality and Fairness. Experiments. Conclusions. MapReduce Execution Overview. 3. Google File System. Read input data. Data locality. Zhenhua . Guo. , Geoffrey Fox, Mo Zhou. Outline. Introduction. Analysis of Data Locality. Optimality of Data Locality. Experiments. Conclusions. MapReduce Execution Overview. 3. Google File System. Read input data. CSCI 201L. Jeffrey Miller, Ph.D.. http://www-scf.usc.edu/~csci201. USC CSCI 201L. Outline. USC CSCI 201L. 2. /8. Garbage Collection. Garbage Collection. Java doesn’t require much memory management. •Data Locality –Temporal: if data item needed now, it is likely to be needed again in near future –Spatial: if data item needed now, nearby data likely to be needed in near future • Garbage Collection. It . automatically reclaims memory occupied by objects that are no longer in . use. It frees the programmer from manually dealing with memory . deallocation . The . benefits of garbage . Student: Jack Chang. Introduction. Manual memory management . Memory . bugs. Automatic memory management. We know.... A . program can only use objects that can be found. .. Reference Counting. Reference Count. Zhenhua . Guo. , Geoffrey Fox, Mo Zhou. Outline. Introduction. Analysis of Data Locality. Optimality of Data Locality. Experiments. Conclusions. MapReduce Execution Overview. 3. Google File System. Read input data. Steve Blackburn – Kathryn McKinley. Presented by: Na . Meng. Ulterior Reference Counting:. Throughput vs. Responsiveness. Goal. Better responsiveness (shorter pause time). Better throughput (running time). Zhenhua . Guo. , Geoffrey Fox, Mo Zhou. Outline. Introduction. Data Locality and Fairness. Experiments. Conclusions. MapReduce Execution Overview. 3. Google File System. Read input data. Data locality. Charlie Gracie, Garbage Collection Architect. Charlie_Gracie@ca.ibm.com. @. crgracie. 28 October 2015. What’s in an Object?. Who am I?. I have been working on the IBM J9 Virtual Machine since 2004 and I am currently the .