Sciweavers

41 search results - page 6 / 9
» Parallel optimisation algorithms for multilevel mesh partiti...
Sort
View
PAAPP
1998
149views more  PAAPP 1998»
13 years 7 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
ASPLOS
2008
ACM
13 years 10 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
CCGRID
2010
IEEE
13 years 9 months ago
Asynchronous Communication Schemes for Finite Difference Methods on Multiple GPUs
Finite difference methods continue to provide an important and parallelisable approach to many numerical simulations problems. Iterative multigrid and multilevel algorithms can co...
Daniel P. Playne, Kenneth A. Hawick
IPPS
1999
IEEE
14 years 6 days ago
Self-Avoiding Walks over Adaptive Unstructured Grids
Abstract. In this paper, we present self-avoiding walks as a novel technique to linearize" a triangular mesh. Unlike space- lling curves which are based on a geometric embeddi...
Gerd Heber, Rupak Biswas, Guang R. Gao
PVM
2010
Springer
13 years 5 months ago
Load Balancing for Regular Meshes on SMPs with MPI
Abstract. Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors ...
Vivek Kale, William Gropp