{"id":"https://openalex.org/W2288283395","doi":"https://doi.org/10.1145/2854038.2854056","title":"Trace-based affine reconstruction of codes","display_name":"Trace-based affine reconstruction of codes","publication_year":2016,"publication_date":"2016-02-29","ids":{"openalex":"https://openalex.org/W2288283395","doi":"https://doi.org/10.1145/2854038.2854056","mag":"2288283395"},"language":"en","primary_location":{"id":"doi:10.1145/2854038.2854056","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2854038.2854056","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2854038.2854056","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Symposium on Code Generation and Optimization","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2854038.2854056","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026273204","display_name":"Gabriel Rodr\u00edguez","orcid":"https://orcid.org/0000-0002-0338-3655"},"institutions":[{"id":"https://openalex.org/I11019714","display_name":"Universidade da Coru\u00f1a","ror":"https://ror.org/01qckj285","country_code":"ES","type":"education","lineage":["https://openalex.org/I11019714"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Gabriel Rodr\u00edguez","raw_affiliation_strings":["Universidade da Coru\u00f1a, Spain"],"affiliations":[{"raw_affiliation_string":"Universidade da Coru\u00f1a, Spain","institution_ids":["https://openalex.org/I11019714"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048981543","display_name":"Jos\u00e9 M. Andi\u00f3n","orcid":"https://orcid.org/0000-0002-3689-8508"},"institutions":[{"id":"https://openalex.org/I11019714","display_name":"Universidade da Coru\u00f1a","ror":"https://ror.org/01qckj285","country_code":"ES","type":"education","lineage":["https://openalex.org/I11019714"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jos\u00e9 M. Andi\u00f3n","raw_affiliation_strings":["Universidade da Coru\u00f1a, Spain"],"affiliations":[{"raw_affiliation_string":"Universidade da Coru\u00f1a, Spain","institution_ids":["https://openalex.org/I11019714"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007116603","display_name":"Mahmut Kandemir","orcid":"https://orcid.org/0000-0002-9940-9951"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mahmut T. Kandemir","raw_affiliation_strings":["Pennsylvania State University, USA"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061208587","display_name":"Juan Touri\u00f1o","orcid":"https://orcid.org/0000-0001-9670-1933"},"institutions":[{"id":"https://openalex.org/I11019714","display_name":"Universidade da Coru\u00f1a","ror":"https://ror.org/01qckj285","country_code":"ES","type":"education","lineage":["https://openalex.org/I11019714"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Juan Touri\u00f1o","raw_affiliation_strings":["Universidade da Coru\u00f1a, Spain"],"affiliations":[{"raw_affiliation_string":"Universidade da Coru\u00f1a, Spain","institution_ids":["https://openalex.org/I11019714"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5026273204"],"corresponding_institution_ids":["https://openalex.org/I11019714"],"apc_list":null,"apc_paid":null,"fwci":1.2799,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.77416712,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"139","last_page":"149"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9988999962806702,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8685821890830994},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.6908801794052124},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6380084156990051},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6257530450820923},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.5041414499282837},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4719133675098419},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.43792983889579773},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43644869327545166},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.43524599075317383},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.43015506863594055},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3644751012325287},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3353748917579651}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8685821890830994},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.6908801794052124},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6380084156990051},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6257530450820923},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.5041414499282837},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4719133675098419},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.43792983889579773},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43644869327545166},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.43524599075317383},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.43015506863594055},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3644751012325287},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3353748917579651},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2854038.2854056","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2854038.2854056","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2854038.2854056","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Symposium on Code Generation and Optimization","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2854038.2854056","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2854038.2854056","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2854038.2854056","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Symposium on Code Generation and Optimization","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1849369134","display_name":"CSR: Medium: Collaborative Research: Enabling GPUs as First-Class Computing Engines","funder_award_id":"1409095","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3069185359","display_name":null,"funder_award_id":"TIN2013-42148-P","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4591595925","display_name":null,"funder_award_id":"1213052, 1439021, 1409095, and 1526750","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G495392292","display_name":null,"funder_award_id":"FEDER","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7420919289","display_name":null,"funder_award_id":"FEDER","funder_id":"https://openalex.org/F4320321837","funder_display_name":"Ministerio de Econom\u00eda y Competitividad"},{"id":"https://openalex.org/G7884536840","display_name":null,"funder_award_id":"TIN2013-42148-P","funder_id":"https://openalex.org/F4320321837","funder_display_name":"Ministerio de Econom\u00eda y Competitividad"},{"id":"https://openalex.org/G8137092113","display_name":null,"funder_award_id":"1213052","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321837","display_name":"Ministerio de Econom\u00eda y Competitividad","ror":"https://ror.org/034900433"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2288283395.pdf","grobid_xml":"https://content.openalex.org/works/W2288283395.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W40192171","https://openalex.org/W1552966304","https://openalex.org/W1575008551","https://openalex.org/W1610140055","https://openalex.org/W1737297434","https://openalex.org/W1967869476","https://openalex.org/W1969288309","https://openalex.org/W1980882612","https://openalex.org/W1983412169","https://openalex.org/W2001770111","https://openalex.org/W2002252837","https://openalex.org/W2002821154","https://openalex.org/W2015752544","https://openalex.org/W2016558956","https://openalex.org/W2034761517","https://openalex.org/W2054103475","https://openalex.org/W2054907275","https://openalex.org/W2066132324","https://openalex.org/W2067540437","https://openalex.org/W2102477498","https://openalex.org/W2149590159","https://openalex.org/W2164890169","https://openalex.org/W2166462894","https://openalex.org/W2171006257","https://openalex.org/W3138069548","https://openalex.org/W4239813889"],"related_works":["https://openalex.org/W2136735429","https://openalex.org/W170547082","https://openalex.org/W3110101717","https://openalex.org/W4287647396","https://openalex.org/W3090291499","https://openalex.org/W2361165494","https://openalex.org/W1487545099","https://openalex.org/W3213145857","https://openalex.org/W2142761843","https://openalex.org/W2027653709"],"abstract_inverted_index":{"Complete":[0],"comprehension":[1],"of":[2,10,33,61,133,138,171,195,197,207,213,251],"loop":[3,22,191],"codes":[4,60],"is":[5,121,205],"desirable":[6],"for":[7,161,244],"a":[8,92,108,145,222],"variety":[9],"program":[11],"optimizations.":[12],"Compilers":[13],"perform":[14],"static":[15,215],"code":[16],"analyses":[17],"and":[18,29,40,48,53,209],"transformations,":[19],"such":[20],"as":[21],"tiling":[23],"or":[24,55,71],"memory":[25,101,253],"partitioning,":[26],"by":[27,113,140],"constructing":[28],"manipulating":[30],"formal":[31],"representations":[32],"the":[34,58,69,114,118,124,128,135,172,177,214,225],"source":[35,59],"code.":[36],"Runtime":[37],"systems":[38,174],"observe":[39],"characterize":[41],"application":[42,87],"behavior":[43],"to":[44,68,81,85,96,232],"drive":[45],"resource":[46],"management":[47],"allocation,":[49],"including":[50],"dependence":[51],"detection":[52],"parallelization,":[54],"scheduling.":[56],"However,":[57],"target":[62],"applications":[63],"are":[64,180],"not":[65,154],"always":[66],"available":[67],"compiler":[70],"runtime":[72],"system":[73],"in":[74,117,144,157,200,218],"an":[75,162],"analyzable":[76],"form.":[77],"It":[78,120],"becomes":[79],"necessary":[80],"find":[82,127],"alternate":[83],"ways":[84],"model":[86,176],"behavior.":[88],"This":[89],"paper":[90],"presents":[91],"novel":[93],"mathematical":[94,169],"framework":[95],"rebuild":[97],"loops":[98],"from":[99],"their":[100],"access":[102,115,246],"traces.":[103],"An":[104],"exploration":[105],"engine":[106,125],"traverses":[107],"tree-like":[109],"solution":[110,164,178],"space,":[111],"driven":[112],"strides":[116],"trace.":[119],"guaranteed":[122],"that":[123,186],"will":[126,153],"minimal":[129],"affine":[130],"nest":[131],"capable":[132,206],"reproducing":[134],"observed":[136],"sequence":[137],"accesses":[139],"exploring":[141],"this":[142,158],"space":[143,165,179],"brute":[146],"force":[147],"fashion,":[148],"but":[149],"most":[150],"real":[151],"traces":[152],"be":[155,230,242],"tractable":[156],"way.":[159],"Methods":[160],"efficient":[163,190],"traversal":[166],"based":[167],"on":[168],"properties":[170],"equation":[173],"which":[175],"proposed.":[181],"The":[182,202,237],"experimental":[183],"evaluation":[184],"shows":[185],"these":[187],"strategies":[188],"achieve":[189],"reconstruction,":[192],"processing":[193],"hundreds":[194],"gigabytes":[196],"trace":[198,226,235],"data":[199],"minutes.":[201],"proposed":[203,238],"approach":[204],"correctly":[208],"minimally":[210],"reconstructing":[211],"100%":[212],"control":[216],"parts":[217],"PolyBench/C":[219],"applications.":[220],"As":[221],"side":[223],"effect,":[224],"reconstruction":[227],"process":[228],"can":[229,240],"used":[231,243],"efficiently":[233],"compress":[234],"files.":[236],"tool":[239],"also":[241],"dynamic":[245],"characterization,":[247],"predicting":[248],"over":[249],"99%":[250],"future":[252],"accesses.":[254]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}