This paper presents a novel mechanism to dynamically re-size and re-distribute stripes on the storage servers in distributed file systems. To put this mechanism to work, the information about logical I/O access on the client side is piggybacked to physical I/O access on the storage server side, for building the relationship between the logical I/O access and physical I/O access. Moreover, this newly presented mechanism supports varying size of stripes on the storage servers to obtain finer concurrency granularity on accessing to data stripes. As a result, the mapping relationship can be utilized to direct stripe re-sizing and re-distributing on the storage servers dynamically for better system performance. Experimental results show that this stripe management mechanism can reduce I/O response time and boost I/O data throughput significantly for applications with complicated access patterns. © 2014 IFIP International Federation for Information Processing.
CITATION STYLE
Liao, J., Xiao, G., Liu, X., & Zhu, L. (2014). Dynamic stripe management mechanism in distributed file systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8707 LNCS, pp. 497–509). Springer Verlag. https://doi.org/10.1007/978-3-662-44917-2_41
Mendeley helps you to discover research relevant for your work.