{"id":"https://openalex.org/W7116426639","doi":"https://doi.org/10.1145/3754598.3754653","title":"Thievory: Graph Processing with Multi-GPU Memory Stealing","display_name":"Thievory: Graph Processing with Multi-GPU Memory Stealing","publication_year":2025,"publication_date":"2025-09-08","ids":{"openalex":"https://openalex.org/W7116426639","doi":"https://doi.org/10.1145/3754598.3754653"},"language":null,"primary_location":{"id":"doi:10.1145/3754598.3754653","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754653","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3754598.3754653","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120945972","display_name":"Jo\u00e3o Brotas","orcid":null},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Jo\u00e3o Brotas","raw_affiliation_strings":["INESC-ID, Lisboa, Portugal and Instituto Superior T\u00e9cnico, Universidade de Lisboa, Lisboa, Portugal"],"raw_orcid":"https://orcid.org/0009-0001-9480-5023","affiliations":[{"raw_affiliation_string":"INESC-ID, Lisboa, Portugal and Instituto Superior T\u00e9cnico, Universidade de Lisboa, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120906523","display_name":"Ricardo Nobre","orcid":null},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Ricardo Nobre","raw_affiliation_strings":["INESC-ID, Lisboa, Portugal and Instituto Superior T\u00e9cnico, Universidade de Lisboa, Lisboa, Portugal"],"raw_orcid":"https://orcid.org/0000-0003-1639-4545","affiliations":[{"raw_affiliation_string":"INESC-ID, Lisboa, Portugal and Instituto Superior T\u00e9cnico, Universidade de Lisboa, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024686169","display_name":"Aleksandar Ili\u0107","orcid":"https://orcid.org/0000-0002-8594-3539"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Aleksandar Ilic","raw_affiliation_strings":["INESC-ID, Lisboa, Portugal and Instituto Superior T\u00e9cnico, Universidade de Lisboa, Lisboa, Portugal"],"raw_orcid":"https://orcid.org/0000-0002-8594-3539","affiliations":[{"raw_affiliation_string":"INESC-ID, Lisboa, Portugal and Instituto Superior T\u00e9cnico, Universidade de Lisboa, Lisboa, Portugal","institution_ids":["https://openalex.org/I121345201"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5120945972"],"corresponding_institution_ids":["https://openalex.org/I121345201"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60409608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9860000014305115,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9860000014305115,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.002899999963119626,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.002400000113993883,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6383000016212463},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5486000180244446},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.447299987077713},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.38199999928474426},{"id":"https://openalex.org/keywords/wait-for-graph","display_name":"Wait-for graph","score":0.3630000054836273},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.3319999873638153},{"id":"https://openalex.org/keywords/big-data","display_name":"Big data","score":0.32919999957084656},{"id":"https://openalex.org/keywords/call-graph","display_name":"Call graph","score":0.328900009393692}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8598999977111816},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6383000016212463},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5486000180244446},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4991999864578247},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48260000348091125},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.447299987077713},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3887999951839447},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.38199999928474426},{"id":"https://openalex.org/C106891557","wikidata":"https://www.wikidata.org/wiki/Q4148051","display_name":"Wait-for graph","level":4,"score":0.3630000054836273},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.3319999873638153},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C61483411","wikidata":"https://www.wikidata.org/wiki/Q3124522","display_name":"Data parallelism","level":3,"score":0.31529998779296875},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.2992999851703644},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C79470037","wikidata":"https://www.wikidata.org/wiki/Q279748","display_name":"Out-of-core algorithm","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.26510000228881836},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.2583000063896179}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3754598.3754653","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754653","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3754598.3754653","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754653","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.7081460356712341,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W2000273502","https://openalex.org/W2011963492","https://openalex.org/W2068015060","https://openalex.org/W2097717378","https://openalex.org/W2430299817","https://openalex.org/W2581090187","https://openalex.org/W2767104566","https://openalex.org/W3011293047","https://openalex.org/W3013163801","https://openalex.org/W3021182071","https://openalex.org/W3202077128","https://openalex.org/W4205973535","https://openalex.org/W4236919333","https://openalex.org/W4255889623","https://openalex.org/W4366957262","https://openalex.org/W4385270195","https://openalex.org/W4385283853"],"related_works":[],"abstract_inverted_index":{"Graph":[0],"workloads":[1,10],"have":[2],"gained":[3],"widespread":[4],"attention":[5],"across":[6],"diverse":[7],"applications.":[8],"These":[9],"often":[11],"display":[12],"large":[13,94],"memory":[14,152],"footprints":[15],"while":[16],"offering":[17],"significant":[18],"parallelism":[19],"opportunities":[20],"in":[21,133,162],"graph":[22,51,56,105,125,156],"traversals.":[23],"To":[24],"exploit":[25],"this":[26],"parallelism,":[27],"the":[28,46,54,62,88,109,122,140],"state-of-the-art":[29,188],"approaches":[30,40,97,189],"focus":[31],"on":[32],"single-GPU":[33],"environments":[34],"and/or":[35],"out-of-memory":[36,124,155],"processing.":[37,52],"However,":[38],"these":[39,163],"are":[41,70],"individually":[42],"insufficient":[43],"to":[44,81,101,153,183],"address":[45],"challenges":[47,80],"of":[48,79,92,142,173,196],"modern":[49,67,93],"GPU-accelerated":[50],"First,":[53],"ever-increasing":[55],"size":[57],"can":[58],"span":[59],"well":[60],"beyond":[61],"available":[63],"GPU":[64],"memory.":[65],"Second,":[66],"computing":[68],"platforms":[69],"de":[71],"facto":[72],"multi-GPU,":[73],"thus":[74,158],"bringing":[75],"a":[76,170,193],"new":[77],"set":[78,172,195],"be":[82,99],"taken":[83],"into":[84],"account":[85],"for":[86],"taming":[87],"highly":[89],"irregular":[90],"nature":[91],"graphs.":[95,197],"Novel":[96],"must":[98],"devised":[100],"achieve":[102],"efficient":[103],"multi-device":[104],"processing":[106,126],"by":[107],"exploiting":[108],"fast":[110],"cross-device":[111],"interconnects":[112],"and":[113,177],"seamless":[114],"peer-to-peer":[115],"communication.":[116],"This":[117],"work":[118],"proposes":[119],"Thievory":[120,180],"\u2013":[121],"first":[123],"framework":[127],"that":[128],"explores":[129],"novel":[130],"execution":[131],"patterns":[132],"multi-GPU":[134,164],"environments.":[135,165],"In":[136],"particular,":[137],"we":[138,167],"explore":[139],"use":[141],"GPUs":[143],"as":[144],"data":[145,174],"buffers,":[146],"effectively":[147],"using":[148],"spare":[149],"neighbor":[150],"GPUs\u2019":[151],"boost":[154],"traversals,":[157],"increasing":[159],"resource":[160],"efficiency":[161],"Moreover,":[166],"also":[168],"analyse":[169],"rich":[171],"transfer":[175],"optimizations":[176],"caching":[178],"mechanisms.":[179],"shows":[181],"up":[182],"10.5\u00d7":[184],"speedups":[185],"over":[186],"existing":[187],"when":[190],"evaluated":[191],"with":[192],"representative":[194]},"counts_by_year":[],"updated_date":"2025-12-21T02:06:08.432651","created_date":"2025-12-21T00:00:00"}