On the public citation graph
Optimistic Atomic Broadcast
0 signed · 76 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/s004460050032openalex-snapshot
Early consensus in an asynchronous system with a weak failure detector
inferredcites →https://doi.org/10.1109/71.80156openalex-snapshot
A fault-tolerant protocol for atomic broadcast
inferredcites →https://doi.org/10.1109/icdcs.1993.287668openalex-snapshot
Fast message ordering and membership using a logical token-passing ring
inferredcites →https://doi.org/10.1109/icdcs.1996.508021openalex-snapshot
Reducing the cost for non-blocking in atomic commitment
inferredcites →https://doi.org/10.1109/icdcs.1998.679493openalex-snapshot
Efficient ordered broadcasting in reliable CSMA/CD networks
inferredcites →https://doi.org/10.1109/reldis.1995.526218openalex-snapshot
A hierarchy of totally ordered multicasts
inferredcites →https://doi.org/10.1145/128738.128741openalex-snapshot
Ordered and reliable multicast communication
inferredcites →https://doi.org/10.1145/128738.128742openalex-snapshot
Lightweight causal and atomic group multicast
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferredcites →https://doi.org/10.1145/319566.319567openalex-snapshot
On optimistic methods for concurrency control
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11549468_70openalex-snapshot
Consistent Data Replication: Is It Feasible in WANs?
inferred← citeshttps://doi.org/10.1007/11914952_34openalex-snapshot
Towards a Generic Group Communication Service
inferred← citeshttps://doi.org/10.1007/3-540-36087-5_50openalex-snapshot
The GlobData Fault-Tolerant Replicated Distributed Object Database
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_21openalex-snapshot
Scalable Replication in Database Clusters
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_7openalex-snapshot
A Low-Latency Non-blocking Commit Service
inferred← citeshttps://doi.org/10.1007/978-3-319-94289-6_10openalex-snapshot
A Decentralized Sharding Service Network Framework with Scalability
inferred← citeshttps://doi.org/10.1007/978-3-540-30469-2_36openalex-snapshot
Active Replication in CORBA: Standards, Protocols, and Implementation Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-11294-2_13openalex-snapshot
Practical Database Replication
inferred← citeshttps://doi.org/10.1007/978-3-642-27334-6_50openalex-snapshot
Research and Application of Data Synchronization Based on Group Communication Technology
inferred← citeshttps://doi.org/10.1007/978-3-642-45249-9_12openalex-snapshot
HiperTM: High Performance, Fault-Tolerant Transactional Memory
inferred← citeshttps://doi.org/10.1007/s10619-005-4257-4openalex-snapshot
Preventive Replication in a Database Cluster
inferred← citeshttps://doi.org/10.1007/s10723-007-9071-yopenalex-snapshot
Enterprise Grids: Challenges Ahead
inferred← citeshttps://doi.org/10.1016/j.jpdc.2014.10.012openalex-snapshot
Time hybrid total order broadcast: Exploiting the inherent synchrony of broadcast networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.023openalex-snapshot
HiperTM: High performance, fault-tolerant transactional memory
inferred← citeshttps://doi.org/10.1109/2.970581openalex-snapshot
Boosting system performance with optimistic distributed protocols
inferred← citeshttps://doi.org/10.1109/ccgrid.2012.137openalex-snapshot
Optimistic Scheduling with Geographically Replicated Services in the Cloud Environment (COLOR)
inferred← citeshttps://doi.org/10.1109/dsn.2001.941404openalex-snapshot
Distributing trust on the Internet
inferred← citeshttps://doi.org/10.1109/ftdcs.2003.1204289openalex-snapshot
The road to a more configurable and adaptive communication and coordination support
inferred← citeshttps://doi.org/10.1109/gcc.2008.59openalex-snapshot
A Dynamic Fault Tolerant Algorithm Based on Active Replication
inferred← citeshttps://doi.org/10.1109/icdcs.1999.776544openalex-snapshot
Processing transactions over optimistic atomic broadcast protocols
inferred← citeshttps://doi.org/10.1109/icdcs.2002.1022297openalex-snapshot
Improving the scalability of fault-tolerant database clusters
inferred← citeshttps://doi.org/10.1109/icdsc.2001.918963openalex-snapshot
Optimistic active replication
inferred← citeshttps://doi.org/10.1109/icpads.2005.114openalex-snapshot
Consistency Management for Partial Replication in a High Performance Database Cluster
inferred← citeshttps://doi.org/10.1109/nca.2008.52openalex-snapshot
APART: Low Cost Active Replication for Multi-tier Data Acquisition Systems
inferred← citeshttps://doi.org/10.1109/prdc.2000.897283openalex-snapshot
Low cost consensus-based Atomic Broadcast
inferred← citeshttps://doi.org/10.1109/prdc.2006.47openalex-snapshot
On Statistically Estimated Optimistic Delivery in Wide-Area Total Order Protocols
inferred← citeshttps://doi.org/10.1109/reldi.2000.885391openalex-snapshot
Optimistic Virtual Synchrony
inferred← citeshttps://doi.org/10.1109/reldi.2000.885408openalex-snapshot
Database replication techniques: a three parameter classification
inferred← citeshttps://doi.org/10.1109/reldis.2002.1180177openalex-snapshot
An indulgent uniform total order algorithm with optimistic delivery
inferred← citeshttps://doi.org/10.1109/reldis.2002.1180188openalex-snapshot
Optimistic total order in wide area networks
inferred← citeshttps://doi.org/10.1109/rtas52030.2021.00036openalex-snapshot
IGOR: Accelerating Byzantine Fault Tolerance for Real-Time Systems with Eager Execution
inferred← citeshttps://doi.org/10.1109/sbesc.2013.31openalex-snapshot
OB-STM: An Optimistic Approach for Byzantine Fault Tolerance in Software Transactional Memory
inferred← citeshttps://doi.org/10.1109/sbrc.2014.20openalex-snapshot
Dealing with Interactive Transactions in a Byzantine Fault Tolerant STM
inferred← citeshttps://doi.org/10.1109/srds.2006.36openalex-snapshot
PLATO: Predictive Latency-Aware Total Ordering
inferred← citeshttps://doi.org/10.1109/srds.2014.25openalex-snapshot
Optimistic Parallel State-Machine Replication
inferred← citeshttps://doi.org/10.1109/srds.2015.13openalex-snapshot
Ridge: High-Throughput, Low-Latency Atomic Multicast
inferred← citeshttps://doi.org/10.1109/tkde.2003.1209016openalex-snapshot
Using optimistic atomic broadcast in transaction processing systems
inferred← citeshttps://doi.org/10.1109/tkde.2005.54openalex-snapshot
Comparison of database replication techniques based on total order broadcast
inferred← citeshttps://doi.org/10.1109/waina.2012.105openalex-snapshot
A Fast and Robust Optimistic Total Order Broadcast for Online Video Games
inferred← citeshttps://doi.org/10.1109/words.2003.1218063openalex-snapshot
An optimal atomic broadcast protocol and an implementation framework
inferred← citeshttps://doi.org/10.1145/1041680.1041682openalex-snapshot
Total Order Broadcast and Multicast Algorithms : Taxonomy and Survey
inferred← citeshttps://doi.org/10.1145/1141277.1141441openalex-snapshot
From spontaneous total order to uniform total order
inferred← citeshttps://doi.org/10.1145/363951.363955openalex-snapshot
A new approach to developing and implementing eager database replication protocols
inferred← citeshttps://doi.org/10.1587/transinf.e97.d.231openalex-snapshot
Efficient Randomized Byzantine Fault-Tolerant Replication Based on Special Valued Coin Tossing
inferred← citeshttps://doi.org/10.22215/etd/2014-10102openalex-snapshot
A Client-Oriented Solution for Optimistic Replication of Cloud Services
inferred← citeshttps://doi.org/10.3929/ethz-a-004042114openalex-snapshot
Database replication for clusters of workstations
inferred← citeshttps://doi.org/10.47749/t/unicamp.2017.984605openalex-snapshot
The role of synchrony on the performance of Paxos
inferred← citeshttps://doi.org/10.48456/tr-582openalex-snapshot
Latency-optimal Uniform Atomic Broadcast algorithm
inferred← citeshttps://doi.org/10.48456/tr-667openalex-snapshot
Minimizing latency of agreement protocols
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6721openalex-snapshot
Optimistic Parallel State-Machine Replication
inferred← citeshttps://doi.org/10.48550/arxiv.1802.08236openalex-snapshot
NetChain: Scale-Free Sub-RTT Coordination (Extended Version)
inferred← citeshttps://doi.org/10.4995/thesis/10251/11800openalex-snapshot
On the Consistency, Characterization, Adaptability and Integrity of Database Replication Systems
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4241openalex-snapshot
Abstractions for asynchronous distributed computing with malicious players
inferred← citeshttps://doi.org/10.5220/0002915201110120openalex-snapshot
THE OVERHEAD OF SAFE BROADCAST PERSISTENCY
inferred← citeshttps://doi.org/10.5555/3026877.3026914openalex-snapshot
Just say no to paxos overhead: replacing consensus with network ordering
inferred← citeshttps://doi.org/10.5753/wtf.2003.23388openalex-snapshot
Difusão Atômica com Suporte à Perda de Mensagens
inferred← citeshttps://doi.org/10.5753/wtf.2006.23351openalex-snapshot
Analisando o Custo do Armazenamento Tolerante a Faltas Bizantinas: PAXOS x Sistemas de Quóruns
showing the first 62 of 63 · page through all 63
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.