Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Performance evaluation of the fast consistency algorithms in large decentralized systems

Autor
Acosta, J.; Navarro, L.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2004-06
Volum
3036
Pàgina inicial
615
Pàgina final
618
DOI
https://doi.org/10.1007/978-3-540-24685-5_103 Obrir en finestra nova
URL
https://link.springer.com/chapter/10.1007/978-3-540-24685-5_103 Obrir en finestra nova
Resum
Weak consistency algorithms allow us to propagate changes in a large, arbitrary changing storage network in a self-organizing way. These algorithms generate very little traffic overhead. In this paper we evaluate our own weak consistency algorithm, which is called the ”Fast Consistency Algorithm”, and whose main aim is optimizing the propagation of changes introducing a preference for nodes and zones of the network which have greatest demand. We conclude that considering application paramete...
Grup de recerca
CNDS - Xarxes de Computadors i Sistemes Distribuïts

Participants