{"id":"https://openalex.org/W2293881866","doi":"https://doi.org/10.1145/2364506.2364512","title":"Vectorisation avoidance","display_name":"Vectorisation avoidance","publication_year":2012,"publication_date":"2012-09-12","ids":{"openalex":"https://openalex.org/W2293881866","doi":"https://doi.org/10.1145/2364506.2364512","mag":"2293881866"},"language":"en","primary_location":{"id":"doi:10.1145/2364506.2364512","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2364506.2364512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 Haskell Symposium","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/A5089112216","display_name":"Gabriele Keller","orcid":"https://orcid.org/0000-0003-1442-5387"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Gabriele Keller","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070087274","display_name":"Manuel M. T. Chakravarty","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Manuel M.T. Chakravarty","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007894751","display_name":"Roman Leshchinskiy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roman Leshchinskiy","raw_affiliation_strings":["Not affiliated, London, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Not affiliated, London, United Kingdom","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009447837","display_name":"Ben Lippmeier","orcid":null},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ben Lippmeier","raw_affiliation_strings":["University of New South Wales, Sydney, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, Australia","institution_ids":["https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027817074","display_name":"Simon Peyton Jones","orcid":"https://orcid.org/0000-0002-6085-1435"},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Simon Peyton Jones","raw_affiliation_strings":["Microsoft Research Ltd, Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Ltd, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5089112216"],"corresponding_institution_ids":["https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":2.0494,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.87282923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"48"},"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.9997000098228455,"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.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.989300012588501,"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"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9887999892234802,"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/flattening","display_name":"Flattening","score":0.8841788172721863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8814212083816528},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6534122228622437},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.6402844786643982},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6302938461303711},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6298844218254089},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.37312692403793335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3210725784301758},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.08420106768608093}],"concepts":[{"id":"https://openalex.org/C19444555","wikidata":"https://www.wikidata.org/wiki/Q212750","display_name":"Flattening","level":2,"score":0.8841788172721863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8814212083816528},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6534122228622437},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.6402844786643982},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6302938461303711},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6298844218254089},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.37312692403793335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3210725784301758},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.08420106768608093},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2364506.2364512","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2364506.2364512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 Haskell Symposium","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.259.6823","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.6823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/%7Esimonpj/papers/ndp/vectorisation-avoidance-hw12.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.359.5663","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.359.5663","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unsw.edu.au/%7Echak/papers/vect-avoid.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.409.3693","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.409.3693","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unsw.edu.au/~chak/papers/vect-avoid.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.592.1661","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.592.1661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unsw.edu.au/~benl/papers/avoidance/avoidance-Haskell2012.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":24,"referenced_works":["https://openalex.org/W1734457603","https://openalex.org/W1979240050","https://openalex.org/W1996541179","https://openalex.org/W2058692170","https://openalex.org/W2060847221","https://openalex.org/W2077381627","https://openalex.org/W2081124914","https://openalex.org/W2083870087","https://openalex.org/W2107214848","https://openalex.org/W2109271084","https://openalex.org/W2109504311","https://openalex.org/W2125690388","https://openalex.org/W2136424975","https://openalex.org/W2150848984","https://openalex.org/W2163496769","https://openalex.org/W2167571567","https://openalex.org/W2168938117","https://openalex.org/W2185684207","https://openalex.org/W2244101089","https://openalex.org/W2293267824","https://openalex.org/W2520329654","https://openalex.org/W2911902296","https://openalex.org/W4205241946","https://openalex.org/W6726778702"],"related_works":["https://openalex.org/W1608806855","https://openalex.org/W2023505575","https://openalex.org/W1850053445","https://openalex.org/W1578204257","https://openalex.org/W2313503008","https://openalex.org/W2047588290","https://openalex.org/W1972912085","https://openalex.org/W2386644492","https://openalex.org/W300950598","https://openalex.org/W3030139520"],"abstract_inverted_index":{"Flattening":[0],"nested":[1,11],"parallelism":[2,12],"is":[3],"a":[4,49],"vectorising":[5],"code":[6],"transform":[7],"that":[8,72],"converts":[9],"irregular":[10],"into":[13],"flat":[14],"data":[15,31],"parallelism.":[16],"Although":[17],"the":[18,27,57,99],"result":[19],"has":[20],"good":[21],"asymptotic":[22],"performance,":[23],"flattening":[24,60],"thoroughly":[25],"restructures":[26],"code.":[28,101],"Many":[29],"intermediate":[30],"structures":[32],"and":[33,89],"traversals":[34],"are":[35],"introduced,":[36],"which":[37],"may":[38,40],"or":[39],"not":[41],"be":[42],"eliminated":[43],"by":[44],"subsequent":[45],"optimisation.":[46],"We":[47,68],"present":[48,69],"novel":[50],"program":[51,58],"analysis":[52],"to":[53,79,95],"identify":[54],"parts":[55],"of":[56],"where":[59],"would":[61],"only":[62],"introduce":[63],"overhead,":[64],"without":[65],"appropriate":[66],"gain.":[67],"empirical":[70],"evidence":[71],"avoiding":[73],"vectorisation":[74,88],"in":[75],"these":[76],"cases":[77],"leads":[78],"more":[80],"efficient":[81],"programs":[82],"than":[83],"if":[84],"we":[85],"had":[86],"applied":[87],"then":[90],"relied":[91],"on":[92],"array":[93],"fusion":[94],"eliminate":[96],"intermediates":[97],"from":[98],"resulting":[100]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}