interval-tree-clock: Interval Tree Clocks

[ data, data-structures, distributed-computing, library, mit ] [ Propose Tags ]

A haskell Implementation of the interval tree clock as described in the paper Interval Tree Clocks: A Logical Clock for Dynamic Systems.

Light on dependencies!

Interval Tree Clocks serve as an alternative to vector clocks, in that clock-carriers may join or enter the system after clock initialization. Therefore it is not required to know beforehand how many actors are carrying clocks in a distributed system.

This is the first package i'm publishing, please don't hesitate to report issues you encounter. Also I did not yet come to use this in production myself.

Thoroughly tested, with both quickcheck and visual debugging in conformance to the paper.

The paper this library is based on is @Almeida, Paulo & Baquero, Carlos & Fonte, Victor. (2008). Interval Tree Clocks: A Logical Clock for Dynamic Systems. 5401. 259-274. 10.1007/978-3-540-92221-6_18.


[Skip to Readme]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.2.0.0 (info)
Dependencies base (>=4.14 && <5) [details]
License MIT
Copyright 2022 Arne Winter
Author Arne Winter
Maintainer 45700009+arnemileswinter@users.noreply.github.com
Category Data, Data Structures, Distributed Computing
Home page https://github.com/arnemileswinter/itc
Bug tracker https://github.com/arnemileswinter/itc/issues
Source repo head: git clone git://github.com/arnemileswinter/itc.git
Uploaded by arnemileswinter at 2022-07-13T11:51:20Z
Distributions NixOS:0.2.0.0
Downloads 65 total (3 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for interval-tree-clock-0.2.0.0

[back to package description]

Interval Tree Clocks

A haskell Implementation of the interval tree clock as described in the paper Interval Tree Clocks: A Logical Clock for Dynamic Systems.

Light on dependencies!

Interval Tree Clocks serve as an alternative to vector clocks, in that clock-carriers may join or enter the system after clock initialization. Therefore it is not required to know beforehand how many actors are carrying clocks in a distributed system.

This is the first package i'm publishing, please don't hesitate to report issues you encounter. Also I did not yet come to use this in production myself.

Thoroughly tested, with both quickcheck and visual debugging in conformance to the paper.

The paper this library is based on is Almeida, Paulo & Baquero, Carlos & Fonte, Victor. (2008). Interval Tree Clocks: A Logical Clock for Dynamic Systems. 5401. 259-274. 10.1007/978-3-540-92221-6_18.