For a few years, there is some interest about solving distributed problems. Particularly, many contributions have been brought in the resolution of distributed constraint satisfaction problems. Most of works tend to propose asynchronous search algorithms. These are always an adaptation of the backtracking principle well known for resolution of centralized CSP. Few interest has been shown about the spatial complexity of these algorithms and the way they are evaluated. Indeed, most of algorithms in literature use nogoods saving which can imply an exponential spatial complexity in the worst case.