Efficient Data Allocation For Broadcast Disk Arrays
In this paper, we study the problem of data allocation in a broadcast environment. We divide this work up into two parts. First, we tackle the task of allocating data to a given number of physical broadcast channels in order to minimize the average wait for a data item. We compare our methods to two popular alternatives called FLAT and VF[superscript K]. Our methods turn out to result in better performance and may be cheaper to compute as well. Second, we apply this allocation work to the optimal design of broadcast disks--logical partitions of a set of data items which result in a skewed broadcast schedule. In this phase, we simultaneously discover a good allocation of data to the disks and the optimal number of disks to use. Experimental results show that our techniques result in near minimal average wait for a data item.