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...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.展开更多
文摘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.
