The most common parallelization strategy for many Computational Mechanics (typified by Computational Fluid Dynamics(CFD) applications) which use structured grids, involves the one directional partition based upon slads of grids. For parallelised versions of CFD codes to scale well we must employ two (or more) dimensional partitions. However, FORTRAN code implementations by multi-directional par...

This paper addresses two key parallelization challenges the unstructured mesh-based ocean modeling code, MPAS-Ocean, which uses a mesh based on Voronoi tessellations: (1) load imbalance across processes, and (2) unstructured data access patterns, that inhibit intraand inter-node performance. Our work analyzes the load imbalance due to naive partitioning of the mesh, and develops methods to gene...

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

To circumvent a potentially dense two-body interaction tensor and obtain lower asymptotic costs for quantum simulations of chemistry, the discontinuous Galerkin (DG) basis set with rectangular partitioning strategy was recently introduced [McClean et al, New J. Phys. 22, 093015, 2020]. We propose numerically scrutinize more general DG construction based on Voronoi decomposition respect to nucle...

We present a flexible parallel implementation of the exhaustive grid search algorithm for multidimensional QTL mapping problems. A generic, parallel algorithm is presented and a two-level scheme is introduced for partitioning the work corresponding to the independent computational tasks in the algorithm. At the outer level, a static blockcyclic partitioning is used, and at the inner level a dyn...

In this paper we introduce an abstract data type for the distributed representation and eecient handling of sparse grids on parallel architectures. The new data layout, implemented by means of the PVM message passing library, provides partitioning and dynamic load balancing transparent to the application making use of it. This enables parallelization of sequential partial diierential equations ...

In this paper we try to achieve h-independent convergence with preconditioned GMRES ((3]) and BiCGSTAB ((4]) for 2D singular perturbed equations. Three recently developed multigrid methods are adopted as preconditioner. They are also used as solution methods in order to compare the performance of the methods as solvers and as preconditioners. Two of the multigrid methods diier only in the trans...

This paper addresses the runtime management of spatial and temporal heterogeneity in both, scientific applications and geographically distributed resources in Grid computing environments. The targeted applications are large-scale dynamic Grid applications which require large amount of computational resources typically spanning multiple sites and exhibit very long execution times. An adaptive ru...

This paper explores the design, coupling, and application of algorithms relying on grid-based or voxel-based representations of buildings. Such algorithms may encourage the adoption of building performance simulation in design practice by avoiding the timeconsuming and somewhat arbitrary process of manually partitioning a building’s interior into polyhedral spaces. They also support detailed vi...

The virtualization of resources in SMP machines with Xen offers automatic round-robin based coarse-grain assignment of VMs to physical processors and manual assignment via privileged commands. However, two problems can arise in Grid environments: (1) if Xen’s sEDF scheduler assigns the VMs, then some processors could be over or underutilized and the VMs could receive more resources than specifi...