A new partitioning method for complex 3-D hybrid prismatic/tetrahedral meshes is presented, The method uses an orthogonal recursive bisection approach on a special octree corresponding to the hybrid grid. The octree is generated automatically and handles any type of 3-D geometry and domain connectivity. It is employed for partitioning of static, as well as dynamic adaptive meshes. The method yi...

Power grid partition is a major problem in power markets based on zonal marginal price (ZMP). As the preparation of modeling, the zone of a node set is defined as the minimum-girthed convex polygon containing these nodes, and a theorem judging common nodes between two zones of node sets is proposed. Then, the power-grid-partitioning problem is described as a combinatorial optimization model, an...

We present a distributed version of IDA* search algorithm for a computational grid. We also propose a grid architecture based on a multi-agent system paradigm applied to mobile devices on a cellular network. The proposed algorithm is specifically designed to adapt to the flexible environment of the grid. In this paper, we discuss several aspects of the distributed IDA* algorithm and the underly...

This paper examines grid-clustering method. Unlike the conventional methods, this method organizes the space surrounding the patterns. It uses a multidimensional grid data structure. The resulting block partitioning of the value space is clustered via a neighbor search. The mathematical description of the algorithms employed is given. Some case studies and ideas how to use the algorithms are de...

We present an eecient method for the partitioning of rectangular domains into equi-area sub-domains of minimum total perimeter. For a variety of applications in parallel computation, this corresponds to a load-balanced distribution of tasks that minimize interprocessor communication. Our method is based on utilizing, to the maximum extent possible, a set of optimal shapes for sub-domains. We pr...

This paper studies a special instance of the graph partitioning problem motivated by an application in parallel processing. When a parallel computation is represented by a weighted task graph, we consider the problem of mapping each node in the graph to a processor in a linear array. We focus on a particular type of computation, a grid structured computation (GSC), where the task graph is a gri...

A number of known techniques for improving cache performance in scientific computations involve the reordering of the iteration space. Some of these reorderings can be considered as coverings of the iteration space with the sets having good surface-to-volume ratio. Use of such sets reduces the number of cache misses in computations of local operators having the iteration space as a domain. We s...

In recent years, a number of data structures for global geo-referenced data sets have been proposed based on regular, multi-resolution partitions of polyhedra. We present a survey of the most promising of such systems, which we call Geodesic Discrete Global Grid Systems (Geodesic DGGSs). We show that Geodesic DGGS alternatives can be constructed by specifying five substantially independent desi...

The problem of partitioning irregular graphs and meshes for parallel computations on homogeneous systems has been extensively studied. However, these partitioning schemes fail when the target system architecture exhibits heterogeneity in resource characteristics. With the emergence of technologies such as the Grid, it is imperative to study the partitioning problem taking into consideration the...