{"id":"https://openalex.org/W2006846907","doi":"https://doi.org/10.1145/2612669.2612685","title":"Automatic complexity analysis of explicitly parallel programs","display_name":"Automatic complexity analysis of explicitly parallel programs","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2006846907","doi":"https://doi.org/10.1145/2612669.2612685","mag":"2006846907"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612685","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","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/A5026990786","display_name":"Torsten Hoefler","orcid":"https://orcid.org/0000-0002-1333-9797"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Torsten Hoefler","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056811919","display_name":"Grzegorz Kwa\u015bniewski","orcid":"https://orcid.org/0000-0001-8943-1381"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Grzegorz Kwasniewski","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026990786"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.9451,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.74989344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"226","last_page":"235"},"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.9983999729156494,"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.9983999729156494,"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/T10260","display_name":"Software Engineering Research","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9926999807357788,"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/computer-science","display_name":"Computer science","score":0.8604438304901123},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.8386539816856384},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.602581262588501},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.595305323600769},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5496181845664978},{"id":"https://openalex.org/keywords/instruction-level-parallelism","display_name":"Instruction-level parallelism","score":0.5286094546318054},{"id":"https://openalex.org/keywords/task-parallelism","display_name":"Task parallelism","score":0.4836255609989166},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.47796201705932617},{"id":"https://openalex.org/keywords/nested-loop-join","display_name":"Nested loop join","score":0.4718986451625824},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.4605940580368042},{"id":"https://openalex.org/keywords/implicit-parallelism","display_name":"Implicit parallelism","score":0.45577338337898254},{"id":"https://openalex.org/keywords/data-parallelism","display_name":"Data parallelism","score":0.44704464077949524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41731321811676025},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41579508781433105},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3678276240825653},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2618946433067322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1026669442653656},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09451302886009216}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8604438304901123},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.8386539816856384},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.602581262588501},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.595305323600769},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5496181845664978},{"id":"https://openalex.org/C140763907","wikidata":"https://www.wikidata.org/wiki/Q2714055","display_name":"Instruction-level parallelism","level":3,"score":0.5286094546318054},{"id":"https://openalex.org/C42992933","wikidata":"https://www.wikidata.org/wiki/Q691169","display_name":"Task parallelism","level":3,"score":0.4836255609989166},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.47796201705932617},{"id":"https://openalex.org/C1306188","wikidata":"https://www.wikidata.org/wiki/Q4060687","display_name":"Nested loop join","level":2,"score":0.4718986451625824},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.4605940580368042},{"id":"https://openalex.org/C3543717","wikidata":"https://www.wikidata.org/wiki/Q6007302","display_name":"Implicit parallelism","level":4,"score":0.45577338337898254},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.44704464077949524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41731321811676025},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41579508781433105},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3678276240825653},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2618946433067322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1026669442653656},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09451302886009216},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2612669.2612685","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612685","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.5467","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.5467","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://htor.inf.ethz.ch/publications/img/hoefler-kwasniewski-parallel-complexity.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W159719520","https://openalex.org/W1492406391","https://openalex.org/W1515621470","https://openalex.org/W1523037784","https://openalex.org/W1577384748","https://openalex.org/W1585927874","https://openalex.org/W1598202309","https://openalex.org/W1600795850","https://openalex.org/W1749508623","https://openalex.org/W1848153821","https://openalex.org/W1966128391","https://openalex.org/W1967845657","https://openalex.org/W1977230955","https://openalex.org/W1983545421","https://openalex.org/W2007470648","https://openalex.org/W2029726208","https://openalex.org/W2030553163","https://openalex.org/W2039525895","https://openalex.org/W2057998317","https://openalex.org/W2107158148","https://openalex.org/W2108177987","https://openalex.org/W2108776051","https://openalex.org/W2111693532","https://openalex.org/W2120490947","https://openalex.org/W2126160338","https://openalex.org/W2129740858","https://openalex.org/W2130566259","https://openalex.org/W2132750992","https://openalex.org/W2146438362","https://openalex.org/W2150871235","https://openalex.org/W2150881394","https://openalex.org/W2153185479","https://openalex.org/W2154968583","https://openalex.org/W2156697773","https://openalex.org/W2339337913","https://openalex.org/W2436525433","https://openalex.org/W2533204039","https://openalex.org/W2561675875","https://openalex.org/W2752061190","https://openalex.org/W2798579874","https://openalex.org/W2911980423","https://openalex.org/W2963938058","https://openalex.org/W3019365222","https://openalex.org/W3037385489","https://openalex.org/W3145128584","https://openalex.org/W3198160809","https://openalex.org/W4285719527","https://openalex.org/W7055024897"],"related_works":["https://openalex.org/W2526302199","https://openalex.org/W2003935582","https://openalex.org/W4240606930","https://openalex.org/W2105992728","https://openalex.org/W74409296","https://openalex.org/W2950520577","https://openalex.org/W2494130044","https://openalex.org/W305742777","https://openalex.org/W3189160234","https://openalex.org/W3007272028"],"abstract_inverted_index":{"The":[0,42,98],"doubling":[1],"of":[2,61,88,95,121,149,170],"cores":[3],"every":[4],"two":[5],"years":[6],"requires":[7],"programmers":[8],"to":[9,24,34,52,72,104,111,144,157],"expose":[10],"maximum":[11,59,162],"parallelism.":[12],"Applications":[13],"that":[14],"are":[15],"developed":[16],"on":[17,26,92],"today's":[18],"machines":[19],"will":[20,174],"often":[21],"be":[22,102,142,175],"required":[23,55],"run":[25],"many":[27],"more":[28],"cores.":[29],"Thus,":[30],"it":[31],"is":[32,164],"necessary":[33],"understand":[35],"how":[36,138],"much":[37],"parallelism":[38,60,163],"codes":[39],"can":[40,101,141],"expose.":[41],"work":[43,56,74,106,146],"and":[44,57,63,75,107,129,147],"depth":[45,76,108,148],"model":[46],"provides":[47],"a":[48,78,167,171],"convenient":[49],"mental":[50],"framework":[51],"assess":[53,105],"the":[54,58,86,93,112,118,160],"algorithms":[62],"their":[64],"parallel":[65],"efficiency.":[66],"We":[67,80,136],"propose":[68],"an":[69],"automatic":[70],"analysis":[71],"extract":[73],"from":[77],"source-code.":[79],"do":[81],"this":[82,139],"by":[83],"statically":[84],"counting":[85],"number":[87],"loop":[89],"iterations":[90],"depending":[91],"set":[94],"input":[96],"parameters.":[97],"resulting":[99],"expression":[100],"used":[103,143],"with":[109,125],"regards":[110],"program":[113],"inputs.":[114],"Our":[115,153],"method":[116,140],"supports":[117],"large":[119],"class":[120],"practically":[122],"relevant":[123],"loops":[124],"affine":[126],"update":[127],"functions":[128],"generates":[130],"additional":[131],"parameters":[132],"for":[133,178],"other":[134],"expressions.":[135],"demonstrate":[137],"determine":[145],"several":[150],"real-world":[151],"applications.":[152],"technique":[154],"enables":[155],"us":[156],"prove":[158],"if":[159],"theoretically":[161],"exposed":[165],"in":[166],"practical":[168],"implementation":[169],"problem.":[172],"This":[173],"most":[176],"important":[177],"future-proof":[179],"software":[180],"development.":[181]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
