An optimal voting scheme for minimizing the overall communication cost in replicated data management
type: Item
instance of: scholarly article
title: An optimal voting scheme for minimizing the overall communication cost in replicated data management
zbMATH Open document ID: 0855.68029
author: Xuemin Lin
author: M. E. Orlowska
published in: Journal of Parallel and Distributed Computing
publication date: 1996-11-25T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 932241
zbMATH Keywords: quorum consensus methods
zbMATH Keywords: distributed database
MaRDI profile type: Publication
OpenAlex ID: W2093854984
DOI: 10.1006/JPDC.1996.0072
Recommended article: Q4525707
Recommended article: Optimal placement of data replicas in distributed database with majority voting protocol
Recommended article: Optimistic voting for managing replicated data
Recommended article: Database Theory - ICDT 2005
Recommended article: Response time behavior of distributed voting algorithms for managing replicated data
Recommended article: Coordination-Free Byzantine Replication with Minimal Communication Costs
Recommended article: Binary vote assignment on a grid for efficient access of replicated data
description: scientific article; zbMATH DE number 932241