{"id":"https://openalex.org/W4379522531","doi":"https://doi.org/10.1145/3591195.3595268","title":"OMRGx: Programmable and Transparent Out-of-Core Graph Partitioning and Processing","display_name":"OMRGx: Programmable and Transparent Out-of-Core Graph Partitioning and Processing","publication_year":2023,"publication_date":"2023-06-06","ids":{"openalex":"https://openalex.org/W4379522531","doi":"https://doi.org/10.1145/3591195.3595268"},"language":"en","primary_location":{"id":"doi:10.1145/3591195.3595268","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591195.3595268","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591195.3595268","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 2023 ACM SIGPLAN International Symposium on Memory Management","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/3591195.3595268","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036134859","display_name":"Gurneet Kaur","orcid":"https://orcid.org/0000-0001-8961-2887"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gurneet Kaur","raw_affiliation_strings":["University of California at Riverside, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100699251","display_name":"Rajiv Gupta","orcid":"https://orcid.org/0000-0002-9348-3974"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajiv Gupta","raw_affiliation_strings":["University of California at Riverside, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036134859"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":0.3018,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4795794,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"137","last_page":"149"},"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.9995999932289124,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.871951162815094},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.740693211555481},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6938626766204834},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.6588718295097351},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.501143217086792},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.4840209186077118},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4747857451438904},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.46473053097724915},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.42424845695495605},{"id":"https://openalex.org/keywords/computer-architecture","display_name":"Computer architecture","score":0.37565526366233826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3354879915714264},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30559027194976807}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.871951162815094},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.740693211555481},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6938626766204834},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.6588718295097351},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.501143217086792},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.4840209186077118},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4747857451438904},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.46473053097724915},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.42424845695495605},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.37565526366233826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3354879915714264},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30559027194976807}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3591195.3595268","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591195.3595268","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591195.3595268","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 2023 ACM SIGPLAN International Symposium on Memory Management","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3591195.3595268","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3591195.3595268","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3591195.3595268","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 2023 ACM SIGPLAN International Symposium on Memory Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G189749254","display_name":null,"funder_award_id":"CCF-1813173,CCF-2028714,CCF-2002554,CCF-2226448","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2986130434","display_name":"SHF: Small: MIGS -- Efficiently Evaluating Multiple Iterative Graph Queries","funder_award_id":"2002554","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4569468207","display_name":"SHF: Small: CT-DDS -- Scalable Concolic Testing of Parallel Applications With Shared Dynamic Data Structures","funder_award_id":"2226448","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4379522531.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W1538076361","https://openalex.org/W1832683484","https://openalex.org/W2004951603","https://openalex.org/W2010621244","https://openalex.org/W2011601876","https://openalex.org/W2020140168","https://openalex.org/W2070232376","https://openalex.org/W2096544401","https://openalex.org/W2118953734","https://openalex.org/W2124200646","https://openalex.org/W2161455936","https://openalex.org/W2240933082","https://openalex.org/W2409430164","https://openalex.org/W2524623326","https://openalex.org/W2955938631","https://openalex.org/W4241977206","https://openalex.org/W4251344828","https://openalex.org/W6637407823","https://openalex.org/W6638233953","https://openalex.org/W6658884952","https://openalex.org/W6684310269","https://openalex.org/W6697525163","https://openalex.org/W6804611081"],"related_works":["https://openalex.org/W2025467172","https://openalex.org/W2365746557","https://openalex.org/W3160136729","https://openalex.org/W164750744","https://openalex.org/W1589529336","https://openalex.org/W2968111836","https://openalex.org/W2793542907","https://openalex.org/W2086205578","https://openalex.org/W3004176791","https://openalex.org/W2066402492"],"abstract_inverted_index":{"Partitioning":[0],"and":[1,66,73,100,116,155,182],"processing":[2,22,67,158],"of":[3,75,94,145,152,170,179,196],"large":[4],"graphs":[5],"on":[6,31],"a":[7,14,135],"single":[8],"machine":[9,122],"with":[10,69,176,185],"limited":[11,26,96],"memory":[12,39,123],"is":[13],"challenge.":[15],"While":[16],"many":[17],"custom":[18],"solutions":[19],"for":[20],"out-of-core":[21,32,88,143,157],"have":[23],"been":[24,29],"developed,":[25],"work":[27],"has":[28],"done":[30],"partitioning":[33,65],"that":[34],"can":[35],"be":[36,113],"far":[37],"more":[38],"intensive":[40],"than":[41,163],"processing.":[42],"In":[43,127],"this":[44],"paper":[45],"we":[46,139],"present":[47],"the":[48,55,76,92,104,121,125,141,146,177,186,194],"OMRGx":[49,80,138,150,174,190],"system":[50],"whose":[51],"programming":[52,71],"interface":[53],"allows":[54,109],"programmer":[56],"to":[57,112],"rapidly":[58],"prototype":[59],"existing":[60,129,153],"as":[61,63],"well":[62],"new":[64],"strategies":[68,85],"minimal":[70],"effort":[72],"oblivious":[74],"graph":[77,187],"size.":[78,188],"The":[79,106,168],"engine":[81],"transparently":[82],"implements":[83],"these":[84],"in":[86],"an":[87],"manner":[89],"while":[90],"hiding":[91],"complexities":[93],"managing":[95],"memory,":[97],"parallel":[98,101],"computation,":[99],"IO":[102],"from":[103],"programmer.":[105],"execution":[107],"model":[108],"multiple":[110],"partitions":[111,132,180],"simultaneously":[114,117],"constructed":[115],"processed":[118],"by":[119,173],"dividing":[120],"among":[124],"partitions.":[126],"contrast,":[128],"systems":[130],"process":[131],"one":[133],"at":[134],"time.":[136],"Using":[137],"developed":[140],"first":[142],"implementation":[144,192],"popular":[147],"MtMetis":[148],"partitioner.":[149],"implementations":[151,171],"GridGraph":[154],"GraphChi":[156],"frameworks":[159],"deliver":[160],"performance":[161],"better":[162],"their":[164],"standalone":[165],"optimized":[166],"implementations.":[167],"runtimes":[169],"produced":[172],"decrease":[175],"number":[178],"requested":[181],"increase":[183],"linearly":[184],"Finally":[189],"default":[191],"performs":[193],"best":[195],"all.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}