1 / 18

Using Transparent Compression to Improve SSD based I/O caches

Using Transparent Compression to Improve SSD based I/O caches. Thanos Makatos, Yannis Klonatos, Mandolis Marazakis, Michail D. Flouris and Angelos Bilas, Eurosys 2010. 이 상 엽. Sequence. Motivation Architecure Implementation Experimental Result Conclusion. Motivation. Memory Hierarchy.

xia
Télécharger la présentation

Using Transparent Compression to Improve SSD based I/O caches

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Using Transparent Compression to Improve SSD based I/O caches Thanos Makatos, Yannis Klonatos, Mandolis Marazakis, Michail D. Flouris and Angelos Bilas, Eurosys 2010 이 상 엽

  2. Sequence • Motivation • Architecure • Implementation • Experimental Result • Conclusion

  3. Motivation • Memory Hierarchy

  4. Motivation • HDD vs SSD vs Who is Winner ? Cost : 97원/GB Cost : 1250원/GB Read : 100 MB/s Read : 277 MB/s Write : 90 MB/s Write : 202 MB/s Capacity : 2 TB Capacity : 160 GB

  5. Motivation • HDD vs SSD vs Cost : 97원/GB Cost : 1250원/GB Read : 100 MB/s Read : 277 MB/s Write : 90 MB/s Write : 202 MB/s Capacity : 2 TB Capacity : 160 GB

  6. Motivation • HDD vs SSD vs Winner !! Cost : 97원/GB Cost : 1250원/GB Read : 100 MB/s Read : 277 MB/s Write : 90 MB/s Cost : 97원/GB Write : 202 MB/s Capacity : 2 TB Read : 277 MB/s Capacity : 160 GB Write : 202 MB/s Capacity : 2 TB

  7. Architecure • Flaz • Adding I/O cache layer • Block Level Compression High Perfomance & High CPU Utilization

  8. Architecure • I/O Path

  9. Implementation • Load-balancing & I/O Request Splitting • Blocks of same large I/O request processed in parallel on all CPUs • All blocks placed on two global queues: (1) read, (2) writes • Reads have priority over writes (blocking operations)

  10. Implementation • Metadata • Block devices operate with fixed-size blocks • fixed-size extent as the physical container for compressed segments • Multiple segments packed in single extent in append-only manner • Need metadata to locate block within extent • Translation metadata split to two levels • Metadata lookup requires additional read I/O • To reduce metadata I/Os we use a metadata cache

  11. Implementation • Read-Modify-Write Overhead • Write of R-M-W → remap on write • Read of R-M-W → extent in RAM • Extent • Allocator : called frequently to replenish the extent pool • Garbage Collector : (cleaner) reclaims space and replenishes list

  12. Experimental Result • TCP-H

  13. Experimental Result • PostMark

  14. Experimental Result • PostMark (Con’t) & SPECsfs

  15. Experimental Result • Extent size & Cleaning cache

  16. Experimental Result • Compression

  17. Conclusion • Trade off • CPU Utilization & I/O Perfomance • Storage Class 가 CPU에 비해 발전속도가 느리므로 향후엔 FLAZ가 유용하게 쓰일 수 있지 않을까?

  18. QnA 질문은 서로가 웃을 수 있게 

More Related