A collection of algorithms for Distributed Systems course (winter semesters 2020/21, 2021/22, 2022/23, 2023/24) at Jagiellonian University, Theoretical Computer Science Department.
- Chang-Roberts algorithm
- Peterson (Dolev-Klawe-Rodeh A) algorithm
- Improved Peterson algorithm
- Dolev-Klawe-Rodeh algorithm B
- Simplified Itai-Rodeh algorithm
- Itai-Rodeh algorithm
- Higham-Przytycka algorithm
- Franklin algorithm
- Hirschberg-Sinclair algorithm
- ProbAsFar (Korach-Rotem-Santoro) algorithm
- Higham-Przytycka algorithm
- Peterson algorithm
- Hyperelect algorithm
- Mans orientation algorithm (prelude to Peterson leader election)
- Humblet algorithm
- Yo-Yo algorithm
- Casteigts-Métivier-Robson-Zemmari algorithm
- Chang-Roberts algorithm
- Peterson (Dolev-Klawe-Rodeh A) algorithm
- Improved Peterson algorithm
- Dolev-Klawe-Rodeh algorithm B
- Itai-Rodeh algorithm
- Higham-Przytycka algorithm
- Franklin algorithm
- Hirschberg-Sinclair algorithm
- Stages with feedback (Korach-Rotem-Santoro) algorithm
- Probabilistic Franklin algorithm
- Itai-Rodeh algorithm
- Korach-Moran-Zaks algorithm
- Afek-Gafni B algorithm
- Loui-Matsushita-West algorithm
- Syrotiuk-Pachl algorithm
- Itai-Rodeh algorithm
- Single Bit (Garay-Berman) algorithm
- Phase King (Garay-Berman-Perry) algorithm
- Ben-Or randomized algorithm
- Chor-Coan algorithm
- Gallager-Humblet-Spira algorithm
- Luby algorithm
- Métivier-Robson-Saheb-Djahromi-Zemmari algorithm (C)
- Local Randomized Greedy (Jia-Rajaraman-Suel) algorithm
- Kuhn-Wattenhoffer algorithm
Run example:
go run src/example/synchronized.go 5