This paper presents a global analysis framework for determining the availability of data on a virtual processor grid. The data availability information obtained is useful for optimizing communication when generating SPMD programs for distributed address-space multi-processors. We introduce a new kind of array section descriptor, called an Available Section Descriptor, which represents the mappi...

Grid computing seeks to aggregate computing resources within an enterprise and leverage on resources you don’t own for compute-intensive applications. Geo-rectification is a process for correcting spatial location and orientation of a satellite image. This paper focuses on the parallelization of the computeintensive satellite image geo-rectification problem on a cluster grid. We discuss our app...

Ocean models have been used to study global phenomena such as the El Nino Southern Oscillation. The effects of El Nino are felt worldwide and are of importance to all segments of society. High resolution ocean models are being developed to run more sophisticated simulations. The demand for computing power is expected to increase drastically with the use of high resolution models. Running extend...

The functional performance model (FPM) of heterogeneous processors has proven to be more realistic than the traditional models because it integrates many important features of heterogeneous processors such as the processor heterogeneity, the heterogeneity of memory structure, and the effects of paging. Optimal 1D matrix partitioning algorithms employing FPMs of heterogeneous processors are alre...

Fast Internet connections and the widespread use of high performance graphic cards are making Distributed Virtual Environments very common nowadays. The architecture and behaviour of these systems are very similar to new grid computing applications where concepts as sharing and high scalability are extremely exploited. However, there are several key issues in these systems that should still be ...

Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfactory approximation ratios, and those that guarantee high quality ratios but are slow. In this article we prove that this tradeoff between running time and solution quality is unavoidable. For the problem a minimum number of edges in a graph need to be found that, when c...

In addition to high compression efficiency, future still and moving image coding systems will require many other features. They include fidelity and resolution scalability, region of interest enhancement, random access decoding, resilience to errors due to channel noise or packet loss, fast encoding and/or decoding speed, and low computational and hardware complexity. Moreover, there are emergi...

In parallel simulations, partitioning and load-balancing algorithms compute the distribution of application data and work to processors. The effectiveness of this distribution greatly influences the performance of a parallel simulation. Decompositions that balance processor loads while keeping the application's communication costs low are preferred. Although a wide variety of partitioning and l...