{"id":"https://openalex.org/W3011257442","doi":"https://doi.org/10.1145/3373376.3378527","title":"Vortex: Extreme-Performance Memory Abstractions for Data-Intensive Streaming Applications","display_name":"Vortex: Extreme-Performance Memory Abstractions for Data-Intensive Streaming Applications","publication_year":2020,"publication_date":"2020-03-09","ids":{"openalex":"https://openalex.org/W3011257442","doi":"https://doi.org/10.1145/3373376.3378527","mag":"3011257442"},"language":"en","primary_location":{"id":"doi:10.1145/3373376.3378527","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3373376.3378527","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3373376.3378527","source":null,"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3373376.3378527","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077753847","display_name":"Carson Hanel","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Carson Hanel","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037399539","display_name":"Arif Arman","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arif Arman","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015421532","display_name":"Di Xiao","orcid":"https://orcid.org/0000-0002-8612-2863"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Di Xiao","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112512852","display_name":"John Keech","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Keech","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076734500","display_name":"Dmitri Loguinov","orcid":"https://orcid.org/0000-0003-3876-1000"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dmitri Loguinov","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5077753847"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.4856,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66660278,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"623","last_page":"638"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9995999932289124,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8444986939430237},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.6434456706047058},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5025844573974609},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.4560600817203522},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4399893879890442},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.43677547574043274},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.42409589886665344},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.41139698028564453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34276360273361206},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.22081103920936584},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.19985583424568176},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.14243945479393005},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12924540042877197}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8444986939430237},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.6434456706047058},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5025844573974609},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.4560600817203522},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4399893879890442},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.43677547574043274},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42409589886665344},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.41139698028564453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34276360273361206},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.22081103920936584},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.19985583424568176},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.14243945479393005},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12924540042877197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3373376.3378527","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3373376.3378527","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3373376.3378527","source":null,"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3373376.3378527","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3373376.3378527","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3373376.3378527","source":null,"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3943743750","display_name":"CSR: Small: Algorithms and Abstractions for Efficient Virtual-Memory Streaming and Big-Data Computing","funder_award_id":"1717982","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8734211532","display_name":null,"funder_award_id":"CNS-1717982","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"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3011257442.pdf","grobid_xml":"https://content.openalex.org/works/W3011257442.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W57462620","https://openalex.org/W1425731158","https://openalex.org/W1852127287","https://openalex.org/W1858414509","https://openalex.org/W1864523757","https://openalex.org/W1902965424","https://openalex.org/W2006552857","https://openalex.org/W2043099794","https://openalex.org/W2067089961","https://openalex.org/W2082171780","https://openalex.org/W2090202774","https://openalex.org/W2096544401","https://openalex.org/W2100830825","https://openalex.org/W2110304906","https://openalex.org/W2121810937","https://openalex.org/W2122465391","https://openalex.org/W2124516381","https://openalex.org/W2125529470","https://openalex.org/W2151930506","https://openalex.org/W2154894831","https://openalex.org/W2170016254","https://openalex.org/W2170616854","https://openalex.org/W2294108820","https://openalex.org/W2406955896","https://openalex.org/W2479391614","https://openalex.org/W2520718782","https://openalex.org/W2581367156","https://openalex.org/W2586025740","https://openalex.org/W2591802119","https://openalex.org/W2605325442","https://openalex.org/W2606413522","https://openalex.org/W2741149261","https://openalex.org/W2752061190","https://openalex.org/W2788975424","https://openalex.org/W2951465128","https://openalex.org/W4238141424"],"related_works":["https://openalex.org/W6162201","https://openalex.org/W7043479","https://openalex.org/W12527996","https://openalex.org/W1018374","https://openalex.org/W5530410","https://openalex.org/W8370684","https://openalex.org/W3159603","https://openalex.org/W3992447","https://openalex.org/W13752840","https://openalex.org/W6217452"],"abstract_inverted_index":{"Many":[0],"applications":[1,150],"in":[2,73,104],"data":[3,24,141],"analytics,":[4],"information":[5],"retrieval,":[6],"and":[7,20,131,143,162],"cluster":[8],"computing":[9],"process":[10],"huge":[11],"amounts":[12],"of":[13,17,23,48,80,97,112,137],"information.":[14],"The":[15],"complexity":[16],"involved":[18],"algorithms":[19,81],"massive":[21],"scale":[22],"require":[25],"a":[26,34,78,106,119],"programming":[27],"model":[28],"that":[29,60,84,108,116,167],"can":[30],"not":[31,63],"only":[32],"offer":[33],"simple":[35],"abstraction":[36],"for":[37,69,134],"inputs":[38],"larger":[39],"than":[40,172],"RAM,":[41],"but":[42],"also":[43],"squeeze":[44],"maximum":[45],"performance":[46],"out":[47],"the":[49,67,86,98,129,173],"available":[50],"hardware.":[51],"While":[52],"these":[53],"are":[54,101],"usually":[55],"conflicting":[56],"goals,":[57],"we":[58],"show":[59],"this":[61],"does":[62],"have":[64],"to":[65,88],"be":[66],"case":[68],"sequentially-processed":[70],"data,":[71],"i.e.,":[72],"streaming":[74,138],"applications.":[75],"We":[76,146],"develop":[77],"set":[79],"called":[82],"Vortex":[83,126],"force":[85],"application":[87],"generate":[89],"access":[90],"violations":[91],"(i.e.,":[92],"page":[93],"faults)":[94],"during":[95],"processing":[96],"stream,":[99],"which":[100],"transparently":[102],"handled":[103],"such":[105,149],"way":[107],"creates":[109],"an":[110,113],"illusion":[111],"infinite":[114],"buffer":[115],"fits":[117],"into":[118],"regular":[120],"C/C++":[121],"pointer.":[122],"This":[123],"design":[124],"makes":[125],"by":[127],"far":[128],"simplest-to-use":[130],"fastest":[132],"platform":[133],"various":[135],"types":[136],"I/O,":[139],"inter-thread":[140],"transfer,":[142],"key":[144],"shuffling.":[145],"introduce":[147],"several":[148],"--":[151],"file":[152],"I/O":[153],"wrapper,":[154],"bounded":[155],"producer-consumer":[156],"pipeline,":[157],"vanishing":[158],"array,":[159],"key-partitioning":[160],"engine,":[161],"novel":[163],"in-place":[164],"radix":[165],"sort":[166],"is":[168],"3-4":[169],"times":[170],"faster":[171],"best":[174],"prior":[175],"approaches.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}