Distributed Scheduling

This simulator provides four distributed algorithms which solve the random distributed log-based reconciliation problem, an important problem occurring in Computer Supported Cooperative Work. The problem is formalized using the Distributed Constraint Satisfaction paradigm. In the worst case, the message passing and time complexities of the algorithms range from O(p^2) to O(2^p) in a system of p nodes.