{"id":"https://openalex.org/W2015752544","doi":"https://doi.org/10.1145/1356058.1356071","title":"Prediction and trace compression of data access addresses through nested loop recognition","display_name":"Prediction and trace compression of data access addresses through nested loop recognition","publication_year":2008,"publication_date":"2008-04-06","ids":{"openalex":"https://openalex.org/W2015752544","doi":"https://doi.org/10.1145/1356058.1356071","mag":"2015752544"},"language":"en","primary_location":{"id":"doi:10.1145/1356058.1356071","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1356058.1356071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization","raw_type":"proceedings-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/A5038830275","display_name":"Alain Ketterlin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108417","display_name":"Eurom\u00e9tropole de Strasbourg","ror":"https://ror.org/01t6xjw46","country_code":"FR","type":"other","lineage":["https://openalex.org/I4210108417"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alain Ketterlin","raw_affiliation_strings":["Universit\u00e9 Louis Pasteur, Strasbourg, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Louis Pasteur, Strasbourg, France","institution_ids":["https://openalex.org/I4210108417"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069005561","display_name":"Philippe Clauss","orcid":"https://orcid.org/0000-0002-5759-9195"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philippe Clauss","raw_affiliation_strings":["Universit\u00e9 Louis Pasteur, Strasbourg (France), France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Louis Pasteur, Strasbourg (France), France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0719,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.87769132,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"94","last_page":"103"},"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.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.8314231634140015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7915236353874207},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6611067056655884},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6166603565216064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6059876084327698},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5757433772087097},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4762692153453827},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.4628791809082031},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4614168107509613},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4255136251449585},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13255786895751953},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.12178391218185425}],"concepts":[{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.8314231634140015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7915236353874207},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6611067056655884},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6166603565216064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6059876084327698},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5757433772087097},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4762692153453827},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.4628791809082031},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4614168107509613},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4255136251449585},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13255786895751953},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.12178391218185425},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1356058.1356071","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1356058.1356071","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:inria-00504597v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00504597","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"6th annual IEEE/ACM international symposium on Code generation and optimization, Apr 2008, Boston, United States. pp.94-103, ⟨10.1145/1356058.1356071⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1552966304","https://openalex.org/W1991050699","https://openalex.org/W2002821154","https://openalex.org/W2105686649","https://openalex.org/W2106961628","https://openalex.org/W2108112890","https://openalex.org/W2125346325","https://openalex.org/W2145561364","https://openalex.org/W2145607884","https://openalex.org/W2150376756","https://openalex.org/W3003810083"],"related_works":["https://openalex.org/W24774503","https://openalex.org/W2014821076","https://openalex.org/W2131958170","https://openalex.org/W2061122711","https://openalex.org/W2273754158","https://openalex.org/W4247954915","https://openalex.org/W2336747664","https://openalex.org/W2357130048","https://openalex.org/W2612632602","https://openalex.org/W2321805087"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"an":[3,66,93],"algorithm":[4,67,131],"that":[5,22,157],"takes":[6],"a":[7,10,24,170],"trace":[8,100,164],"(i.e.,":[9],"sequence":[11,25],"of":[12,16,26,45,56,64,80,108,114,172],"numbers":[13],"or":[14],"vectors":[15],"numbers)":[17],"as":[18],"input,":[19,136],"and":[20,49,91,121,166],"from":[21],"produces":[23,32],"loop":[27,57,105,143],"nests":[28,106],"that,":[29],"when":[30],"run,":[31],"exactly":[33],"the":[34,50,104,109,116,130,142,152,173],"original":[35,110],"sequence.":[36],"The":[37,59,96],"input":[38],"format":[39],"is":[40,68,99,119,126,138],"suitable":[41],"for":[42,69,73],"any":[43,74],"kind":[44],"program":[46,70],"execution":[47],"trace,":[48],"output":[51],"conforms":[52],"to":[53,87,140,146],"standard":[54],"models":[55],"nests.":[58],"first,":[60],"most":[61],"obvious,":[62],"use":[63],"such":[65],"behavior":[71,90],"modeling":[72],"measured":[75],"quantity":[76],"(memory":[77],"accesses,":[78],"number":[79],"cache":[81],"misses,":[82],"etc.).":[83],"Finding":[84],"loops":[85,133],"amounts":[86],"detecting":[88],"periodic":[89],"provides":[92],"explanatory":[94],"model.":[95],"second":[97],"application":[98,125],"compression,":[101],"i.e.,":[102],"storing":[103],"instead":[107],"trace.":[111],"Decompression":[112],"consists":[113],"running":[115],"loops,":[117],"which":[118],"easy":[120],"fast.":[122],"A":[123],"third":[124],"value":[127,167],"prediction.":[128],"Since":[129],"forms":[132],"while":[134],"reading":[135],"it":[137],"able":[139],"extrapolate":[141],"under":[144],"construction":[145],"predict":[147],"further":[148],"incoming":[149],"values.":[150],"Throughout":[151],"paper,":[153],"we":[154,162],"provide":[155],"examples":[156],"explain":[158],"our":[159],"algorithms.":[160],"Moreover,":[161],"evaluate":[163],"compression":[165],"prediction":[168],"on":[169],"subset":[171],"SPEC2000":[174],"benchmarks.":[175]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}