The most common technique for the parallelization of multigrid methods is grid partitioning. For such methods Brandt and Diskin have suggested the use of a variant of segmental reenement in order to reduce the amount of inter{processor communication. A parallel multigrid method with this technique avoids all communication on the nest grid levels. This article will examine some features of this ...

We present a new algorithm for the generation of 3-dimensional (3-D) grids for the simulation of semiconductor devices. The fitting of the device geometry and the required mesh density is obtained by partitioning the elements at an optimal point at each refinement step. This allows the fitting of more general 3-D device geometries and the reduction of grid points in comparison with previous gri...

This paper discusses partitioning of dynamic structured grid hierarchies, occuring in structured adaptive mesh re nement (SAMR) applications. When a SAMR method is executed on a parallel computer, the work load will change dynamically. Thus, there is need for dynamic load balancing. Inverse spacelling curve partitioning (ISP) is appealing for load balancing in parallel SAMR, because of its spee...

This article proposes a method for identifying potential self-adequate sub-networks in the existing power distribution grid. These can be equipped with control and protection schemes to form microgrids capable of sustaining local loads during systems contingencies, thereby mitigating disasters. Towards best microgrid candidates, this work formulates chance-constrained optimal network partitioni...

Numerous applications in science and engineering have a problem space that can be represented as a 2-dimensional grid. While some of these problems exhibit uniform computational requirements over all regions of the grid, others are non-uniform: that is, some regions of the grid have more data points than others. We introduce a new block decomposition method, Fair Binary Recursive Decomposition ...

An optimal data partitioning in parallel/distributed implementation of clustering algorithms is a necessary computation as it ensures independent task completion, fair distribution, less number of affected points and better & faster merging. Though partitioning using Kd-Tree is being conventionally used in academia, it suffers from performance drenches and bias (non equal distribution) as dimen...

OBJECTIVES In this paper we study the impact of executing a medical image database query application on the grid. For lowering the total computation time, the image database is partitioned into subsets to be processed on different grid nodes. METHODS A theoretical model of the application complexity and estimates of the grid execution overhead are used to efficiently partition the database. ...

This paper presents the design and preliminary evaluation of hierarchical partitioning and load-balancing techniques for distributed Structured Adaptive Mesh Refinement (SAMR) applications. The overall goal of these techniques is to enable the load distribution to reflect the state of the adaptive grid hierarchy and exploit it to reduce synchronization requirements, improve load-balance, and en...

This paper is aimed to propose a grid density clustering algorithm for spatio-temporal data that is based on the adaptation of the grid density based clustering algorithm. The algorithm is based on AGRID+ algorithm with 7 steps: partitioning, computing distance threshold, calculating densities, compensating densities, calculating density threshold (DT), clustering and removing noises. The adapt...