Abstract
Many solutions have been proposed to tackle the problem of assigning files in a parallel I/O system. The primary objective of the existing solutions is either to balance the load among disks or to minimize the service time variance at each disk, whereas the dynamic characteristics of the file requests which would access these files are ignored. The studies on the dynamic I/O behaviors of applications show that the file requests targeted on the different popular files situated in the same disk may temporally compete with each another for the same disk. Consequently, the performance gained from the parallelism of multiple disks is degraded because this type of I/O contention turns the parallel I/O into sequential one. Hence, how to minimize the I/O contention among the file requests should become one of the new objectives which the file assignment strategy should take into consideration. In order to address this issue, this study proposes a new static file assignment algorithm named MinCP for parallel I/O system. Through assigning files sorted in their access rates onto multiple disks in round-robin fashion, the MinCP aims to minimize the I/O contention probability among file requests, thereby optimizing the mean response time of these requests. The experiment results show that the MinCP achieves optimal performance on mean response time among the existing schemes for comparison.
The work described in this paper is supported by the fund of the National Natural Science Foundation of China under Grant No. 60973007 and No. 61003015, the Doctoral Fund of Ministry of Education of China under Grant No. 20101102110018, and the Fundamental Research Funds for the Central Universities under Grant No. YWF-10-02-058.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Short, J.E., Short, J.E., Bohn, R.E., Baru, C.: How Much Information? 2010 Report on Enterprise Server Information. Technical report, Global Information Industry Center (2011)
Deng, Y.: What is the future of disk drives, death or rebirth? ACM Comput. Surv. 43 (2011)
Isaila, F., Garcia Blas, J., Carretero, J., Latham, R., Ross, R.: Design and Evaluation of Multiple-Level Data Staging for Blue Gene Systems. IEEE Transactions on Parallel and Distributed Systems 22, 946–959 (2011)
Lang, S., et al.: I/O performance challenges at leadership scale. In: SC 2009: Conference on High Performance Computing Networking, Storage and Analysis, pp. 1–12. ACM, New York (2009)
Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H., Patterson, D.A.: RAID: high-performance, reliable secondary storage. ACM Comput. Surv. 26, 145–185 (1994)
Scheuermann, P., Weikum, G., Zabback, P.: Data partitioning and load balancing in parallel disk systems. The VLDB Journal 7, 48–66 (1998)
Dowdy, L.W., Foster, D.V.: Comparative Models of the File Assignment Problem. ACM Comput. Surv. 14, 287–313 (1982)
Lee, L.W., Scheuermann, P., Vingralek, R.: File Assignment in Parallel I/O Systems with Minimal Variance of Service Time. IEEE Transactions on Computers 49, 127–140 (2000)
Xie, T., Sun, Y.: A file assignment strategy independent of workload characteristic assumptions. Trans. Storage 5, 10:1–10:24 (2009)
Zhu, Y., Yu, Y., Wang, W., Tan, S., Low, T.C.: A Balanced Allocation Strategy for File Assignment in Parallel I/O Systems. In: 2010 IEEE Fifth International Conference on Networking, Architecture and Storage (NAS), pp. 257–266 (2010)
Wang, F., Xin, Q., Hong, B., Brandt, S.A., Miller, E.L., Long, D.D.E., Mclarty, T.T.: File System Workload Analysis for Large Scale Scientific Computing Applications. In: 12th NASA Goddard Conference on Mass Storage Systems and Technologies, pp. 139–152 (2004)
Nisar, A., Keng Liao, W., Choudhary, A.: Scaling parallel I/O performance through I/O delegate and caching system. In: SC 2008 International Conference for High Performance Computing, Networking, Storage, pp. 1 –12 (2008)
Feng, D., Zou, Q., Jiang, H., Zhu, Y.: A novel model for synthesizing parallel I/O workloads in scientific applications. In: 2008 IEEE International Conference on Cluster Computing, pp. 252–261 (2008)
Zoll, Q., Zhu, Y., Feng, D.: A study of self-similarity in parallel I/O workloads. In: IEEE / NASA Goddard Conference on Mass Storage Systems and Technologies, pp. 1–6 (2010)
Reddy, A.L.N., Wyllie, J.C.: I/O issues in a multimedia system. Computer 27, 69–74 (1994)
Carretero, J., No, J., Chen, P.: COMPASSION: A parallel I/O Runtime System Including Chunking and Compression for Irregular Applications. In: Ferreira, A., Rolim, J.D.P., Teng, S.-H. (eds.) IRREGULAR 1998. LNCS, vol. 1457, pp. 262–273. Springer, Heidelberg (1998)
Dong, B., et al.: Self-acting load balancing with parallel sub file migration for parallel file system. In: Third International Joint Conference on Computational Science and Optimization, vol. 2, pp. 317–321. IEEE Computer Society, Washington (2010)
Cunha, C., Foster, D.: Characteristics of WWW client-based traces. Technical report, Boston University (1995)
Verma, A., Anand, A.: General store placement for response time minimization in parallel disks. J. Parallel Distrib. Comput. 67, 1286–1300 (2007)
Kwan, T., Mcgrath, R., Reed, D.: Ncsas world wide web server design and performance. Computer 28, 67–74 (1995)
Omnest Global, Inc. (OMNeT++ User Manual for Version 3.2)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dong, B., Li, X., Xiao, L., Ruan, L. (2011). A File Assignment Strategy for Parallel I/O System with Minimum I/O Contention Probability. In: Kim, Th., et al. Grid and Distributed Computing. GDC 2011. Communications in Computer and Information Science, vol 261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27180-9_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-27180-9_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27179-3
Online ISBN: 978-3-642-27180-9
eBook Packages: Computer ScienceComputer Science (R0)