Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICPP.2010.71
Title: FlashCoop: A locality-aware cooperative buffer management for SSD-based storage cluster
Authors: Wei, Q.
Gong, B.
Pathak, S.
Tay, Y.C. 
Keywords: Cooperative buffer
Random write
SSD
Temporal and sequential localities
Issue Date: 2010
Citation: Wei, Q.,Gong, B.,Pathak, S.,Tay, Y.C. (2010). FlashCoop: A locality-aware cooperative buffer management for SSD-based storage cluster. Proceedings of the International Conference on Parallel Processing : 634-643. ScholarBank@NUS Repository. https://doi.org/10.1109/ICPP.2010.71
Abstract: Random writes significantly limit the application of flash-based Solid State Drive (SSD) in enterprise environment due to its poor latency, negative impact on SSD lifetime and high garbage collection overhead. To release above limitations, we propose a locality-aware cooperative buffer scheme referred to as FlashCoop (Flash Cooperation), which leverages free memory of neighboring storage server to buffer writes over high speed network. Both temporal and sequential localities of access pattern are exploited in the design of cooperative buffer management. Leveraging the filtering effect of the cooperative buffer, FlashCoop can efficiently shape the I/O request stream and improve the sequentiality of the write accesses passed to the SSD. FlashCoop has been extensively evaluated under various enterprise workloads. Our benchmark results conclusively demonstrate that FlashCoop can achieve 52.3% performance improvement and 56.5% garbage collection overhead reduction compared to the system without FlashCoop. © 2010 IEEE.
Source Title: Proceedings of the International Conference on Parallel Processing
URI: http://scholarbank.nus.edu.sg/handle/10635/104566
ISBN: 9780769541563
ISSN: 01903918
DOI: 10.1109/ICPP.2010.71
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.