| Abstract |
|---|
| This paper presents a new mechanism for mapping data items onto thestorage devices of a parallel web server. The method is based on careful observation of the effects that limit the performance ofparallel web servers and by studying the access patterns for theseservers. On the basis of these observations a graph theoretic concept isdeveloped and partitioning algorithms are used to allocate the dataitems. The resulting strategy is investigated and compared to othermethods using experiments and typical access patterns from web servers that are in daily use. |
| Contact |
| Reinhard Lueling Dr. Reinhard Lueling ,University of Paderborn ,Department of Computer Science ,Fuerstenallee 11,D-33102 Paderborn ,Germany rl@uni-paderborn.de |