Note on Clocks and Causality - Ordering Events in Distributed Systems via Giridhar Manepalli
Topological sorting is the sorting of vertices of a directed acyclic graph where vertex u appears before vertex v in the final order if there is an edge from u to v. Depending on the graph, there could be multiple orders that honor topological sorting rules
Reference
-
Permalink (
2023.NTE.389) - On
- In Notes
- Tagged data
- From Clocks and Causality - Ordering Events in Distributed Systems
- Edit
| ← Previous | Next → |
| Note on Clocks and Causality - Ordering Events in Distributed Systems via Giridhar Manepalli | Note on Onboarding Peer Executives. via Irrational Exuberance |