marzullo
| Crates.io | marzullo |
| lib.rs | marzullo |
| version | 0.1.0 |
| source | src |
| created_at | 2024-01-30 15:53:15.140308 |
| updated_at | 2024-01-30 15:53:15.140308 |
| description | Marzullo's algorithm |
| homepage | https://github.com/ahmedtadde/marzullo-rs/ |
| repository | https://github.com/ahmedtadde/marzullo-rs/ |
| max_upload_size | |
| id | 1120386 |
| size | 18,808 |
Ahmed Tadde (ahmedtadde)
documentation
README
marzullo
A Rust implementation of the Marzullo algorithm
Description
Marzullo's algorithm, invented by Keith Marzullo for his Ph.D. dissertation in 1984, is an agreement algorithm used to select sources for estimating accurate time from a number of noisy time sources. NTP uses a modified form of this called the Intersection algorithm, which returns a larger interval for further statistical sampling. However, here we want the smallest interval. Here is a more detailed description of the algorithm
Credits
This is a port of the TigerBeetle implementation done mainly by Joran Dirk Greef and King Protty.
License
Licensed under either of
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
Contribution
- Contributions are welcome! 🙏
- Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.