Exploració per tema "Graph partitioning"
Ara es mostren els items 1-7 de 7
-
Cost model for Pregel on GraphX
(Springer, 2017)
Text en actes de congrés
Accés obertThe graph partitioning strategy plays a vital role in the overall execution of an algorithm in a distributed graph processing system. Choosing the best strategy is very challenging, as no one strategy is always the best ... -
Graph partitioning for the reduction of data transfer in task-based programming models
(Universitat Politècnica de Catalunya, 2016-07)
Projecte Final de Màster Oficial
Accés obert
Realitzat a/amb: Barcelona Supercomputing CenterCurrent high performance computing architectures are composed of large shared memory NUMA nodes, among other components. Such nodes are becoming increasingly complex as they have several NUMA domains with different access ... -
Overlapping community search in very large graphs
(Universitat Politècnica de Catalunya, 2009-06)
Projecte Final de Màster Oficial
Accés obert"In this master thesis we present a novel approach to finding communities in large graphs. Our method finds the overlapped and hierarchical structure of communities efficiently, outperforming previous proposals. We propose ... -
Overlapping community search in very large graphs
(Universitat Politècnica de Catalunya, 2010-01)
Projecte Final de Màster Oficial
Accés obertThe main objective of the thesis is the creation of an algorithm to detect the community structure of large graphs, allowing for nestings and overlappings. Although it has been shown that communities are usually ... -
Reformulated acyclic partitioning for rail-rail containers transshipment
(Elsevier, 2019-08-16)
Article
Accés obertMany rail terminals have loading areas that are properly equipped to move containers between trains. With the growing throughput of these terminals all the trains involved in a sequence of such movements may not ¿t in the ... -
Software for mesh partitioning
(Universitat Politècnica de Catalunya, 2010-07-20)
Projecte Final de Màster Oficial
Accés obert -
Using graph partitioning to accelerate task-based parallel applications
(Barcelona Supercomputing Center, 2015-05-05)
Text en actes de congrés
Accés obertCurrent high performance computing architectures are composed of large shared memory NUMA nodes, among other components. Such nodes are becoming increasingly complex as they have several NUMA domains with different access ...