{"id":"https://openalex.org/W2070079053","doi":"https://doi.org/10.1145/2676726.2677010","title":"On Characterizing the Data Access Complexity of Programs","display_name":"On Characterizing the Data Access Complexity of Programs","publication_year":2014,"publication_date":"2014-12-19","ids":{"openalex":"https://openalex.org/W2070079053","doi":"https://doi.org/10.1145/2676726.2677010","mag":"2070079053"},"language":"en","primary_location":{"id":"doi:10.1145/2676726.2677010","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2676726.2677010","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2677010&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2677010&type=pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007976782","display_name":"Venmugil Elango","orcid":"https://orcid.org/0000-0002-7031-9020"},"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":true,"raw_author_name":"Venmugil Elango","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA","The Ohio State University, Columbus, OH, USA.;"],"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA.;","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089282120","display_name":"Fabrice Rastello","orcid":"https://orcid.org/0000-0002-6589-9956"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]},{"id":"https://openalex.org/I4210101348","display_name":"Centre Inria de l'Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/00n8d6z93","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fabrice Rastello","raw_affiliation_strings":["Inria, Grenoble, France","[Inria Grenoble, France]"],"affiliations":[{"raw_affiliation_string":"Inria, Grenoble, France","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210101348","https://openalex.org/I899635006"]},{"raw_affiliation_string":"[Inria Grenoble, France]","institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040769038","display_name":"Louis-No\u00ebl Pouchet","orcid":"https://orcid.org/0000-0001-5103-3097"},"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":"Louis-No\u00ebl Pouchet","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA","The Ohio State University, Columbus, OH, USA.;"],"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA.;","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057117526","display_name":"J. Ramanujam","orcid":"https://orcid.org/0000-0002-4349-1327"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Ramanujam","raw_affiliation_strings":["Louisiana State University, Baton Rouge, LA, USA"],"affiliations":[{"raw_affiliation_string":"Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027517817","display_name":"P. Sadayappan","orcid":"https://orcid.org/0000-0002-4737-2034"},"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":"P. Sadayappan","raw_affiliation_strings":["The Ohio State University, Columbus, OH, USA","The Ohio State University, Columbus, OH, USA.;"],"affiliations":[{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"The Ohio State University, Columbus, OH, USA.;","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5007976782"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":1.8903,"has_fulltext":true,"cited_by_count":27,"citation_normalized_percentile":{"value":0.85883556,"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":"567","last_page":"580"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991999864578247,"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.9991999864578247,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9940999746322632,"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.7570033073425293},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5770539045333862},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5769535899162292},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5373780727386475},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5129474997520447},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4769127070903778},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4722040593624115},{"id":"https://openalex.org/keywords/asymptotic-computational-complexity","display_name":"Asymptotic computational complexity","score":0.45886629819869995},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44369128346443176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3248705565929413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18632495403289795},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.17096048593521118},{"id":"https://openalex.org/keywords/computational-resource","display_name":"Computational resource","score":0.13501909375190735}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7570033073425293},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5770539045333862},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5769535899162292},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5373780727386475},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5129474997520447},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4769127070903778},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4722040593624115},{"id":"https://openalex.org/C164215192","wikidata":"https://www.wikidata.org/wiki/Q13414364","display_name":"Asymptotic computational complexity","level":4,"score":0.45886629819869995},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44369128346443176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3248705565929413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18632495403289795},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.17096048593521118},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.13501909375190735},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/2676726.2677010","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2676726.2677010","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2677010&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1411.2286","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1411.2286","pdf_url":"https://arxiv.org/pdf/1411.2286","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.760.6768","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.760.6768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1411.2286.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01104556v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01104556","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":"42nd Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages, {POPL} 2015, Jan 2015, Mumbai, India. pp.567-580","raw_type":"Conference papers"},{"id":"pmh:oai:repository.lsu.edu:eecs_pubs-2574","is_oa":false,"landing_page_url":"https://repository.lsu.edu/eecs_pubs/1572","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"},{"id":"pmh:oai:repository.lsu.edu:eecs_pubs-2575","is_oa":false,"landing_page_url":"https://repository.lsu.edu/eecs_pubs/1573","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/2676726.2677010","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2676726.2677010","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2677010&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.5400000214576721,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G1086733898","display_name":null,"funder_award_id":"DE-SC0012489","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G1372563335","display_name":"Customizable Domain-Specific Computing","funder_award_id":"0926127","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1532236644","display_name":null,"funder_award_id":"926687","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G254850637","display_name":"Collaborative Research: An Environment for Portable High Productivity High Performance Computing on GPUs/Accelerators","funder_award_id":"0926687","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G323769019","display_name":"II-NEW: Research Software Infrastructure for Tensor Computations","funder_award_id":"1059417","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3515392198","display_name":null,"funder_award_id":"811457","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G416176200","display_name":null,"funder_award_id":"0811457 0926127 0926687 and 1059417","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6286740375","display_name":"Collaborative Research:  CPA-CPL-T:   An Effective Automatic Parallelization Framework for Multi-Core Architectures","funder_award_id":"0811457","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6866006471","display_name":null,"funder_award_id":"926127","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/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320310395","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2070079053.pdf","grobid_xml":"https://content.openalex.org/works/W2070079053.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W174771588","https://openalex.org/W643803686","https://openalex.org/W1507218610","https://openalex.org/W1526545853","https://openalex.org/W1558370006","https://openalex.org/W1837653564","https://openalex.org/W1864503397","https://openalex.org/W1950718439","https://openalex.org/W1965693583","https://openalex.org/W1972501001","https://openalex.org/W1980882612","https://openalex.org/W1991300218","https://openalex.org/W1997947415","https://openalex.org/W2010747199","https://openalex.org/W2023122441","https://openalex.org/W2035937417","https://openalex.org/W2038729923","https://openalex.org/W2041578787","https://openalex.org/W2061739322","https://openalex.org/W2065495631","https://openalex.org/W2071110673","https://openalex.org/W2072364436","https://openalex.org/W2085237598","https://openalex.org/W2090322880","https://openalex.org/W2104373803","https://openalex.org/W2107651134","https://openalex.org/W2138266087","https://openalex.org/W2157237396","https://openalex.org/W2164946224","https://openalex.org/W2165731524","https://openalex.org/W2257451327","https://openalex.org/W2318290589","https://openalex.org/W2340604309","https://openalex.org/W2953128281","https://openalex.org/W3100417409","https://openalex.org/W4206696315","https://openalex.org/W4233979608","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2374430960","https://openalex.org/W1548964214","https://openalex.org/W1512399864","https://openalex.org/W2047754121","https://openalex.org/W1974040526","https://openalex.org/W2801167165","https://openalex.org/W2229588459","https://openalex.org/W1964595892","https://openalex.org/W2327776271","https://openalex.org/W2353365661"],"abstract_inverted_index":{"Technology":[0],"trends":[1],"will":[2,23,41],"cause":[3],"data":[4,38,52],"movement":[5],"to":[6,78,94,133],"account":[7],"for":[8,30,51,68,82,117],"the":[9,59,83,135,146],"majority":[10],"of":[11,37,47,61,96,102,140,145],"energy":[12],"expenditure":[13],"and":[14,33,63,149],"execution":[15],"time":[16],"on":[17,123],"emerging":[18],"computers.":[19],"Therefore,":[20],"computational":[21,69],"complexity":[22,40,54],"no":[24],"longer":[25],"be":[26,42],"a":[27,34,129,143],"sufficient":[28],"metric":[29],"comparing":[31],"algorithms,":[32],"fundamental":[35],"characterization":[36],"access":[39,53],"increasingly":[43],"important.":[44],"The":[45],"problem":[46,112,147],"developing":[48,114],"lower":[49,79,120,138],"bounds":[50,80,121,139],"has":[55],"been":[56],"modeled":[57],"using":[58],"formalism":[60],"Hong":[62],"Kung's":[64],"red/blue":[65,84],"pebble":[66,85],"game":[67,86],"directed":[70],"acyclic":[71],"graphs":[72],"(CDAGs).":[73],"However,":[74],"previously":[75],"developed":[76],"approaches":[77],"analysis":[81,131],"are":[87],"very":[88],"limited":[89],"in":[90],"effectiveness":[91],"when":[92],"applied":[93],"CDAGs":[95],"real":[97],"programs,":[98,141],"with":[99,105],"computations":[100],"comprised":[101],"multiple":[103],"sub-computations":[104],"differing":[106],"DAG":[107],"structure.":[108],"We":[109,126],"address":[110],"this":[111],"by":[113],"an":[115],"approach":[116],"effectively":[118],"composing":[119],"based":[122],"graph":[124],"decomposition.":[125],"also":[127],"develop":[128],"static":[130],"algorithm":[132],"derive":[134],"asymptotic":[136],"data-access":[137],"as":[142],"function":[144],"size":[148],"cache":[150],"size.":[151]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2020-11-23T00:00:00"}