Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Heaphy, T.T."'
Graph partitioning is often used for load balancing in parallel computing, but it is known that hypergraph partitioning has several advantages. First, hypergraphs more accurately model communication volume, and second, they are more expressive and ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______101::fe715c97be8a36198534028d8c2223ad
https://dspace.library.uu.nl/handle/1874/378658
https://dspace.library.uu.nl/handle/1874/378658
Autor:
Devine, K.D., Boman, E.G., Heaphy, T.T., Bisseling, R.H., Catalyurek, U.V., Analyse, Dep Wiskunde
Publikováno v:
Proceedings 20th IEEE International Parallel and Distributed Processing Symposium 2006. IEEE Press
Proceedings 20th IEEE International Parallel and Distributed Processing Symposium 2006
Proceedings 20th IEEE International Parallel and Distributed Processing Symposium 2006
Graph partitioning is often used for load balancing in parallel computing, but it is known that hypergraph partitioning has several advantages. First, hypergraphs more accurately model communication volume, and second, they are more expressive and ca