Wire-speed total order

Authors:
Tal Anker;Danny Dolev;Gregory Greenman;Ilya Shnaiderman
Affiliations:
Radlan - a Marvell Company and The Hebrew University of Jerusalem, The School of Engineering and Computer Science, Jerusalem, Israel;The Hebrew University of Jerusalem, The School of Engineering and Computer Science, Jerusalem, Israel;The Hebrew University of Jerusalem, The School of Engineering and Computer Science, Jerusalem, Israel;The Hebrew University of Jerusalem, The School of Engineering and Computer Science, Jerusalem, Israel
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 16
Cited 0

The weakest failure detector for solving consensus

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
An evaluation of flow control in group communication

IEEE/ACM Transactions on Networking (TON)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Group communication specifications: a comprehensive study

ACM Computing Surveys (CSUR)
Solving Agreement Problems with Weak Ordering Oracles

EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Optimistic Atomic Broadcast

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Systems performance measurement on PCI Pamette

FCCM '97 Proceedings of the 5th IEEE Symposium on FPGA-Based Custom Computing Machines
Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocls

HPDC '97 Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing
An Indulgent Uniform Total Order Algorithm with Optimistic Delivery

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Reservation-based totally ordered multicasting

ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Efficient Ordered Brodacasting in Reliable CSMA/CD Networks

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Processing Transactions over Optimistic Atomic Broadcast Protocols

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Data management in a distributed file system for storage area networks

Data management in a distributed file system for storage area networks
Total order broadcast and multicast algorithms: Taxonomy and survey

ACM Computing Surveys (CSUR)
End system optimizations for high-speed TCP

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to boost a system's performance, active state machine replication is frequently used. It employs total ordering service to keep the state of replicas synchronized. In this paper, we present an architecture that enables a drastic increase in the number of ordered transactions in a cluster, using off-the-shelf network equipment. Performance supporting nearly one million ordered transactions per second has been achieved, which substantiates our claim.