We introduce a solution for a concurrency control problem which is frequently encountered in practice: in a dynamic system we want that the load on a centralized resource is uniformly distributed among users, offering a predictable performance as long as it is not overloaded. We propose an original solution based on probabilistic assumptions, and we comment early experimental results.
Scalable concurrency control in a dynamic membership
CIUFFOLETTI, AUGUSTO;
2009-01-01
Abstract
We introduce a solution for a concurrency control problem which is frequently encountered in practice: in a dynamic system we want that the load on a centralized resource is uniformly distributed among users, offering a predictable performance as long as it is not overloaded. We propose an original solution based on probabilistic assumptions, and we comment early experimental results.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
