Leader Election for Replicated Services Using Application Scores

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-25821-3_15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Leader Election Using Loneliness Detection

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2012English

Leader Election Using Modified Heap Tree Method

International Journal of Computer Applications
2012English

Client-Access Protocols for Replicated Services

English

Uniform Leader Election Protocols for Radio Networks

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2002English

Uniform Leader Election Protocols for Radio Networks

2001English

Perpetuities in Fair Leader Election Algorithms

2013English

Uniform Dynamic Self-Stabilizing Leader Election

English

On the Complexity of Universal Leader Election

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2015English

An O(1) RMRs Leader Election Algorithm

2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy