A Method of Solving Data Consistency of Disk Array Cache

Abstract:

In order to raise speed of reading data from disk array memory, scientific and technological personnel have introduced cache technology into disk array. Since this technique has been invented, although the efficiency of reading data have been solved, after writing operation of countless times in disk cache, data consistency problem has been prominent expression. Especially in this condition that false of electricity and machine abnormal failure, the consistency of the data is more difficult to guarantee. In this paper, we adopt Non-Volatile RAM (NVRAM) devices to realize that the data will not be lost in disk array cache after power failure. Here we design a kind of new cache organizational structure. We firstly introduce cache structure of two tables (real-time mapping table, backup mapping table) and a cache backup block. Then through these two tables, we can work to recover data through the copy between the two tables in the macroscopic, and in the microscopic through cache backup block can backup the cache data from writing failure. As power failure and system breakdown, we can ensure that data will not easily lose and the original data can recovery after system crash by this technology. Thus it ensures the consistency of the data cache.

• Periodical: Advanced Materials Research (Volumes 532-533)
• Pages: 1172-1176
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.532-533.1172
• Online since: June 2012
• Authors: Wei Wang, Shi Qun Yin
• Keywords: Data Consistency, Data Recovery, Disk Array Cache, NVRAM

References

[1] Mong Qingang, et al. According to CACHE of TIC6416 and outside save the realization of consistency[J]. Journal of Beijing University of Posts and Telecommunications, 2005. 10.

[2] Wang Aiying. Principles of Computer Composition [M]. Beijing: Tsinghua University Press, 2007. 7278-280.

[3] Qin Xin, et al. Reliability Mechanisms for Very Large Storage Systems. The 20th IEEE /11TH NASA Goddard conference on Mass Storage Systems and Technologies. San Diego, CA, April, 2003. 146~156.

DOI: 10.1109/mass.2003.1194851

[4] Hennessy JL. Patterson D A. Computer architecture : a quantitative approach[M]. Beijing: Mechanical Industry Press, (2002).

[5] Varama A, Jacobson Q. Destage algorithms for disk arrays with nonvolatile caches[J]. IEEE Transactions on Computers, 1998, 47(2), p.228—235.

DOI: 10.1109/12.663770

[6] Atul Adya, et al. FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. 5th Symposium on Operating Systems Design and Implementation (OSDI 2009), Boston, MA, December (2009).

DOI: 10.1145/1060289.1060291

[7] Hu Yiming. Nightingale T. Qing Yang RAPID-cache-A reliable and inexpensive write cache for high performance storage systems 2009(03).

DOI: 10.1109/hpca.1999.744364

[8] A. Rowstron, P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. Proc. of ACM SOSP. Alberta, Canada, October 2001, p.188~201.

DOI: 10.1145/502059.502053

[9] Exterme cluster administration toolkit. 2008. http: /xcat. sourceforge. net.

[10] Oliveira F, Patel J. Blutopia: Cluster life-cycle management. Technical Report, RC23784, IBM Research Division Austin Research Laboratory, (2005).

[11] Hibler M, Storller L, Lepreau J, Rieci R, Barb C. Fast, scalable disk imaging with Frisbee. Proc. of the 2003 USENIX Annual Technical Conf. San Antonio, 2010, pp.283-296.

[12] Sapuntzakis C, Brumley D, Chandra R, Zeldovich N, Chow J, Lam MS, Rosanblum M. Virtual appliances for deploying and maintaining software. Proc. of the 17th Large Installation Systems Administration Conf(LISA 2003), Berkeley, 2003, pp.181-194.