Disk arrays and cyclic orderings (Algebraic system, Logic, Language and Computer Science)

Abstract

These disk array architectures are known as redundant arrays of independent disks (RAID) Minimizing the number of disk operations when writing to consecutive disks leads to cyclic orderings. Using the special bipartite graph H(h;t), Mueller et a1.(2005) gave label in the case of h=1, 2. Adachi and Kikuchi (2015) gave label in the case of h=3. In this paper, we give a new label in the case of h=4 and t=1, in order to investigate infinite family H(4;t). And we obtain a cyclic ordering for the complete bipartite graph K_{36, 36}.