Distributed Log-Based Reconciliation

Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this work, we present four distributed algorithms for log-based reconciliation, an important NP-hard problem occurring in CSCW. Our methods remove the classical drawbacks of centralized systems like single point of failure, performance bottleneck and loss of autonomy. The problem is formalized using the Distributed Constraint Satisfaction paradigm (DisCSP). In the worst case, the message passing complexity of our methods ranges from O(p2 ) to O(2p ) in a system of p nodes. Experimental results confirm our theoretical analysis and allow us to establish quality and efficiency trade-off for each method.

• Type: Conference
• Year: 2006
• Where: ECAI
• Authors: Yek Loong Chong, Youssef Hamadi
• Keywords: Artificial Intelligence, Computer Supported Cooperative Work, Constraint Satisfaction Paradigm, ECAI 2006, Important Np-hard Problem