Analysis and optimization for RAID small data random access
Zhiqiang Liu · Journal of Computer Applications · 2009
In order to make multiple disks accessible parallelly,the stripe layout is adopted by RAID for high-bandwidth.The approach is appropriate for big sequential data access,but is not that effective for small data random access.This paper analyzed the I/O performance based on RAID Stripe size,explored the IOPS(IOs per second)of multiple user small data access,and proposed a new stripe layout architecture—Thick Granularity Model.The simulation indicates:the I/O performance of Thick Granularity Model has been improved,especially in small data random access.