Home > Publications > Publikationen

Publikationen

Brinkmann, André;Salzwedel, Kay;Scheideler, Christian:

Compact, adaptive placement schemes for non-uniform distribution requirements.

In: Proc. of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 53-62, Winnipeg, Manitoba, Canada, Aug 11 - 13, 2002

Abstract

In this paper we study the problem of designing compact, adaptive placement schemes for non-uniform distribution requirements. More precisely, we are searching for strategies that are able to distribute a set of objects among a set of servers according to an arbitrary demand distribution. Furthermore, the strategy should allow the computation of the position of an object with low time and space complexity, and it should be able to adapt with a near-minimum amount
of replacements of objects to a changing demand distribution. Previous techniques are only able to handle a part of these requirements. For example, standard hashing techniques can be used to achieve a non-uniform distribution of
objects among a set of servers and the time and space efficient computation of the position of the objects, but they
usually do not adapt well to a changing demand distribution. We present two strategies based on hashing that achieve all of the three goals. Furthermore, we give a list of applications for these strategies demonstrating that they can be used efficiently for distributed data management, web caches, and peer-to-peer networks.

files

paper.pdf



Bibtex

@inproceedings{hniid=372,
author = {Brinkmann, André and Salzwedel, Kay and Scheideler, Christian},
title = {Compact, adaptive placement schemes for non-uniform distribution requirements},
booktitle = {Proc. of the 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA)},
pages = {53-62},
address = {Winnipeg, Manitoba, Canada},
month = {11~-~13~} # aug,
year = {2002},
}

Copy bibTeX to clipboard

Permalink

https://www.hni.uni-paderborn.de/pub/372