Horus
From MaRDI portal
Cited in
(16)- Byzantine-resistant total ordering algorithms.
- scientific article; zbMATH DE number 1863380 (Why is no real title available?)
- A modular framework for verifying versatile distributed systems
- Tight bounds for FEC-based reliable multicast
- PlusCal
- PSync
- FiST
- IOzone
- The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
- A brief introduction to distributed systems
- Innovations in computational type theory using Nuprl
- Dynamic load balancing with group communication
- On the interconnection of message passing systems
- A framework for protocol composition in Horus
- Cooperative computing with fragmentable and mergeable groups
- Extensible block-level storage virtualization in cluster-based systems
This page was built for software: Horus
