Sciweavers

186 search results - page 6 / 38
» Irregular Parallel Algorithms in JAVA
Sort
View
JPDC
1998
124views more  JPDC 1998»
13 years 7 months ago
Multilevel k-way Partitioning Scheme for Irregular Graphs
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high ...
George Karypis, Vipin Kumar
IPPS
1998
IEEE
13 years 11 months ago
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Raja...
PPOPP
2010
ACM
14 years 4 months ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...
CG
2006
Springer
13 years 7 months ago
Supercover model, digital straight line recognition and curve reconstruction on the irregular isothetic grids
On the classical discrete grid, the analysis of digital straight lines (DSL for short) has been intensively studied for nearly half a century. In this article, we are interested i...
David Coeurjolly, Loutfi Zerarga
DAM
2010
105views more  DAM 2010»
13 years 4 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...