Sciweavers

2756 search results - page 64 / 552
» Parallel Mesh Generation
Sort
View
EUROPAR
2009
Springer
14 years 2 months ago
A Lower Bound for Oblivious Dimensional Routing
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
Andre Osterloh
CLUSTER
2001
IEEE
13 years 11 months ago
Adaptive Runtime Partitioning of AMR Applications on Heterogeneous Clusters
This paper presents the design and evaluation of an adaptive, system sensitive partitioning and load balancing framework for distributed structured adaptive mesh refinement applic...
Shweta Sinha, Manish Parashar
EUROPAR
2001
Springer
14 years 6 days ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci
WSCG
2003
164views more  WSCG 2003»
13 years 9 months ago
Refinement and Hierarchical Coarsening Schemes for Triangulated Surfaces
We present a refinement and a coarsening (also simplification or decimation) algorithm for the adaptive representation of bivariate functions. The algorithms have proved to be eff...
José P. Suárez, Angel Plaza
EUROGRAPHICS
2010
Eurographics
14 years 3 months ago
Tetrahedral Embedded Boundary Methods for Accurate and Flexible Adaptive Fluids
When simulating fluids, tetrahedral methods provide flexibility and ease of adaptivity that Cartesian grids find difficult to match. However, this approach has so far been lim...
Christopher Batty, Stefan Xenos, Ben Houston