Matches in SemOpenAlex for { <https://semopenalex.org/work/W2530506702> ?p ?o ?g. }
Showing items 1 to 76 of
76
with 100 items per page.
- W2530506702 abstract "Graph partitioning is a key step in developing scalable data mining algorithms on massive graph data such as web graphs and social networks. Graph partitioning is often formalized as an optimization problem where we assign graph vertices to computing nodes with the objection to both minimize the communication cost between computing nodes and to balance the load of computing nodes. Such optimization was specified using a cost function to measure the quality of graph partition. Current graph systems such as Pregel, Graphlab take graph cut, i.e. counting the number of edges that cross different partitions, as the cost function of graph partition. We argue that graph cut ignores many characteristics of modern computing cluster and to develop better graph partitioning algorithm we should revise the cost function. In particular we believe that message combing, a new technique that was recently developed in order to minimize communication of computing nodes, should be considered in designing new cost functions for graph partitioning. In this paper, we propose a new cost function for graph partitioning which considers message combining. In this new cost function, we consider communication cost from three different sources: (1) two computing nodes establish a message channel between them; (2) a process creates a message utilize the channel and (3) the length of the message. Based on this cost function, we develop several heuristics for large graph partitioning. We have performed comprehensive experiments using real-world graphs. Our results demonstrate that our algorithms yield significant performance improvements over state-of-the-art approaches. The new cost function developed in this paper should help design new graph partition algorithms for better graph system performance." @default.
- W2530506702 created "2016-10-21" @default.
- W2530506702 creator A5076768386 @default.
- W2530506702 creator A5080409305 @default.
- W2530506702 date "2016-01-01" @default.
- W2530506702 modified "2023-10-16" @default.
- W2530506702 title "Online Graph Partitioning with an Affine Message Combining Cost Function" @default.
- W2530506702 cites W1971630691 @default.
- W2530506702 cites W2006023152 @default.
- W2530506702 cites W2070232376 @default.
- W2530506702 cites W2073365828 @default.
- W2530506702 cites W2129027842 @default.
- W2530506702 cites W2160459668 @default.
- W2530506702 cites W2161455936 @default.
- W2530506702 cites W2166469213 @default.
- W2530506702 cites W2167927436 @default.
- W2530506702 cites W2170616854 @default.
- W2530506702 cites W2173213060 @default.
- W2530506702 cites W4231846589 @default.
- W2530506702 cites W4236269389 @default.
- W2530506702 doi "https://doi.org/10.1007/978-81-322-3628-3_6" @default.
- W2530506702 hasPublicationYear "2016" @default.
- W2530506702 type Work @default.
- W2530506702 sameAs 2530506702 @default.
- W2530506702 citedByCount "0" @default.
- W2530506702 crossrefType "book-chapter" @default.
- W2530506702 hasAuthorship W2530506702A5076768386 @default.
- W2530506702 hasAuthorship W2530506702A5080409305 @default.
- W2530506702 hasBestOaLocation W25305067021 @default.
- W2530506702 hasConcept C132525143 @default.
- W2530506702 hasConcept C134727501 @default.
- W2530506702 hasConcept C19332903 @default.
- W2530506702 hasConcept C203776342 @default.
- W2530506702 hasConcept C22149727 @default.
- W2530506702 hasConcept C41008148 @default.
- W2530506702 hasConcept C48044578 @default.
- W2530506702 hasConcept C48903430 @default.
- W2530506702 hasConcept C77088390 @default.
- W2530506702 hasConcept C80444323 @default.
- W2530506702 hasConceptScore W2530506702C132525143 @default.
- W2530506702 hasConceptScore W2530506702C134727501 @default.
- W2530506702 hasConceptScore W2530506702C19332903 @default.
- W2530506702 hasConceptScore W2530506702C203776342 @default.
- W2530506702 hasConceptScore W2530506702C22149727 @default.
- W2530506702 hasConceptScore W2530506702C41008148 @default.
- W2530506702 hasConceptScore W2530506702C48044578 @default.
- W2530506702 hasConceptScore W2530506702C48903430 @default.
- W2530506702 hasConceptScore W2530506702C77088390 @default.
- W2530506702 hasConceptScore W2530506702C80444323 @default.
- W2530506702 hasLocation W25305067021 @default.
- W2530506702 hasOpenAccess W2530506702 @default.
- W2530506702 hasPrimaryLocation W25305067021 @default.
- W2530506702 hasRelatedWork W1469735297 @default.
- W2530506702 hasRelatedWork W2165770179 @default.
- W2530506702 hasRelatedWork W2187572173 @default.
- W2530506702 hasRelatedWork W2196885578 @default.
- W2530506702 hasRelatedWork W2385598552 @default.
- W2530506702 hasRelatedWork W2527771315 @default.
- W2530506702 hasRelatedWork W2554199509 @default.
- W2530506702 hasRelatedWork W2564335296 @default.
- W2530506702 hasRelatedWork W2584369986 @default.
- W2530506702 hasRelatedWork W2610729589 @default.
- W2530506702 hasRelatedWork W2616221141 @default.
- W2530506702 hasRelatedWork W2743681419 @default.
- W2530506702 hasRelatedWork W2793895633 @default.
- W2530506702 hasRelatedWork W2948894894 @default.
- W2530506702 hasRelatedWork W2949522840 @default.
- W2530506702 hasRelatedWork W2981534755 @default.
- W2530506702 hasRelatedWork W3012030085 @default.
- W2530506702 hasRelatedWork W3196860522 @default.
- W2530506702 hasRelatedWork W81049127 @default.
- W2530506702 hasRelatedWork W2607108329 @default.
- W2530506702 isParatext "false" @default.
- W2530506702 isRetracted "false" @default.
- W2530506702 magId "2530506702" @default.
- W2530506702 workType "book-chapter" @default.