Gray Code as a De-clustering Scheme for Concurrent Disk Retrieval
C.C. CHANG Institute of APPlied Mathematics, National Chung Hsing University, Taichung, Taiwan 40227, Republic of China
C.Y. CHEN Department of Electronics, Feng Chia University, Taichung, Taiwan 40724, Republic of China
In this paper, we are concerned with the multi-disk data allocation problem for binary files. We shall introduce the concept of de-clustering which is an ideal in dividing a set of data into two groups such that these two groups are similar to each other. We shall also show that the Gray code can be used as a scheme to de-cluster a set of binary records into two disks to facilitate concurrent disk retrieval. We then show that this allocation method is strictly optimal for two-disk systems.