Results 1  10
of
526,752
Partitioning of Unstructured Problems for Parallel Processing
, 1991
"... Many large scale computational problems are based on unstructured computational domains. Primary examples are unstructured grid calculations based on finite volume methods in computational fluid dynamics, or structural analysis problems based on finite element approximations. Here we will address th ..."
Abstract

Cited by 342 (16 self)
 Add to MetaCart
the question of how to distribute such unstructured computational domains over a large number of processors in a MIMD machine with distributed memory. A graph theoretical framework for these problems will be established. Based on this framework three decomposition algorithms will be introduced. In particular
Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh
, 2003
"... In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes selforganize with the goal of forming an efficient overlay tree, one that meets performance targets without placing undue burd ..."
Abstract

Cited by 424 (22 self)
 Add to MetaCart
burden on the underlying network. In this paper, we target highbandwidth data distribution from a single source to a large number of receivers. Applications include largefile transfers and realtime multimedia streaming. For these applications, we argue that an overlay mesh, rather than a tree, can
Parallel Refinement of Unstructured Meshes
, 1999
"... In this paper we describe a parallel #refinement algorithm for unstructured finite element meshes based on the longestedge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design of such a ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
In this paper we describe a parallel #refinement algorithm for unstructured finite element meshes based on the longestedge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design
Parallel Unstructured Mesh Generation
, 1996
"... A strategy for the parallel generation of triangular unstructured meshes is proposed. Several point insertion algorithms originally developed for serial implementation are considered. These algorithms are suitably modified and procedures are developed for parallel execution. Dynamic loadbalancing a ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
A strategy for the parallel generation of triangular unstructured meshes is proposed. Several point insertion algorithms originally developed for serial implementation are considered. These algorithms are suitably modified and procedures are developed for parallel execution. Dynamic load
Multigrid techniques for unstructured meshes
 in VKI Lecture Series VKILS
, 1995
"... An overview of current multigrid techniques for unstructured meshes is given. The basic principles of the multigrid approach are first outlined. Application of these principles to unstructured mesh problems is then described, illustrating various different approaches, and giving examples of practica ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
An overview of current multigrid techniques for unstructured meshes is given. The basic principles of the multigrid approach are first outlined. Application of these principles to unstructured mesh problems is then described, illustrating various different approaches, and giving examples
Performance of Dynamic Load Balancing Algorithms for Unstructured Mesh Calculations
 Concurrency
, 1991
"... If a finite element mesh has a sufficiently regular structure, it is easy to decide in advance how to distribute the mesh among the processors of a distributedmemory parallel processor, but if the mesh is unstructured, the problem becomes much more difficult. The distribution should be made so that ..."
Abstract

Cited by 172 (3 self)
 Add to MetaCart
If a finite element mesh has a sufficiently regular structure, it is easy to decide in advance how to distribute the mesh among the processors of a distributedmemory parallel processor, but if the mesh is unstructured, the problem becomes much more difficult. The distribution should be made so
Scalable Unstructured Mesh Decomposition
, 1998
"... As the efficiency of parallel software increases it is becoming common to measure near linear speedup for many applications. For a problem size N on P processors then with software running at O(N=P ) the performance restrictions due to file i/o systems and mesh decomposition running at O(N) become i ..."
Abstract
 Add to MetaCart
increasingly apparent especially for large P . For distributed memory parallel systems an additional limit to scalability results from the finite memory size available for i/o scatter/gather operations. Simple strategies developed to address the scalability of scatter/gather operations for unstructured mesh
Parallel Partitioning of Unstructured Meshes
 Parallel Computational Fluid Dynamics: Algorithms and Results Using Advanced Computers
, 1996
"... this paper we discuss the partition optimisation problem and its bearing on the graph partitioning problem. In particular, the algorithms outlined in this paper are designed to address the three problems that arise in partitioning of unstructured finite element and finite volume meshes. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
this paper we discuss the partition optimisation problem and its bearing on the graph partitioning problem. In particular, the algorithms outlined in this paper are designed to address the three problems that arise in partitioning of unstructured finite element and finite volume meshes.
Unstructured Mesh Libraries for the AP1000
 PROCEEDINGS OF THE FUJITSU PARALLEL COMPUTING WORKSHOP
, 1996
"... We present the results from the final year of a threeyear collaborative project between Fujitsu Laboratories and Edinburgh Parallel Computing Centre. We have developed and extended a suite of Parallel Utilities Libraries to support distributed unstructured mesh programming on the AP1000. These libr ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present the results from the final year of a threeyear collaborative project between Fujitsu Laboratories and Edinburgh Parallel Computing Centre. We have developed and extended a suite of Parallel Utilities Libraries to support distributed unstructured mesh programming on the AP1000
Results 1  10
of
526,752