{"id":"https://openalex.org/W2083042494","doi":"https://doi.org/10.1145/2627373.2627377","title":"Just-in-time Length Specialization of Dynamic Vector Code","display_name":"Just-in-time Length Specialization of Dynamic Vector Code","publication_year":2014,"publication_date":"2014-06-09","ids":{"openalex":"https://openalex.org/W2083042494","doi":"https://doi.org/10.1145/2627373.2627377","mag":"2083042494"},"language":"en","primary_location":{"id":"doi:10.1145/2627373.2627377","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2627373.2627377","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming","raw_type":"proceedings-article"},"type":"conference-paper","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/A5073731680","display_name":"Justin Talbot","orcid":null},"institutions":[{"id":"https://openalex.org/I4210163771","display_name":"Tableau Software (United States)","ror":"https://ror.org/053v5e348","country_code":"US","type":"company","lineage":["https://openalex.org/I4210163771"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Justin Talbot","raw_affiliation_strings":["Tableau Software"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tableau Software","institution_ids":["https://openalex.org/I4210163771"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008830900","display_name":"Zachary DeVito","orcid":"https://orcid.org/0009-0002-8863-1503"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zachary DeVito","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018111215","display_name":"Pat Hanrahan","orcid":"https://orcid.org/0000-0002-3474-9752"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pat Hanrahan","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"20","last_page":"25"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9854999780654907,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9639999866485596,"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.8334437608718872},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6408202648162842},{"id":"https://openalex.org/keywords/trace","display_name":"TRACE (psycholinguistics)","score":0.5697243213653564},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5495004057884216},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5191263556480408},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.4785074293613434},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4263134300708771},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4241955876350403},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.388371080160141},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3461146950721741}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8334437608718872},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6408202648162842},{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.5697243213653564},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5495004057884216},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5191263556480408},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.4785074293613434},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4263134300708771},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4241955876350403},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.388371080160141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3461146950721741},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2627373.2627377","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2627373.2627377","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W121994753","https://openalex.org/W1505883827","https://openalex.org/W1970413960","https://openalex.org/W1978163937","https://openalex.org/W1982205631","https://openalex.org/W1993335798","https://openalex.org/W2026489303","https://openalex.org/W2053321753","https://openalex.org/W2064582221","https://openalex.org/W2087183402","https://openalex.org/W2116136092","https://openalex.org/W2153185479","https://openalex.org/W2339108183","https://openalex.org/W2465088004","https://openalex.org/W2582743722","https://openalex.org/W3005347330","https://openalex.org/W4240763683","https://openalex.org/W4250107321","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2291920536","https://openalex.org/W2162726111","https://openalex.org/W2022397046","https://openalex.org/W1603583590","https://openalex.org/W338671845","https://openalex.org/W2117755361","https://openalex.org/W2286348849","https://openalex.org/W2018511057","https://openalex.org/W2478126787","https://openalex.org/W1587248296"],"abstract_inverted_index":{"Dynamically":[0],"typed":[1,48],"vector":[2,49,75,77,115,128],"languages":[3],"are":[4],"popular":[5],"in":[6,92],"data":[7],"analytics":[8],"and":[9,20,80,114],"statistical":[10,103],"computing.":[11],"In":[12,31,106],"these":[13],"languages,":[14],"vectors":[15],"have":[16,88],"both":[17,112],"dynamic":[18,21],"type":[19],"length,":[22],"making":[23],"static":[24],"generation":[25,65],"of":[26,46,66,83,99,109,127],"efficient":[27,67],"machine":[28,68,95],"code":[29,69],"difficult.":[30],"this":[32],"paper,":[33],"we":[34,117],"describe":[35],"a":[36,93,97,101,107,124],"trace-based":[37],"just-in-time":[38],"compilation":[39,59],"strategy":[40],"that":[41],"performs":[42],"partial":[43],"length":[44],"specialization":[45,53],"dynamically":[47],"code.":[50],"This":[51],"selective":[52],"is":[54],"designed":[55],"to":[56],"avoid":[57],"excessive":[58],"overhead":[60],"while":[61],"still":[62],"enabling":[63],"the":[64,81],"through":[70],"length-based":[71],"optimizations":[72],"such":[73],"as":[74],"fusion,":[76],"copy":[78],"elimination,":[79],"use":[82],"hardware":[84],"SIMD":[85],"units.":[86],"We":[87],"implemented":[89],"our":[90],"approach":[91],"virtual":[94],"for":[96],"subset":[98],"R,":[100],"vector-based":[102],"computing":[104],"language.":[105],"variety":[108],"workloads,":[110],"containing":[111],"scalar":[113],"code,":[116],"show":[118],"near":[119],"autovectorized":[120],"C":[121],"performance":[122],"over":[123],"large":[125],"range":[126],"sizes.":[129]},"counts_by_year":[{"year":2015,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}