A Comparison between Asynchronous Backtracking Pseudocode and its JADEL Implementation

In this paper, a comparison between the pseudocode of a well-known algorithm for solving distributed constraint satisfaction problems and the implementation of such an algorithm in JADEL is given. First, background and motivations behind JADEL development are illustrated. Then, we make a description of the problem and a brief introduction to JADEL. The core of this work consists in the translation of the algorithm pseudocode in JADEL code, which is described in details. Scope of the paper is to evaluate such a translation, in terms of closeness to pseudocode, complexity, amount of code written and performance.