✦ LIBER ✦

Load Balancing for Adaptively Refined Grids

✍ Scribed by G. Zumbusch

Publisher: John Wiley and Sons
Year: 2002
Weight: 139 KB
Volume: 1
Category: Article
ISSN: 1617-7061
DOI: 10.1002/1617-7061(200203)1:1<534::aid-pamm534>3.0.co;2-7

No coin nor oath required. For personal study only.

✦ Synopsis

The solution of partial differential equations on a parallel computer is usually done by a data parallel approach. The grid is partitioned and mapped onto the processors. However, partitioning of unstructured meshes and adaptively refined meshes in general is an N P -hard problem and heuristics are needed. In this paper a parallelisable and cheap method based on space-filling curves is analysed. Quasi-optimal estimates are derived for partitions of adaptively refined grids.

📜 SIMILAR VOLUMES

Adaptive grid refinement methods for tim

Adaptive grid refinement methods for time-dependent flow problems

✍ Ewing, Richard E. 📂 Article 📅 1987 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 732 KB

In the multi-dimensional numerical simulation of certain multi-phase fluid flow processes, many phenomena are sufficiently localized and transient that self-adaptive local grid refinement techniques are necessary to resolve the local physical behaviour. For large-scale simulation problems, efficienc

Load Balancing for Response Time

✍ Jeffery Westbrook 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 119 KB

A centralized scheduler must assign tasks to servers, processing on-line a sequence of task arrivals and departures. Each task runs for an unknown length of time, but comes with a weight that measures resource utilization per unit time. The response time of a server is the sum of the weights of the

Adaptive h-refinement on 3D unstructured

Adaptive h-refinement on 3D unstructured grids for transient problems

✍ Rainald Löhner; Joseph D. Baum 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 971 KB

## Abstract An adaptive finite element scheme for transient problems is presented. The classic h‐enrichment/coarsening is employed in conjunction with a tetrahedral finite element discretization in three dimensions. A mesh change is performed every n time steps, depending on the Courant number empl

A Projection Method for Locally Refined

A Projection Method for Locally Refined Grids

✍ Michael L. Minion 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 455 KB

V_THR: An Adaptive Load Balancing Algori

V_THR: An Adaptive Load Balancing Algorithm

✍ Pallab Dasgupta; A.K. Majumder; P. Bhattacharya 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 173 KB

This paper presents a new adaptive algorithm for dynamic load balancing on a shared BUS architecture. We present results obtained from simulation studies and queuing analysis, which reflect the relation between the BUS contention and the efficiency of load balancing. The proposed algorithm uses a sc

Load balancing schemes for extrapolation

Load balancing schemes for extrapolation methods

✍ Rauber, Thomas; Rünger, Gudula 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

Solving initial value problems (IVPs) for ordinary differential equations (ODEs) has long been believed to be an inherently sequential procedure. But IVP solvers using the extrapolation method provide high quality solutions and offer a great potential for parallelism. In this paper, we present algor