marzullo 0.1.0

Marzullo's algorithm
Documentation
  • Coverage
  • 18.18%
    2 out of 11 items documented0 out of 5 items with examples
  • Size
  • Source code size: 18.8 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 505.22 kB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 9s Average build duration of successful builds.
  • all releases: 9s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Homepage
  • ahmedtadde/marzullo-rs
    0 0 0
  • crates.io
  • Dependencies
    • —
  • Versions
  • Owners
  • ahmedtadde

marzullo

A Rust implementation of the Marzullo algorithm

License: MIT CI crates.io docs.rs

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

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.