{"id":"https://openalex.org/W4239761968","doi":"https://doi.org/10.1142/s0129626401000749","title":"SHARED MEMORY IMPLEMENTATION OF CONSTRAINT SATISFACTION PROBLEM RESOLUTION","display_name":"SHARED MEMORY IMPLEMENTATION OF CONSTRAINT SATISFACTION PROBLEM RESOLUTION","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W4239761968","doi":"https://doi.org/10.1142/s0129626401000749"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626401000749","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626401000749","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102981580","display_name":"Zineb Habbas","orcid":"https://orcid.org/0000-0002-9398-7072"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ZINEB HABBAS","raw_affiliation_strings":["LITA, Ile du Saulcy, F-57045, Metz Cedex 2, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LITA, Ile du Saulcy, F-57045, Metz Cedex 2, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085266102","display_name":"Micha\u00ebl Krajecki","orcid":"https://orcid.org/0000-0001-8419-1948"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"MICHA\u00cbL KRAJECKI","raw_affiliation_strings":["LERI, BP 1039, F-51687, Reims Cedex 2, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LERI, BP 1039, F-51687, Reims Cedex 2, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073895931","display_name":"Daniel Singer","orcid":"https://orcid.org/0000-0001-5479-2806"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"DANIEL SINGER","raw_affiliation_strings":["LITA, Ile du Saulcy, F-57045, Metz Cedex 2, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LITA, Ile du Saulcy, F-57045, Metz Cedex 2, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6628,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82097792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"04","first_page":"487","last_page":"501"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.974399983882904,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8412425518035889},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.6089109182357788},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5881986021995544},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5848937034606934},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5627822279930115},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5472561120986938},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.496648371219635},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4806598424911499},{"id":"https://openalex.org/keywords/graphics","display_name":"Graphics","score":0.43349918723106384},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4155465364456177},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.41508522629737854},{"id":"https://openalex.org/keywords/distributed-shared-memory","display_name":"Distributed shared memory","score":0.4112076163291931},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3721604347229004},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36205440759658813},{"id":"https://openalex.org/keywords/uniform-memory-access","display_name":"Uniform memory access","score":0.3176031708717346},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.3041214048862457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2375061810016632},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21013879776000977},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.15859460830688477},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1232362687587738},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.11299893260002136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09689754247665405}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8412425518035889},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.6089109182357788},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5881986021995544},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5848937034606934},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5627822279930115},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5472561120986938},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.496648371219635},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4806598424911499},{"id":"https://openalex.org/C21442007","wikidata":"https://www.wikidata.org/wiki/Q1027879","display_name":"Graphics","level":2,"score":0.43349918723106384},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4155465364456177},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.41508522629737854},{"id":"https://openalex.org/C39528615","wikidata":"https://www.wikidata.org/wiki/Q1229610","display_name":"Distributed shared memory","level":5,"score":0.4112076163291931},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3721604347229004},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36205440759658813},{"id":"https://openalex.org/C51290061","wikidata":"https://www.wikidata.org/wiki/Q1936765","display_name":"Uniform memory access","level":4,"score":0.3176031708717346},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.3041214048862457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2375061810016632},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21013879776000977},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.15859460830688477},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1232362687587738},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.11299893260002136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09689754247665405},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626401000749","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626401000749","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.4099999964237213,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2002478775","https://openalex.org/W2043829066","https://openalex.org/W2066252813","https://openalex.org/W2119456262","https://openalex.org/W2135432705","https://openalex.org/W2151720296"],"related_works":["https://openalex.org/W2252314269","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2161128834","https://openalex.org/W2012141606","https://openalex.org/W1550482496","https://openalex.org/W2784687883","https://openalex.org/W2097415053","https://openalex.org/W2102858635","https://openalex.org/W2012694101"],"abstract_inverted_index":{"Many":[0],"problems":[1],"in":[2,6,45],"Computer":[3],"Science,":[4],"especially":[5],"Artificial":[7],"Intelligence,":[8],"can":[9],"be":[10],"formulated":[11],"as":[12],"Constraint":[13],"Satisfaction":[14],"Problems":[15],"(CSP).":[16],"This":[17],"paper":[18],"presents":[19],"a":[20,29,41,65],"parallel":[21,112],"implementation":[22,70],"of":[23,59],"the":[24,50,74,100,107],"Forward-Checking":[25],"algorithm":[26],"for":[27,64,80],"solving":[28],"binary":[30],"CSP":[31],"over":[32],"finite":[33],"domains.":[34],"Its":[35],"main":[36],"contribution":[37],"is":[38,71],"to":[39,47],"use":[40],"simple":[42],"decomposition":[43],"strategy":[44],"order":[46],"distribute":[48],"dynamically":[49],"search":[51],"tree":[52],"among":[53],"machines.":[54],"The":[55],"feasibility":[56],"and":[57],"benefit":[58],"this":[60],"approach":[61],"are":[62],"studied":[63],"Shared":[66],"Memory":[67],"model.":[68],"An":[69],"drafted":[72],"using":[73,93],"new":[75],"emergent":[76],"standard":[77],"OpenMP":[78],"library":[79],"shared":[81],"memory,":[82],"thus":[83],"controlling":[84],"load":[85,96],"balancing.":[86],"We":[87],"mainly":[88],"highlight":[89],"satisfactory":[90],"efficiencies":[91],"without":[92],"any":[94],"tricky":[95],"balancing":[97],"policy.":[98],"All":[99],"experiments":[101],"were":[102],"carried":[103],"out":[104],"running":[105],"on":[106],"Sillicon":[108],"Graphics":[109],"Origin":[110],"2000":[111],"machine.":[113]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}