{"id":"https://openalex.org/W2094674899","doi":"https://doi.org/10.1109/bigdata.2014.7004265","title":"PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks","display_name":"PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W2094674899","doi":"https://doi.org/10.1109/bigdata.2014.7004265","mag":"2094674899"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata.2014.7004265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2014.7004265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.osti.gov/biblio/1242087","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038499316","display_name":"George M. Slota","orcid":"https://orcid.org/0000-0002-4709-4724"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George M. Slota","raw_affiliation_strings":["Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057403059","display_name":"Kamesh Madduri","orcid":"https://orcid.org/0000-0003-4344-0957"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kamesh Madduri","raw_affiliation_strings":["Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023482297","display_name":"Sivasankaran Rajamanickam","orcid":"https://orcid.org/0000-0002-5854-409X"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]},{"id":"https://openalex.org/I4210104735","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sivasankaran Rajamanickam","raw_affiliation_strings":["Scalable Algorithms Department, Sandia National Laboratories, Albuquerque, NM","[Scalable Algorithms Department, Sandia National Laboratories, Albuquerque, NM]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Scalable Algorithms Department, Sandia National Laboratories, Albuquerque, NM","institution_ids":["https://openalex.org/I4210104735"]},{"raw_affiliation_string":"[Scalable Algorithms Department, Sandia National Laboratories, Albuquerque, NM]","institution_ids":["https://openalex.org/I192454743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7082,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.94784682,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"481","last_page":"490"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9988999962806702,"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.9988999962806702,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9912999868392944,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8151625394821167},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.71690833568573},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6950369477272034},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.5624734163284302},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5588833093643188},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5132849216461182},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.48342931270599365},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4093683660030365},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.12339365482330322},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09375649690628052}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8151625394821167},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.71690833568573},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6950369477272034},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.5624734163284302},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5588833093643188},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5132849216461182},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.48342931270599365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4093683660030365},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.12339365482330322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09375649690628052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/bigdata.2014.7004265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata.2014.7004265","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},{"id":"pmh:oai:osti.gov:1242087","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1242087","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:osti.gov:1242087","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1242087","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.9100000262260437,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W131619556","https://openalex.org/W1482680420","https://openalex.org/W1556784394","https://openalex.org/W1621071313","https://openalex.org/W1749024214","https://openalex.org/W1814023381","https://openalex.org/W1823076153","https://openalex.org/W1999446611","https://openalex.org/W2000273502","https://openalex.org/W2022704179","https://openalex.org/W2035080386","https://openalex.org/W2047345171","https://openalex.org/W2068015060","https://openalex.org/W2070232376","https://openalex.org/W2085426754","https://openalex.org/W2093053744","https://openalex.org/W2095117703","https://openalex.org/W2104192768","https://openalex.org/W2118893477","https://openalex.org/W2124200646","https://openalex.org/W2127048411","https://openalex.org/W2132202037","https://openalex.org/W2145124007","https://openalex.org/W2146591355","https://openalex.org/W2160459668","https://openalex.org/W2167927436","https://openalex.org/W2169223901","https://openalex.org/W2402483587","https://openalex.org/W2963798707","https://openalex.org/W3102641634","https://openalex.org/W3104001151","https://openalex.org/W3137027499","https://openalex.org/W4236269389","https://openalex.org/W4302764849","https://openalex.org/W6603201521","https://openalex.org/W6636450965","https://openalex.org/W6638399519","https://openalex.org/W6638573514","https://openalex.org/W6662183701","https://openalex.org/W6678498509"],"related_works":["https://openalex.org/W1556451512","https://openalex.org/W1555349535","https://openalex.org/W4234091740","https://openalex.org/W4213350282","https://openalex.org/W2571250724","https://openalex.org/W4401278057","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3211941742","https://openalex.org/W2035944803"],"abstract_inverted_index":{"We":[0,146],"present":[1],"PuLP,":[2],"a":[3,49,99,107,113,116],"parallel":[4],"and":[5,34,59,132],"memory-efficient":[6],"graph":[7,38,64],"partitioning":[8,21,89,150],"method":[9,71],"specifically":[10],"designed":[11],"to":[12,97,135],"partition":[13,98],"low-diameter":[14],"networks":[15],"with":[16,102],"skewed":[17],"degree":[18],"distributions.":[19],"Graph":[20],"is":[22,77,133],"an":[23],"important":[24],"Big":[25],"Data":[26],"problem":[27],"because":[28],"it":[29,79],"impacts":[30],"the":[31,45,154],"execution":[32],"time":[33],"energy":[35],"efficiency":[36],"of":[37,48,63,69,104,118],"analytics":[39],"on":[40,106,138],"distributed-memory":[41],"platforms.":[42],"Partitioning":[43],"determines":[44],"in-memory":[46],"layout":[47],"graph,":[50],"which":[51],"affects":[52],"locality,":[53],"intertask":[54],"load":[55],"balance,":[56],"communication":[57],"time,":[58],"overall":[60],"memory":[61,128],"utilization":[62],"analytics.":[65],"A":[66],"novel":[67],"feature":[68],"our":[70,92],"PuLP":[72,124],"(Partitioning":[73],"using":[74],"Label":[75],"Propagation)":[76],"that":[78,123],"optimizes":[80],"for":[81,153],"multiple":[82,88],"objective":[83],"metrics":[84],"simultaneously,":[85],"while":[86],"satisfying":[87],"constraints.":[90],"Using":[91],"method,":[93],"we":[94,121],"are":[95],"able":[96],"web":[100],"crawl":[101],"billions":[103],"edges":[105],"single":[108],"compute":[109],"server":[110],"in":[111],"under":[112],"minute.":[114],"For":[115],"collection":[117],"test":[119],"graphs,":[120],"show":[122],"uses":[125],"8-39\u00d7":[126],"less":[127],"than":[129,140],"state-of-the-art":[130],"partitioners":[131],"up":[134],"14.5\u00d7":[136],"faster,":[137],"average,":[139],"alternate":[141],"approaches":[142],"(with":[143],"16-way":[144],"parallelism).":[145],"also":[147],"achieve":[148],"better":[149],"quality":[151],"results":[152],"multi-objective":[155],"scenario.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}