The cost/performance ratio of networks of workstations has been constantly improving. This trend is expected to continue in the near future. The aggregate peak rate of such systems often matches or exceeds the peak rate offered by the fastest parallel computers. This has motivated research toward using a network of computers, interconnected via a fast network (cluster system) or a simple Local ...

This paper presents an experimental evaluation of a suite of dynamic partitioning/load-balancing techniques for adaptive grid hierarchies that underlie parallel structured adaptive mesh re nement applications. Partitioners evaluated include those included in popular software libraries such as GrACE, Vampire, and ParMetis. The overall goal of the research presented in the paper is an application...

In this paper we present the parallel implementation of the Princeton Ocean Model (POM) using message passing. Domain decomposition techniques are used for the horizontal discretization whereas in the vertical direction each column per grid point is computed. The required interprocessor communication was implemented on the PVM message passing library. Three different data partitioning schemes a...

The Computational Grid has emerged as an attractive platform for developing large-scale distributed applications that run on heterogeneous computing resources. This scalability, however, comes at the cost of increased complexity: each application has to handle the details of resource provisioning and data and task scheduling. To address this problem, we present GRID*p an interactive parallel sy...

in order to determine probable effects of sowing dates on partitioning coefficient of dry matter to different organs (leaf, stem and reproductive organs) in different wheat varieties (koohdasht, zagros and tajan) an experiment with crbd design and four replications was conducted. 5 sowing dates were included (29 december, 2007, 30 january, 2 march, 27 march, 1may, 2008). in order to quantify pa...

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 presents a comparative study between three versions of adaptive neuro-fuzzy inference system (anfis) algorithms and a pseudo-forward equation (pfe) to characterize the north sea reservoir (f3 block) based on seismic data. according to the statistical studies, four attributes (energy, envelope, spectral decomposition and similarity) are known to be useful as fundamental attributes in ...

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 ...

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...

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 ...