the present paper investigates the advantages of a new class of composite grid structures over conventional grids. thus far, a known grid structure such as orthogrid or isogrid has been used as an orthotropic layer with at most in-plane anisotropy. the present laminated grid is composed of various numbers of thin composite grid layers. the stiffness of the structure can be adjusted by choosing ...

An ACO Inspired Strategy to Improve Jobs Scheduling in a Grid Environment p. 30 Architecture Aware Partitioning Algorithms p. 42 A Simple and Efficient Fault-Tolerant Adaptive Routing Algorithm for Meshes p. 54 Deadlock-Free Adaptive Routing in 2D Tori with a New Turn Model p. 58 Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph p. 70 Fault Tolerance in the Biswapped Network ...

This paper examine that the geographic routing protocols are used in the mobile ad hoc networks. In routing protocols defines that each node identify the position of one hop neighbours, and also the packets are forwarded to a neighbours that is closer to the destination. This forwarding strategy should prevent radio communications between node. However, inexpensive position devices do not provi...

The parallelization of the solution algorithm for the set of continuity, Navier–Stokes and turbulence model equations is carried out by parallelization in space, that means by application of the domain decomposition or grid partitioning method. Using a block-structured grid the flow domain is partitioned in a number of subdomains. Usually the number of grid blocks exceeds the number of processo...

A highly parallelizable domain decomposition solution technique for adaptive hp finite element methods is developed. The technique uses good partitioning strategies and a subspace decomposition based preconditioned iterative solver, Two level orthogonalization is used to obtain a reduced system which is preconditioned by a coarse grid operator. Numerical results show fast cOIl\'ergence for the ...

We present a block data decomposition algorithm for two-dimensional grid problems. Our method includes load balancing to accommodate heterogeneous processors, and we characterize the conditions that must be met for our partitioning strategy to be of value. While we concentrate on the workstation network model of parallel processing because of its high communication costs and inherent heterogene...

With the enormous amount of data available for geographic spatial analysis, parallel processing enhances the capabilities for processing large amounts of data and intensive computer bound algorithms. The author examines data structures, load balancing, data partitioning, algorithms, and performance for Geographic Information/Imaging Systems. The R-tree data structure and Triangulated Irregular ...

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 NP -hard problem and heuristics are needed. In this paper a parallelisable and cheap method based on space-filling curves is analysed....

[1] This is a study to examine the impact of modeling photochemistry from aircraft emissions in an expanding plume versus at the grid scale in an atmospheric model. Differences in model treatments for a single flight occurred at all altitudes during takeoff, cruise, and landing. After 10 h, the plume treatment decreased grid-scale ozone production by 33%, methane destruction by 30%, and carbon ...

background: in conventional radiation therapy, regarding normal tissue tolerance, the treatment of bulk tumors is one of the remaining challenges. grid radiation therapy (grt) is a technique to deliver high doses, approximately 15 – 20 gy per fraction, to several small volumes located in a large radiation field. this can be performed using a grid block. the current work has concentrated on the ...