Construction of Wrapped ρ-Labellings for RAID
Construction of Wrapped ρ-Labellings for RAID作者机构：Department of Information Sciences Toho University 274-8510 Japan
出 版 物：《Journal of Mathematics and System Science》 (数学和系统科学（英文版）)
年 卷 期：2014年第4卷第12期
页 面：750-754页
学科分类：08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）]
主 题：Disk array cluttered ordering ladder ordering the complete graph.
摘 要：The desire to speed up secondary storage systems has lead to the development of redundant arrays of independent disks （RAID） which incorporate redundancy utilizing erasure codes. A ＇cluttered ordering＇ is utilized for designing an effective writing order to a RAID system. Cohen, Colboum and Froncek （2001） gave a cyclic construction of cluttered orderings for the complete graph by utilizing the notion of a ＇wrapped p-labelling＇. Since wrapped p-labellings as cluttered orderings for the complete graph look such as ladders, they are also called as ladder orderings. Cohen and Colboum （2004） gave a characteristic of ladder orderings. In this paper, we give an algorithm in order to generate ladder orderings.
维普期刊数据库