This study describes a method for InSAR/PS-InSAR processing using parallelization algorithms. The InSAR/PS-InSAR processing chain is analyzed from the aspect of the computational load, which results in a specific parallelization model. The theoretical concept for the porting of Delft Object-oriented Radar Interferometric Software (Doris) into a parallel computational environment is described. T...

Kervaire’s proof does not provide an explicit parallelization on products of spheres. The only reference the author knows to provide explicit parallelizations is [Bru92], that considers the cases when one of the spheres is of dimension 1, 3, 5, 7, and uses some specific arguments of these low dimensions. In [Bru92] the general case is left as an open problem. The aim of this paper is to write a...

We investigate the benefits of Tree Parallelization on a cluster for our General Game Playing program Ary. As the Tree parallelization of Monte-Carlo Tree Search works well when playouts are slow, it is of interest for General Game Playing programs, as the interpretation of game description takes a large proportion of the computing time, when compared with program designed to play specific game...

The purpose of the work reported on is two-fold: The optimization of large-scale earth science applications and the evaluation of the use of automatic parallelization tools. We have applied the CAPO computer aided parallelization tool developed at the NASA Ames Research Center to the Goddard Cumulus Ensemble (GCE) cloud modeling code. We describe how the tool was used for OpenMP parallelization...

The key function parts of an XML query system include XML parsing, XPath and XQuery evaluation. Each part has its specific parallel opportunity and approach. And the efficiency of each part directly affects the overall effect of XML query parallelization. Therefore it is necessary to coordinate each part in a real query application to achieve the best overall parallel performance. In this paper...

The purpose of this paper is to propose effective parallelization strategies for the Ant Colony Optimization (ACO) metaheuristic on Graphics Processing Units (GPUs). The Max–Min Ant System (MMAS) algorithm augmented with 3-opt local search is used as a framework for the implementation of the parallel ants and multiple ant colonies general parallelization approaches. The four resulting GPU algor...

Parallelization of existing code for modern multicore processors is tedious as the person performing these tasks must understand the algorithms, data structures and data dependencies in order to do a good job. Current options available to the programmer include either automatic parallelization or a complete rewrite in a parallel programming language. However, there are limitations with these op...

D> A framework for the automatic parallelization of (constraint) logic programs is proposed and proved correct. Intuitively, the parallelization process replaces conjunctions of literals with parallel expressions. Such expressions trigger at run-time the exploitation of restricted, goal-level, independent and-parallelism. The parallelization process performs two steps. The first one builds a co...

Mathematical models for optimization can help companies optimizing their production and planning processes and therefore to reduce costs and increase quality. But applying such models effectively is challenging. Developers need expertise in mathematics and skills in software development to implement them. Furthermore optimization algorithms are inherently computationally very intensive. Paralle...

This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuri...