{"id":"https://openalex.org/W71460633","doi":null,"title":"Automatic parallelization of affine loops using dependence and cache analysis in a binary rewriter","display_name":"Automatic parallelization of affine loops using dependence and cache analysis in a binary rewriter","alternate_titles":[],"publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W71460633","mag":"71460633"},"language":"en","primary_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/14275","doi":null,"is_oa":false,"landing_page_url":"https://drum.lib.umd.edu/bitstreams/02870bc8-db8c-4b0f-8c87-a9fb114dec44/download","pdf_url":null,"source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},"parent_works":[],"lineage":["https://openalex.org/W71460633"],"child_works_count":0,"type":"dissertation","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/A5085569190","display_name":"Aparna Kotha","orcid":"https://orcid.org/0000-0002-8536-1627","observed_orcids":["https://orcid.org/0000-0002-8536-1627"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Aparna Kotha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5085569190"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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/T10904","display_name":"Embedded Systems Design Techniques","score":9.999999747378752e-05,"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/T10481","display_name":"Computer Graphics and Visualization Techniques","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/automatic-parallelization","display_name":"automatic parallelization","score":0.921999990940094},{"id":"https://openalex.org/keywords/binary-rewriting","display_name":"binary rewriting","score":0.9120000004768372},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"affine transformation","score":0.7350000143051147},{"id":"https://openalex.org/keywords/x86","display_name":"x86","score":0.48100000619888306},{"id":"https://openalex.org/keywords/run-time-checks","display_name":"run-time checks","score":0.46000000834465027},{"id":"https://openalex.org/keywords/parallelizing-compilers","display_name":"parallelizing compilers","score":0.3149999976158142},{"id":"https://openalex.org/keywords/loop-nests","display_name":"loop nests","score":0.3400000035762787},{"id":"https://openalex.org/keywords/polybench","display_name":"PolyBench","score":0.6159999966621399},{"id":"https://openalex.org/keywords/scientific-workloads","display_name":"scientific workloads","score":0.4790000021457672}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8696103096008301},{"id":"https://openalex.org/C164833996","wikidata":"https://www.wikidata.org/wiki/Q2323839","display_name":"Automatic parallelization","level":3,"score":0.8173644542694092},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.7487832903862},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.742901086807251},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7356637120246887},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4942064583301544},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.47789108753204346},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.46413370966911316},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4617934226989746},{"id":"https://openalex.org/C27390822","wikidata":"https://www.wikidata.org/wiki/Q320724","display_name":"Dependence analysis","level":2,"score":0.4551635980606079},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4474600553512573},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1253485381603241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drum.lib.umd.edu:1903/14275","doi":null,"is_oa":false,"landing_page_url":"https://drum.lib.umd.edu/bitstreams/02870bc8-db8c-4b0f-8c87-a9fb114dec44/download","pdf_url":null,"source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Dissertation"},{"id":"mag:71460633","doi":null,"is_oa":false,"landing_page_url":"https://drum.lib.umd.edu/handle/1903/14275","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":60,"referenced_works":["https://openalex.org/W1627759","https://openalex.org/W105131483","https://openalex.org/W112818699","https://openalex.org/W150431575","https://openalex.org/W238934872","https://openalex.org/W262467192","https://openalex.org/W764926107","https://openalex.org/W1489781149","https://openalex.org/W1494199306","https://openalex.org/W1494930385","https://openalex.org/W1500590019","https://openalex.org/W1524336136","https://openalex.org/W1524877046","https://openalex.org/W1533186609","https://openalex.org/W1536051636","https://openalex.org/W1537374583","https://openalex.org/W1585630533","https://openalex.org/W1595661905","https://openalex.org/W1600567712","https://openalex.org/W1744486668","https://openalex.org/W1837593827","https://openalex.org/W1887913568","https://openalex.org/W1964354616","https://openalex.org/W1967995061","https://openalex.org/W1969031936","https://openalex.org/W1980999196","https://openalex.org/W1992097886","https://openalex.org/W1994464372","https://openalex.org/W1994742583","https://openalex.org/W2008015263","https://openalex.org/W2014033064","https://openalex.org/W2029707689","https://openalex.org/W2034761517","https://openalex.org/W2038198320","https://openalex.org/W2038831364","https://openalex.org/W2052356107","https://openalex.org/W2056608406","https://openalex.org/W2074559757","https://openalex.org/W2076485607","https://openalex.org/W2078113878","https://openalex.org/W2078526874","https://openalex.org/W2097699872","https://openalex.org/W2099574169","https://openalex.org/W2101304735","https://openalex.org/W2107563064","https://openalex.org/W2108251255","https://openalex.org/W2122056310","https://openalex.org/W2122418911","https://openalex.org/W2139156407","https://openalex.org/W2140418760","https://openalex.org/W2142655718","https://openalex.org/W2143549041","https://openalex.org/W2144471398","https://openalex.org/W2149918819","https://openalex.org/W2152506070","https://openalex.org/W2153185479","https://openalex.org/W2154523940","https://openalex.org/W2159948584","https://openalex.org/W2536491771","https://openalex.org/W3130284250"],"related_works":["https://openalex.org/W2029707689","https://openalex.org/W7100685649","https://openalex.org/W112818699","https://openalex.org/W2107563064","https://openalex.org/W2099574169","https://openalex.org/W612026853","https://openalex.org/W2076517649","https://openalex.org/W2319563510","https://openalex.org/W2204518837","https://openalex.org/W3130699858"],"abstract_inverted_index":{"Today,":[0],"nearly":[1,8],"all":[2,9,84],"general-purpose":[3],"computers":[4],"are":[5,327,338,414,433],"parallel,":[6],"but":[7],"software":[10],"running":[11],"on":[12,115,120,182,262,296,319,443],"them":[13],"is":[14,26,32,55,64,124,129,142,206,232,487],"serial.":[15],"Bridging":[16],"this":[17,351,456],"disconnect":[18],"by":[19,370],"manually":[20],"rewriting":[21],"source":[22,116,286,309,493],"code":[23,117,226,231,494],"in":[24,45,73,138,145,190,212,345,350,381,421],"parallel":[25,66,402],"prohibitively":[27],"expensive.":[28],"Automatic":[29],"parallelization":[30,44,72,154,159,184,470],"technology":[31],"therefore":[33],"an":[34,276,328,473],"attractive":[35],"alternative.":[36],"We":[37,148,166,439],"present":[38,340,354,380,441],"a":[39,46,65,74,78,125,146,161,170,178,203,213,252,263,297,320,342,355,382,451,482],"method":[40,471,480],"to":[41,51,99,105,118,151,156,222,242,247,291,314,341,389,416,489],"perform":[42],"automatic":[43],"binary":[47,53,58,67,75,121,162,179,258,282,295,305,318,432,452,469],"rewriter.":[48],"The":[49,69],"input":[50,293,316],"the":[52,56,62,183,193,209,292,315,360,372,377,401,405,408,417,429,444,459,466,490],"rewriter":[54,76,180,259],"serial":[57,294,317,409],"executable":[59],"program":[60],"and":[61,86,102,133,283,302,306,333,337,397,423,425,454],"output":[63],"executable.":[68],"advantages":[70],"of":[71,192,195,265,273,279,331,404,446,476,484,495],"versus":[77],"compiler":[79,95,111,140],"include":[80],"(i)":[81],"compatibility":[82],"with":[83,287,310,366,453],"compilers":[85],"languages;":[87],"(ii)":[88],"high":[89],"economic":[90],"feasibility":[91],"from":[92,160,251,270,281,285,304,308,431,437,450,492],"avoiding":[93],"repeated":[94],"implementation;":[96],"(iii)":[97],"applicability":[98,104],"legacy":[100],"binaries;":[101],"(iv)":[103],"assembly-language":[106],"programs.":[107,348],"Adapting":[108],"existing":[109,139,153,468],"parallelizing":[110],"methods":[112,155,428],"that":[113,175,198,227,358],"work":[114,119],"programs":[122,269],"instead":[123],"significant":[126],"challenge.":[127],"This":[128,216,486],"primarily":[130],"because":[131],"symbolic":[132],"array":[134],"index":[135],"information":[136],"used":[137,221,241],"parallelizers":[141],"not":[143],"available":[144],"binary.":[147,253],"show":[149],"how":[150],"adapt":[152],"achieve":[157],"equivalent":[158],"without":[163,455],"such":[164],"information.":[165],"have":[167],"also":[168,440],"designed":[169],"affine":[171,225,230,235,419,461],"cache":[172,188,196,217],"reuse":[173,189],"model":[174],"works":[176],"inside":[177],"building":[181],"techniques.":[185],"It":[186,384],"quantifies":[187],"terms":[191],"number":[194,445],"lines":[197],"will":[199],"be":[200,220,240],"required":[201],"when":[202,229],"loop":[204,214,368,373],"dimension":[205],"considered":[207],"for":[208,364],"innermost":[210],"position":[211],"nest.":[215],"metric":[218],"can":[219,239],"reason":[223],"about":[224],"results":[228,442],"transformed":[233],"using":[234,255,375],"transformations.":[236],"Hence,":[237],"it":[238],"evaluate":[243],"candidate":[244],"transformation":[245],"sequences":[246],"improve":[248],"run-time":[249,387],"directly":[250,449],"Results":[254],"our":[256,479],"x86":[257,298,321],"called":[260],"SecondWrite":[261],"suite":[264,272],"dense-":[266],"matrix":[267],"regular":[268,325],"Polybench":[271],"benchmarks":[274,420,462],"shows":[275],"geomean":[277],"speedup":[278,475,483,491],"6.81X":[280],"8.9X":[284],"8":[288,460],"threads":[289,312],"compared":[290,313],"Xeon":[299],"E5530":[300],"machine;":[301],"8.31X":[303],"9.86X":[307],"24":[311],"E7450":[322],"machine.":[323],"Such":[324],"loops":[326,365,447],"important":[329],"component":[330],"scientific":[332],"multi-":[334],"media":[335],"workloads,":[336],"even":[339],"limited":[343],"extent":[344],"otherwise":[346],"non-regular":[347],"Further":[349],"thesis":[352],"we":[353],"novel":[356],"algorithm":[357],"enhances":[359],"past":[361],"techniques":[362,413],"significantly":[363],"unknown":[367],"bounds":[369,374],"guessing":[371],"only":[376],"memory":[378],"expressions":[379],"loop.":[383],"then":[385],"inserts":[386],"checks":[388],"see":[390],"if":[391,398],"these":[392,464],"guesses":[393],"were":[394],"indeed":[395],"correct":[396,399],"executes":[400],"version":[403,410],"loop,":[406],"else":[407],"executes.":[411],"These":[412],"applied":[415],"large":[418],"SPEC2006":[422],"OMP2001":[424],"unlike":[426],"previous":[427],"speedups":[430],"as":[434,436],"good":[435],"source.":[438],"parallelized":[448],"algorithm.":[457],"Among":[458],"among":[463],"suites,":[465],"best":[467],"achieves":[472,481],"geo-mean":[474],"1.33X,":[477],"whereas":[478],"2.96X.":[485],"close":[488],"2.8X.":[496]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W71460633","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
