TY - GEN
T1 - SSD caching to overcome small write problem of disk-based RAID in enterprise environments
AU - Lee, Eunjae
AU - Oh, Yongseok
AU - Lee, Donghee
N1 - Publisher Copyright:
Copyright 2015 ACM.
PY - 2015/4/13
Y1 - 2015/4/13
N2 - Disk-based RAID still prevails in enterprise environments due to its cost-effectiveness, reliability, and maintainability. However, it suffers from parity update overhead, which is generally called small write problem that deteriorates performance significantly for small write requests. Targeting the parity update overhead, our design choice is employing Flash-based SSD cache upon disk-based RAID storage server. Particularly, we use single SSD, which can be purchased in consumer markets, as the caching device. By the way, an SSD has non-negligible failure rate and, thus, reliability may be compromised without appropriate measures to protect data from failure. To insure reliability upon failures while eliminating parity update overhead, we devise an SSD cache management scheme that we refer to as LeavO cache. The LeavO cache keeps not only new data but also old data in SSD cache to postpone parity updates in RAID storage until the old data are discarded for space recycling. By doing so, upon failures, lost data can be recovered with the old data and old parity or new data in the SSD cache. We implement the LeavO cache in a real Linux system and measure the performance of storage server with and without LeavO cache. Also, through mathematical analyses, we compare reliability of the LeavO cache with conventional RAID-0 and -5 configurations. Experimental results and mathematical analyses show that the LeavO cache effectively eliminates much of parity update overhead while providing reliability and maintainability comparable to conventional RAID configurations.
AB - Disk-based RAID still prevails in enterprise environments due to its cost-effectiveness, reliability, and maintainability. However, it suffers from parity update overhead, which is generally called small write problem that deteriorates performance significantly for small write requests. Targeting the parity update overhead, our design choice is employing Flash-based SSD cache upon disk-based RAID storage server. Particularly, we use single SSD, which can be purchased in consumer markets, as the caching device. By the way, an SSD has non-negligible failure rate and, thus, reliability may be compromised without appropriate measures to protect data from failure. To insure reliability upon failures while eliminating parity update overhead, we devise an SSD cache management scheme that we refer to as LeavO cache. The LeavO cache keeps not only new data but also old data in SSD cache to postpone parity updates in RAID storage until the old data are discarded for space recycling. By doing so, upon failures, lost data can be recovered with the old data and old parity or new data in the SSD cache. We implement the LeavO cache in a real Linux system and measure the performance of storage server with and without LeavO cache. Also, through mathematical analyses, we compare reliability of the LeavO cache with conventional RAID-0 and -5 configurations. Experimental results and mathematical analyses show that the LeavO cache effectively eliminates much of parity update overhead while providing reliability and maintainability comparable to conventional RAID configurations.
KW - LeavO cache
KW - RAID
KW - SSD cache
KW - Small write problem
UR - http://www.scopus.com/inward/record.url?scp=84955500729&partnerID=8YFLogxK
U2 - 10.1145/2695664.2695886
DO - 10.1145/2695664.2695886
M3 - Conference contribution
AN - SCOPUS:84955500729
T3 - Proceedings of the ACM Symposium on Applied Computing
SP - 2047
EP - 2053
BT - 2015 Symposium on Applied Computing, SAC 2015
A2 - Shin, Dongwan
PB - Association for Computing Machinery
T2 - 30th Annual ACM Symposium on Applied Computing, SAC 2015
Y2 - 13 April 2015 through 17 April 2015
ER -