{"id":"https://openalex.org/W3200928712","doi":"https://doi.org/10.1145/3470639","title":"Study of Fine-grained Nested Parallelism in CDCL SAT Solvers","display_name":"Study of Fine-grained Nested Parallelism in CDCL SAT Solvers","publication_year":2021,"publication_date":"2021-09-20","ids":{"openalex":"https://openalex.org/W3200928712","doi":"https://doi.org/10.1145/3470639","mag":"3200928712"},"language":"en","primary_location":{"id":"doi:10.1145/3470639","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3470639","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","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/A5041185964","display_name":"James Edwards","orcid":"https://orcid.org/0000-0001-6958-5367"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"James Edwards","raw_affiliation_strings":["University of Maryland, Maryland, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":["University of Maryland, Maryland, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041185964"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.2959,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61942351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"8","issue":"3","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9837999939918518,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9811000227928162,"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.8547911643981934},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.8287643194198608},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7599095106124878},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.741609513759613},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6590989828109741},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5478647351264954},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4713204503059387},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16041609644889832}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8547911643981934},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.8287643194198608},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7599095106124878},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.741609513759613},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6590989828109741},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5478647351264954},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4713204503059387},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16041609644889832}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3470639","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3470639","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W37608273","https://openalex.org/W1516239331","https://openalex.org/W1518705996","https://openalex.org/W1526260260","https://openalex.org/W1531103278","https://openalex.org/W1549449731","https://openalex.org/W1824587283","https://openalex.org/W1943061272","https://openalex.org/W1978680929","https://openalex.org/W1989075136","https://openalex.org/W2010432227","https://openalex.org/W2011367000","https://openalex.org/W2016618697","https://openalex.org/W2020169768","https://openalex.org/W2028695183","https://openalex.org/W2032404535","https://openalex.org/W2034599902","https://openalex.org/W2035289314","https://openalex.org/W2039199175","https://openalex.org/W2045183833","https://openalex.org/W2049271502","https://openalex.org/W2057361103","https://openalex.org/W2062273873","https://openalex.org/W2087977509","https://openalex.org/W2102791214","https://openalex.org/W2106952705","https://openalex.org/W2131719221","https://openalex.org/W2142785340","https://openalex.org/W2151720296","https://openalex.org/W2152993997","https://openalex.org/W2395745052","https://openalex.org/W2467005558","https://openalex.org/W2498324117","https://openalex.org/W2515029334","https://openalex.org/W2623377418","https://openalex.org/W2753837266","https://openalex.org/W2810449204","https://openalex.org/W2913257024","https://openalex.org/W2963562272","https://openalex.org/W2980515223","https://openalex.org/W2990602799","https://openalex.org/W3004473970","https://openalex.org/W3005894550","https://openalex.org/W3021447659","https://openalex.org/W3021594640","https://openalex.org/W3105099412","https://openalex.org/W3161192096","https://openalex.org/W4205190765","https://openalex.org/W4251681643","https://openalex.org/W4301736542"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W1595672120","https://openalex.org/W4230999561","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W2014111643"],"abstract_inverted_index":{"Boolean":[0],"satisfiability":[1],"(SAT)":[2],"is":[3],"an":[4],"important":[5],"performance-hungry":[6],"problem":[7,12,67,86],"with":[8,79],"applications":[9],"in":[10],"many":[11],"domains.":[13],"However,":[14],"most":[15],"work":[16],"on":[17,23],"parallelizing":[18],"SAT":[19,39],"solvers":[20],"has":[21],"focused":[22],"coarse-grained,":[24],"mostly":[25],"embarrassing,":[26],"parallelism.":[27],"Here,":[28],"we":[29,87],"study":[30],"fine-grained":[31],"parallelism":[32],"that":[33,71],"can":[34],"speed":[35],"up":[36,60],"existing":[37],"sequential":[38],"solvers,":[40],"which":[41],"all":[42],"happen":[43],"to":[44,61,81],"be":[45],"of":[46,59,66],"the":[47,55],"so-called":[48],"Conflict-Directed":[49],"Clause":[50],"Learning":[51],"variety.":[52],"We":[53,69],"show":[54],"potential":[56],"for":[57],"speedups":[58],"382\u00d7":[62],"across":[63],"a":[64,82],"variety":[65],"instances.":[68],"hope":[70],"these":[72],"results":[73],"will":[74],"stimulate":[75],"future":[76],"research,":[77],"particularly":[78],"respect":[80],"computer":[83],"architecture":[84],"open":[85],"present.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}