{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:58:38Z","timestamp":1648709918641},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2001,12]]},"abstract":"<jats:p> Many problems in Computer Science, especially in Artificial Intelligence, can be formulated as Constraint Satisfaction Problems (CSP). This paper presents a parallel implementation of the Forward-Checking algorithm for solving a binary CSP over finite domains. Its main contribution is to use a simple decomposition strategy in order to distribute dynamically the search tree among machines. The feasibility and benefit of this approach are studied for a Shared Memory model. An implementation is drafted using the new emergent standard OpenMP library for shared memory, thus controlling load balancing. We mainly highlight satisfactory efficiencies without using any tricky load balancing policy. All the experiments were carried out running on the Sillicon Graphics Origin 2000 parallel machine. <\/jats:p>","DOI":"10.1142\/s0129626401000749","type":"journal-article","created":{"date-parts":[[2003,4,22]],"date-time":"2003-04-22T11:43:44Z","timestamp":1051011824000},"page":"487-501","source":"Crossref","is-referenced-by-count":3,"title":["SHARED MEMORY IMPLEMENTATION OF CONSTRAINT SATISFACTION PROBLEM RESOLUTION"],"prefix":"10.1142","volume":"11","author":[{"given":"ZINEB","family":"HABBAS","sequence":"first","affiliation":[{"name":"LITA, Ile du Saulcy, F-57045, Metz Cedex 2, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHA\u00cbL","family":"KRAJECKI","sequence":"additional","affiliation":[{"name":"LERI, BP 1039, F-51687, Reims Cedex 2, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DANIEL","family":"SINGER","sequence":"additional","affiliation":[{"name":"LITA, Ile du Saulcy, F-57045, Metz Cedex 2, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90046-3"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(74)90008-5"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1993.tb00310.x"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322292"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90085-X"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626401000749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:19:28Z","timestamp":1565108368000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626401000749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":6,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2001,12]]}},"alternative-id":["10.1142\/S0129626401000749"],"URL":"https:\/\/doi.org\/10.1142\/s0129626401000749","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}