{"id":"https://openalex.org/W2526489804","doi":null,"title":"Optimizing threads of computation in constraint logic programs","display_name":"Optimizing threads of computation in constraint logic programs","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2526489804","mag":"2526489804"},"language":"en","primary_location":{"id":"mag:2526489804","doi":null,"is_oa":false,"landing_page_url":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1041551800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5080388693","display_name":"Neelam Soundarajan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neelam Soundarajan","raw_affiliation_strings":["the Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"the Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023992626","display_name":"William E. Pippin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William E. Pippin","raw_affiliation_strings":["the Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"the Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.00419999985024333,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.001500000013038516,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/constraint-logic-programming","display_name":"constraint logic programming","score":0.9829999804496765},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"affine transformation","score":0.6660000085830688},{"id":"https://openalex.org/keywords/recursive-predicates","display_name":"recursive predicates","score":0.5879999995231628},{"id":"https://openalex.org/keywords/clp-r","display_name":"CLP(R)","score":0.8569999933242798},{"id":"https://openalex.org/keywords/compiler-optimization","display_name":"compiler optimization","score":0.6439999938011169},{"id":"https://openalex.org/keywords/code-generation","display_name":"code generation","score":0.7210000157356262}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7833428382873535},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5450915694236755},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5342451930046082},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5095500946044922},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.4832969009876251},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.46518057584762573},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.44118931889533997},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.42534738779067993},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.42216169834136963},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.399308979511261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3855944871902466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3350386619567871},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2526489804","doi":null,"is_oa":false,"landing_page_url":"http://rave.ohiolink.edu/etdc/view?acc_num=osu1041551800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W36998246","https://openalex.org/W76250598","https://openalex.org/W121190113","https://openalex.org/W131326329","https://openalex.org/W1485732691","https://openalex.org/W1523115500","https://openalex.org/W1536163973","https://openalex.org/W1559402073","https://openalex.org/W1570041031","https://openalex.org/W1575515811","https://openalex.org/W1578088218","https://openalex.org/W1586892155","https://openalex.org/W1590854684","https://openalex.org/W1590937195","https://openalex.org/W1605195718","https://openalex.org/W1766332311","https://openalex.org/W1929924547","https://openalex.org/W1979577606","https://openalex.org/W1982482731","https://openalex.org/W2009944560","https://openalex.org/W2017637575","https://openalex.org/W2021473914","https://openalex.org/W2022511338","https://openalex.org/W2023181724","https://openalex.org/W2029753048","https://openalex.org/W2033755422","https://openalex.org/W2060498389","https://openalex.org/W2063727779","https://openalex.org/W2074516823","https://openalex.org/W2077265102","https://openalex.org/W2078404830","https://openalex.org/W2100738443","https://openalex.org/W2105505307","https://openalex.org/W2123396057","https://openalex.org/W2141241317","https://openalex.org/W2168926823","https://openalex.org/W2968743833"],"related_works":["https://openalex.org/W3033590885","https://openalex.org/W2081103684","https://openalex.org/W130690164","https://openalex.org/W1658301820","https://openalex.org/W1496438649","https://openalex.org/W1979577606","https://openalex.org/W7095272001","https://openalex.org/W13638354","https://openalex.org/W7095577493","https://openalex.org/W70302230"],"abstract_inverted_index":{"This":[0],"research":[1],"concentrates":[2],"on":[3,23],"the":[4,41,49,72,82,86,109,122,159,167,170,182,209,222,237,258,268],"optimization":[5,184,260],"of":[6,19,33,43,46,85,95,117,124,132,172,181,234,246,257,261,267],"Constraint":[7],"Logic":[8],"Programming,":[9],"or":[10,40,97],"CLP,":[11],"languages,":[12],"and":[13,48,194,212,216,228,274],"in":[14,36,74,162,249],"particular,":[15,65],"a":[16,44,75,101,118,130,163,186,231,243,280],"significant":[17,53,281],"class":[18,233],"optimizations":[20],"that":[21,58,112,276],"focus":[22],"program":[24,140],"loops.":[25],"\r\nDeclarative":[26],"systems":[27],"represent":[28,108],"loop":[29],"state":[30],"by":[31],"chains":[32,94],"variables,":[34],"whether":[35],"call":[37],"stack":[38],"frames,":[39],"rows":[42],"system":[45,188],"equations,":[47],"time":[50],"costs":[51],"are":[52],"compared":[54],"to":[55,71,91,107,136,139,157,177,207,220,242],"imperative":[56],"languages":[57],"can":[59],"reuse":[60],"variables":[61],"during":[62],"iteration.":[63],"In":[64],"some":[66],"procedures":[67,248],"add":[68,208],"numerical":[69],"constraints":[70],"solver":[73,173],"predictable":[76],"pattern,":[77],"using":[78],"far":[79],"less":[80],"than":[81],"full":[83],"power":[84],"constraint":[87],"solver.":[88],"We":[89,198],"wish":[90],"optimize":[92],"these":[93],"constraints,":[96,263],"threads.":[98],"\r\nWe":[99],"use":[100],"matrix-vector":[102],"pair,":[103],"an":[104,200,265],"affine":[105],"transform,":[106],"incremental":[110],"computation":[111],"occurs":[113],"at":[114],"each":[115],"iteration":[116],"recursive":[119,247],"predicate.":[120],"By":[121],"associativity":[123],"transform":[125],"multiplication,":[126],"we":[127],"may":[128],"compose":[129],"chain":[131],"ground":[133],"transforms":[134],"prior":[135],"their":[137],"application":[138],"variables:":[141],"Tn(\u2026(T1(x\u02dc))\u2026)":[142],"=":[143,146],"(Tnc\u2026cT1)":[144],"x\u02dc":[145],"(Tn":[147],"\u2217\u2026\u2217":[148],"T1)":[149],"x\u02dc.":[150],"The":[151],"accumulated":[152],"composition":[153],"is":[154],"then":[155],"applied":[156],"relate":[158],"procedure":[160],"parameters":[161],"single":[164],"step":[165],"outside":[166],"loop,":[168],"reducing":[169],"number":[171],"calls":[174],"from":[175],"O(n)":[176],"O(1).":[178],"\r\nAn":[179],"implementation":[180,256,278],"thread":[183,238,259],"for":[185,264,283],"CLP":[187,202,235,252,269],"requires":[189],"compile-time":[190],"analysis,":[191,210],"source":[192],"translation,":[193],"specialized":[195],"code":[196,213],"generation.":[197],"modify":[199],"existing":[201],"compiler,":[203],"CLP(":[204,271],"R":[205,272],"),":[206],"translation":[211],"generation":[214],"phases,":[215],"run":[217],"timing":[218],"tests":[219],"determine":[221],"actual":[223],"speedup.":[224],"\r\nThis":[225],"work":[226],"defines":[227],"proves":[229],"correct":[230],"broad":[232],"optimizations,":[236,239],"which":[240],"apply":[241],"wide":[244],"variety":[245],"any":[250],"practical":[251],"language;":[253],"describes":[254],"our":[255],"numeric":[262],"instance":[266],"family,":[270],");":[273],"demonstrates":[275],"this":[277],"achieves":[279],"speedup":[282],"optimized":[284],"programs.":[285]},"counts_by_year":[],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2016-10-07T00:00:00"}