Computer Science ›› 2014, Vol. 41 ›› Issue (Z11): 191-194.
Previous Articles Next Articles
WANG Yu,ZHAO Yue-long and HOU Fang
| [1] Patterson D A,Gibson G,Katz R H.A case for redundant arraysof inexpensive disks(RAID)[C]∥Proc.ACM SIGMOD Chicage.USA,June 1988:109-116 [2] Kubiatowicz J,Bindel D,Chen Y,et al.OceanStore:An Architecture for Global-Scale Persistent Store[C]∥Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems(ASPLOS 2000).2000:190-201 [3] Bhagwan R,Kati K,Cheng Y-C,et al.Total recall:System support for automated availability management[C]∥Proc.of ACM/USENIX NSDI’04.2004:337-350 [4] Wu Y,Dimakis A G,Ramchandran K.Deterministic regenera-ting codes for distributed storage[C]∥Allerton Conference on Control,Computing and Communication.Monticello,October 2007 [5] Wang Z,Dimakis A G,Bruck J.Rebuilding for Array Codes in Distributed Storage Systems[C]∥Workshop on the Application of Communication Theory to Emerging Memory Technologies (ACTEMT).Dec.2010 [6] Akhlaghi S,Kiani A,Ghanavati M R.A Fundamental Tradeoff between the download cost and repair bandwidth in distributed Storage systems[C]∥Proceeding of IEEE International Symposium on network Coding (NetCod).Toronto,Jun.2010 [7] Shah N B,Rashmi K V,Kumar P V.A Flexible Class of generating Codes for Distributed Storage[C]∥Proceeding of IEEE International symposium on information theory (ISIT).Austin,Jun.2010:1943-1947 [8] Gaston B,Pujol J.Double Circulate Minimum Storage generating Codes.2010.http://arXiv:1007.2401[cs.IT] [9] Wang Z,Mateescu R,Dimakis A G,et al.Array codes for distributed storage:Results and open problems[J].Information Tehory and Application.ITA,2010 [10] Wu Y.Existence and construction of capacity-achieving network codes for distributed storage[J].Journal on Selected Areas in Communications,2010,28(2):277-288 [11] Li J,Yang S,Wang Xin,et al.Tree structured Data Regeneration in Distributed Storage Systems with Regenerating Codes[C]∥Proceedings of IEEE INFOCOM.2010 [12] Shah N B,Rashmi K V,Kumar P V,et al.Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff[C]∥Allerton Conf..Urbana-Champaign,Sep.2009 [13] Dimakis A G,Godfrey P G,Wainwright M J,et al.Network co-ding for peer-to-peer storage[C]∥Proceeding of INFOCOM.Anchorage,Alaska,May 2007 [14] Wu Y,Dimakis A G,Ramchandran K.Deterministic regenera-ting codes for distributed storage[C]∥Allerton Conference on Control,Computing,and Communication.Monticello,October 2007 [15] Shah N B,Rashmi K V,Kumar P V,et al.Distributed storage codes with repair-by-transfer and non-achievability of interior points on the storage-bandwidth tradeoff[J/OL].http://arxiv.org/abs/1011.236 [16] Wu Y,Dimakis A G,Ramchandran K.Deterministic Regenerating codes for distributed storage[C]∥Proc.Allerton Conf..Urbana-Champaign,Sep.2007 [17] Ramabhadran S,Pasquale J.Analysis of durability in replicated distrusted storage systems[C]∥2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).Atlanta,GA,April 2010:1-12 [18] 王禹,赵跃龙,侯昉.基于副本管理的P2P存储系统的可靠性问题研究[J].华南理工大学学报,2011,39(2):148-152 [19] 王禹,赵跃龙,侯昉,分布式存储系统最小带宽再生码研究[J].小型微型计算机系统,2012,33(8):1710-1714 |
| No related articles found! |
|
||
Home