BIBLIOS

   Sistema de Gestão de Referências Bibliográficas de Ciências

Modo Visitante (Login)
Need help?


Voltar

Detalhes Referência

Tipo
Artigos em Conferência

Tipo de Documento
Artigo Completo

Título
How Hard is Asynchronous Weight Reassignment?

Participantes na publicação
Hasan Heydari (Author)
LASIGE
 Guthemberg Silvestre (Author)
Alysson Bessani (Author)
Dep. Informática
 LASIGE
Resumo
The performance of distributed storage systems deployed on wide-area networks can be improved using weighted (majority) quorum systems instead of their regular variants due to the heterogeneous performance of the nodes. A significant limitation of weighted majority quorum systems lies in their dependence on static weights, which are inappropriate for systems subject to the dynamic nature of networked environments. To overcome this limitation, such quorum systems require mechanisms for reassigning weights over time according to the performance variations. We study the problem of node weight reassignment in asynchronous systems with a static set of servers and static fault threshold. We prove that solving such a problem is as hard as solving consensus, i.e., it cannot be implemented in asynchronous failure-prone distributed systems. This result is somewhat counter-intuitive, given the recent results showing that two related problems -- replica set reconfiguration and asset transfer -- can be solved in asynchronous systems. Inspired by these problems, we present two versions of the problem that contain restrictions on the weights of servers and the way they are reassigned. We propose a protocol to implement one of the restricted problems in asynchronous systems. As a case study, we construct a dynamic-weighted atomic storage based on such a protocol. We also discuss the relationship between weight reassignment and asset transfer problems and compare our dynamic-weighted atomic storage with reconfigurable atomic storage.

Data de Submissão/Pedido
2023-01-21
Data de Aceitação
2023-04-10
Data de Publicação
2023-07

Instituição
FACULDADE DE CIÊNCIAS DA UNIVERSIDADE DE LISBOA

Evento
2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)

Identificadores da Publicação

Local
Hong Kong, Hong Kong

Editora
IEEE

Número de Páginas
11

Identificadores do Documento
DOI - https://doi.org/10.1109/icdcs57875.2023.00038
URL - http://dx.doi.org/10.1109/icdcs57875.2023.00038

Identificadores de Qualidade
CORE A (2023) -

Keywords
—distributedstorage weightedreplication atomic storage asset transfer reconfiguration consensus distributed storage weighted replication

Download

Exportar referência

APA
Hasan Heydari, Guthemberg Silvestre, Alysson Bessani, (2023). How Hard is Asynchronous Weight Reassignment?. 2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS), -

IEEE
Hasan Heydari, Guthemberg Silvestre, Alysson Bessani, "How Hard is Asynchronous Weight Reassignment?" in 2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS), Hong Kong, Hong Kong, 2023, pp. -, doi: 10.1109/icdcs57875.2023.00038

BIBTEX
@InProceedings{59782, author = {Hasan Heydari and Guthemberg Silvestre and Alysson Bessani}, title = {How Hard is Asynchronous Weight Reassignment?}, booktitle = {2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)}, year = 2023, pages = {-}, address = {Hong Kong, Hong Kong}, publisher = {IEEE} }