118 search results - page 3 / 24 » Fast distributed graph partition and application |
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
IJDSN
2008
13 years 7 months ago
2008
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
EUROPAR
2009
Springer
14 years 4 days ago
2009
Springer
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
ICPADS
1998
IEEE
13 years 11 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...
ISSS
2002
IEEE
14 years 13 days ago
2002
IEEE
Fast distributed cosimulation is a challenging problem for the embedded system design. The main theme of this paper is to increase simulation speed by reducing the frequency of in...