A dynamic majority determination algorithm for reconfiguration of network partitions

DOI10.1016/0020-0255(88)90017-5zbMATH Open0657.68019OpenAlexW2034023878MaRDI QIDQ1111008FDOQ1111008

Authors: S. H. Smith 

Publication date: 1988

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cstech/616

Recommendations

• A scheme for increasing availability in partitioned replicated databases
• scientific article; zbMATH DE number 4092727
• Reconfigurable distributed storage for dynamic networks
• An algorithm for dynamic data allocation in distributed systems
• A weighted voting algorithm for replicated directories

zbMATH Keywords

data structurespartial replicationnetwork partitioningdynamic votingreconciliationcommunication link failuresconsistency control algorithmmergerecovery control algorithmreplicated filesupdate access

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Theory of operating systems (68N25)

Cites Work

• The serializability of concurrent database updates
• Serializability by Locking
• Concurrency Control and Consistency of Multiple Copies of Data in Distributed Ingres

Cited In (3)

• Title not available (Why is that?)
• A weighted voting algorithm for replicated directories
• A scheme for increasing availability in partitioned replicated databases

Uses Software

• INGRES

This page was built for publication: A dynamic majority determination algorithm for reconfiguration of network partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111008)