Assignment in Parallel I / O Systems with MinimalVariance of Service


We address the problem of assigning non-partitioned les in a parallel I/O system where the le accesses exhibit Poisson arrival rates and xed service times. We present two new le assignment algorithms based on open queueing networks which aim at simultaneously minimizing simultaneously the load balance across all disks as well as the variance of the service… (More)


3 Figures and Tables