License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CP.2022.39
URN: urn:nbn:de:0030-drops-166685
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16668/
Wang, Jie ;
Chen, Dingding ;
Chen, Ziyu ;
Liu, Xiangshuang ;
Gao, Junsong
Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs
Abstract
Tree-based backtracking search is an important technique to solve Distributed Constraint optimization Problems (DCOPs), where agents cooperatively exhaust the search space by branching on each variable to divide subproblems and reporting the results to their parent after solving each subproblem. Therefore, effectively reusing the historical search results can avoid unnecessary resolutions and substantially reduce the overall overhead. However, the existing caching schemes for asynchronous algorithms cannot be applied directly to synchronous ones, in the sense that child agent reports the lower and upper bound rather than the precise cost of exploration. In addition, the existing caching scheme for synchronous algorithms has the shortcomings of incompleteness and low cache utilization. Therefore, we propose a new caching scheme for tree-based synchronous backtracking search, named Retention Scheme (RS). It utilizes the upper bounds of subproblems which avoid the reuse of suboptimal solutions to ensure the completeness, and deploys a fine-grained cache information unit targeted at each child agent to improve the cache-hit rate. Furthermore, we introduce two new cache replacement schemes to further improve performance when the memory is limited. Finally, we theoretically prove the completeness of our method and empirically show its superiority.
BibTeX - Entry
@InProceedings{wang_et_al:LIPIcs.CP.2022.39,
author = {Wang, Jie and Chen, Dingding and Chen, Ziyu and Liu, Xiangshuang and Gao, Junsong},
title = {{Completeness Matters: Towards Efficient Caching in Tree-Based Synchronous Backtracking Search for DCOPs}},
booktitle = {28th International Conference on Principles and Practice of Constraint Programming (CP 2022)},
pages = {39:1--39:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-240-2},
ISSN = {1868-8969},
year = {2022},
volume = {235},
editor = {Solnon, Christine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16668},
URN = {urn:nbn:de:0030-drops-166685},
doi = {10.4230/LIPIcs.CP.2022.39},
annote = {Keywords: DCOP, Cache, Any-space Algorithms, Complete Search Algorithms}
}
Keywords: |
|
DCOP, Cache, Any-space Algorithms, Complete Search Algorithms |
Collection: |
|
28th International Conference on Principles and Practice of Constraint Programming (CP 2022) |
Issue Date: |
|
2022 |
Date of publication: |
|
23.07.2022 |
Supplementary Material: |
|
Software (Source Code): https://github.com/czy920/RS |