On the public citation graph
High Throughput Total Order Broadcast for Cluster Environments
0 signed · 55 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/3-540-51687-5_36openalex-snapshot
Reliable broadcast in synchronous and asynchronous environments (preliminary version)
inferredcites →https://doi.org/10.1007/3-540-60042-6_3openalex-snapshot
A high performance totally ordered multicast protocol
inferredcites →https://doi.org/10.1007/bf01184933openalex-snapshot
Designing broadcasting algorithms in the postal model for message-passing systems
inferredcites →https://doi.org/10.1016/j.jpdc.2005.06.021openalex-snapshot
A classification of total order specifications and its application to fixed sequencer-based implementations
inferredcites →https://doi.org/10.1088/0967-1846/3/1/006openalex-snapshot
Numerical performability evaluation of a group multicast protocol
inferredcites →https://doi.org/10.1088/0967-1846/4/2/003openalex-snapshot
A total ordering protocol using a dynamic token-passing scheme
inferredcites →https://doi.org/10.1088/0967-1846/4/2/005openalex-snapshot
High-performance asynchronous atomic broadcast
inferredcites →https://doi.org/10.1109/2.585156openalex-snapshot
Software-based replication for fault tolerance
inferredcites →https://doi.org/10.1109/71.80156openalex-snapshot
A fault-tolerant protocol for atomic broadcast
inferredcites →https://doi.org/10.1109/71.910870openalex-snapshot
Consensus-based fault-tolerant total order multicast
inferredcites →https://doi.org/10.1109/ftcs.1997.614102openalex-snapshot
A lightweight solution to uniform atomic broadcast for asynchronous systems
inferredcites →https://doi.org/10.1109/hpdc.1997.626423openalex-snapshot
Packing messages as a tool for boosting the performance of total ordering protocols
inferredcites →https://doi.org/10.1109/icccn.2000.885548openalex-snapshot
Contention-aware metrics for distributed algorithms: comparison of atomic broadcast algorithms
inferredcites →https://doi.org/10.1109/icdcs.1995.500032openalex-snapshot
Newtop: a fault-tolerant group communication protocol
inferredcites →https://doi.org/10.1109/icdcs.1996.507992openalex-snapshot
An evaluation of the Amoeba group communication system
inferredcites →https://doi.org/10.1109/icdcs.1996.507999openalex-snapshot
Totally ordered multicast in large-scale systems
inferredcites →https://doi.org/10.1109/mdso.2005.47openalex-snapshot
DREAM: A Component Framework for Constructing Resource-Aware, Configurable Middleware
inferredcites →https://doi.org/10.1109/reldis.1991.145423openalex-snapshot
Ordered broadcasts for large applications
inferredcites →https://doi.org/10.1109/reldis.1995.526218openalex-snapshot
A hierarchy of totally ordered multicasts
inferredcites →https://doi.org/10.1109/reldis.2002.1180177openalex-snapshot
An indulgent uniform total order algorithm with optimistic delivery
inferredcites →https://doi.org/10.1109/reldis.2004.1353003openalex-snapshot
Token-based atomic broadcast using unreliable failure detectors
inferredcites →https://doi.org/10.1137/0222048openalex-snapshot
Asynchronous Fault-Tolerant Total Ordering Algorithms
inferredcites →https://doi.org/10.1145/1041680.1041682openalex-snapshot
Total Order Broadcast and Multicast Algorithms : Taxonomy and Survey
inferredcites →https://doi.org/10.1145/128738.128741openalex-snapshot
Ordered and reliable multicast communication
inferredcites →https://doi.org/10.1145/140901.140903openalex-snapshot
Designing broadcasting algorithms in the postal model for message-passing systems
inferredcites →https://doi.org/10.1145/155332.155333openalex-snapshot
LogP: towards a realistic model of parallel computation
inferredcites →https://doi.org/10.1145/210223.210224openalex-snapshot
The Totem single-ring ordering and membership protocol
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferredcites →https://doi.org/10.1145/37499.37515openalex-snapshot
Exploiting virtual synchrony in distributed systems
inferredcites →https://doi.org/10.1145/41457.37515openalex-snapshot
Exploiting virtual synchrony in distributed systems
inferredcites →https://doi.org/10.1145/65000.65001openalex-snapshot
Preserving and using context information in interprocess communication
inferredcites →https://doi.org/10.1145/7351.7478openalex-snapshot
Reliable communication in the presence of failures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-74466-5_61openalex-snapshot
Modeling and Validating the Performance of Atomic Broadcast Algorithms in High Latency Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-10625-5_48openalex-snapshot
Towards the Integration of Distributed Transactional Memories in Application Servers’ Clusters
inferred← citeshttps://doi.org/10.1007/978-3-642-45065-5_1openalex-snapshot
FastCast: A Throughput- and Latency-Efficient Total Order Broadcast Protocol
inferred← citeshttps://doi.org/10.1016/j.ins.2013.11.024openalex-snapshot
Scalable service-oriented replication with flexible consistency guarantee in the cloud
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.01.007openalex-snapshot
Avoiding disruptive failovers in transaction processing systems with multiple active nodes
inferred← citeshttps://doi.org/10.1109/icdcs.2007.80openalex-snapshot
A High Throughput Atomic Storage Algorithm
inferred← citeshttps://doi.org/10.1109/icmcs.2014.6911263openalex-snapshot
Fixed sequencer ring topology for grid: A group communication system for complex systems in a wide area network
inferred← citeshttps://doi.org/10.1109/radioelek.2015.7129050openalex-snapshot
FSRG an extented version of fixed sequencer ring topology protocol for grid environments
inferred← citeshttps://doi.org/10.1109/srds.2006.36openalex-snapshot
PLATO: Predictive Latency-Aware Total Ordering
inferred← citeshttps://doi.org/10.1109/tdsc.2010.24openalex-snapshot
A Fault-Tolerant Token-Based Atomic Broadcast Algorithm
inferred← citeshttps://doi.org/10.1109/wimob.2009.22openalex-snapshot
Strong Consistency for Shared Objects in Pervasive Grids
inferred← citeshttps://doi.org/10.1145/1363686.1364211openalex-snapshot
Total order broadcast on pervasive systems
inferred← citeshttps://doi.org/10.1145/1449913.1449933openalex-snapshot
Typing communicating component assemblages
inferred← citeshttps://doi.org/10.1145/1529974.1529978openalex-snapshot
A simple totally ordered broadcast protocol
inferred← citeshttps://doi.org/10.1145/1529974.1529980openalex-snapshot
Towards distributed software transactional memory systems
inferred← citeshttps://doi.org/10.1145/1813654.1813656openalex-snapshot
Throughput optimal total order broadcast for cluster environments
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3811openalex-snapshot
Atomic broadcast : a fault-tolerant token based algorithm and performance evaluations
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3999openalex-snapshot
The complexity of reliable distributed storage
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.