Data striping and reliability aspects in distributed video servers
Cluster Computing
Stripe-cache: an efficient cache scheme for building multimedia oriented RAID system
HCI'07 Proceedings of the 12th international conference on Human-computer interaction: applications and services
| Hi-index | 0.00 |
In this paper, we describe techniques for determining the stripe unit size and the degree of striping for efficient placement of continuous media data on disk arrays. To determine the stripe unit size, we present analytical models that use the server configuration and the workload characteristics to predict the load on the most heavily loaded disk in redundant and non-redundant arrays. We use these models to evaluate the effect of various system parameters on the optimal stripe unit size. We also present procedures for determining the optimal stripe unit size for various design scenarios. We demonstrate that striping a continuous media object across all disks in the array causes the number of clients supported to increase sub-linearly with increase in the number of disks. To maximize the number of clients supported in large arrays, we present a technique that partitions a disk array and stripes each media stream acmss a single partition. Since load imbalance can occur in such partitioned arrays, We present an analytical model to compute the imbalance across partitions, and then describe a procedure for determining a partition size that maximizes the number of clients supported by the array.