Optimising the file allocation of parallel Web server online using access patterns

The paper presents a mechanism for mapping data items onto the storage devices of a parallel Web server. The method is based on careful observation of the effects that limit the performance of parallel Web servers and by studying the access patterns for these servers. On the basis of these observations, a graph theoretic concept is developed and partitioning algorithms are used to allocate the data items. The resulting strategy is investigated and compared to other methods using experiments and typical access patterns from Web servers that are in daily use.