{"id":"https://openalex.org/W2085227872","doi":"https://doi.org/10.1109/ipdpsw.2010.5470922","title":"A distributed diffusive heuristic for clustering a virtual P2P supercomputer","display_name":"A distributed diffusive heuristic for clustering a virtual P2P supercomputer","publication_year":2010,"publication_date":"2010-04-01","ids":{"openalex":"https://openalex.org/W2085227872","doi":"https://doi.org/10.1109/ipdpsw.2010.5470922","mag":"2085227872"},"language":"en","primary_location":{"id":"doi:10.1109/ipdpsw.2010.5470922","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdpsw.2010.5470922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel &amp; Distributed Processing, Workshops and Phd Forum (IPDPSW)","raw_type":"proceedings-article"},"type":"article","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/A5033252611","display_name":"Joachim Gehweiler","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Joachim Gehweiler","raw_affiliation_strings":["Department of Computer Science, University of Paderborn, Paderborn, Germany","Department of Computer Science, University of Paderborn, F\u00fcrstenallee 11, D-33102, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, F\u00fcrstenallee 11, D-33102, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020196859","display_name":"Henning Meyerhenke","orcid":"https://orcid.org/0000-0002-7769-726X"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Henning Meyerhenke","raw_affiliation_strings":["Department of Computer Science, University of Paderborn, Paderborn, Germany","Department of Computer Science, University of Paderborn, F\u00fcrstenallee 11, D-33102, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, F\u00fcrstenallee 11, D-33102, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033252611"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":null,"apc_paid":null,"fwci":2.2604,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.88739824,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9991000294685364,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9991000294685364,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8137328624725342},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7948683500289917},{"id":"https://openalex.org/keywords/supercomputer","display_name":"Supercomputer","score":0.5937548875808716},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4926929771900177},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.4828917980194092},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.469107449054718},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44507962465286255},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3664190173149109},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3029087781906128},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1510106921195984}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8137328624725342},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7948683500289917},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.5937548875808716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4926929771900177},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.4828917980194092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.469107449054718},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44507962465286255},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3664190173149109},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3029087781906128},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1510106921195984}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdpsw.2010.5470922","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdpsw.2010.5470922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel &amp; Distributed Processing, Workshops and Phd Forum (IPDPSW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W143174683","https://openalex.org/W1514107797","https://openalex.org/W1560598623","https://openalex.org/W1565924926","https://openalex.org/W1570554952","https://openalex.org/W1582583636","https://openalex.org/W1596502281","https://openalex.org/W1983502795","https://openalex.org/W2033590892","https://openalex.org/W2038164234","https://openalex.org/W2041869086","https://openalex.org/W2045271686","https://openalex.org/W2095293504","https://openalex.org/W2108099581","https://openalex.org/W2109726592","https://openalex.org/W2112048547","https://openalex.org/W2121564430","https://openalex.org/W2121743855","https://openalex.org/W2124166542","https://openalex.org/W2129271455","https://openalex.org/W2138317718","https://openalex.org/W2140432232","https://openalex.org/W2145872061","https://openalex.org/W2146057107","https://openalex.org/W2166417226","https://openalex.org/W4245800989","https://openalex.org/W4285719527","https://openalex.org/W6633621064","https://openalex.org/W6635735666"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1599154403"],"abstract_inverted_index":{"For":[0],"the":[1,65,81,144,168,172,192,204,221],"management":[2],"of":[3,13,24,92,146,171,200],"a":[4,32,74,89,99,163,180,197],"virtual":[5,164],"P2P":[6,75,165],"supercomputer":[7,166],"one":[8],"is":[9,83,95],"interested":[10],"in":[11,73,143,215],"subgroups":[12,27],"processors":[14],"that":[15,41,212],"can":[16,28],"communicate":[17,185],"with":[18,155,160,179,187],"each":[19,51,176],"other":[20,136],"efficiently.":[21],"The":[22],"task":[23],"finding":[25],"these":[26],"be":[29,71],"formulated":[30],"as":[31,126],"graph":[33,149,224],"clustering":[34,57,108,133,150,225],"problem,":[35],"where":[36],"clusters":[37],"are":[38,42,213],"vertex":[39],"subsets":[40],"densely":[43],"connected":[44,49],"within":[45,191],"themselves,":[46],"but":[47],"sparsely":[48],"to":[50,54,210,217],"other.":[52],"Due":[53],"resource":[55],"constraints,":[56],"using":[58,102],"global":[59,156,232],"knowledge":[60,106],"(i.":[61],"e.,":[62],"knowing":[63],"(nearly)":[64],"whole":[66],"input":[67],"graph)":[68],"might":[69],"not":[70,84],"permissible":[72],"scenario,":[76],"e.":[77],"g.,":[78,140],"because":[79],"collecting":[80],"data":[82],"possible":[85],"or":[86],"would":[87],"consume":[88],"high":[90],"amount":[91,199],"resources.":[93],"That":[94],"why":[96],"we":[97],"present":[98],"distributed":[100,132],"heuristic":[101],"only":[103,186,196],"limited":[104],"local":[105],"for":[107,135],"static":[109],"and":[110,148,194],"dynamic":[111],"graphs.":[112],"Based":[113],"on":[114],"disturbed":[115],"diffusion,":[116],"our":[117],"algorithm":[118,230],"DIDIC":[119,208],"implicitly":[120],"optimizes":[121],"cut-related":[122,153],"quality":[123,137,216],"measures":[124,138,154],"such":[125],"modularity.":[127],"It":[128],"thus":[129],"settles":[130],"between":[131],"algorithms":[134,151],"(e.":[139],"energy":[141],"efficiency":[142],"field":[145],"ad-hoc-networking)":[147],"optimizing":[152],"knowledge.":[157,233],"Our":[158],"experiments":[159],"graphs":[161],"resembling":[162],"show":[167],"promising":[169],"potential":[170],"new":[173],"approach:":[174],"Although":[175],"node":[177],"starts":[178],"random":[181],"cluster":[182],"number,":[183],"may":[184],"its":[188],"direct":[189],"neighbors":[190],"graph,":[193],"requires":[195],"small":[198],"additional":[201],"memory":[202],"space,":[203],"solutions":[205],"computed":[206,219],"by":[207,220],"converge":[209],"clusterings":[211],"comparable":[214],"those":[218],"established":[222],"non-distributed":[223],"library":[226],"mcl,":[227],"whose":[228],"main":[229],"uses":[231]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-25T14:56:36.534964","created_date":"2025-10-10T00:00:00"}
