We propose a new similarity-based technique for declustering data. The proposed method can adapt to available information about query distributions, data distributions, data sizes and partition-size constraints. The method is based on max-cut partitioning of a similarity graph deened over the given set of data, under constraints on the partition sizes. It maximizes the chances that a pair of da...

Systematic parallelization of sequential programs remains a major challenge in parallel computing Traditional approaches using pro gram schemes tend to be narrower in scope as the properties which en able parallelism are di cult to capture via ad hoc schemes In CTH a systematic approach to parallelization based on the notion of preserv ing the context of recursive sub terms has been proposed Th...

Approaches for the Parallelization of Software Implementation of Integer Multiplication In this paper there are considered several approaches for the increasing performance of software implementation of integer multiplication algorithm for the 32-bit & 64-bit platforms via parallelization. The main idea of algorithm parallelization consists in delayed carry mechanism using which authors have pr...

The paper analyzes the performance of parallel global optimization algorithm, which is used to optimize grillage-type foundations. The parallel algorithm is obtained by using the automatic parallelization tool. We describe briefly the layer structure of the Master–Slave Template library and present a detailed mathematical formulation of the application problem. Experiments are done on the homog...

Complete Parallelization of Computations: Integration of Data Partitioning and Functional Parallelism for Dynamic Data Structures J.C. Browne, Dwip Banerjee1 Department of Computer Sciences University of Texas Austin, Texas Abstract: This paper presents a parallel programming system which i) supports complete parallelization of array oriented computations through a coherent integration of data ...

This paper proposes an automatic parallelizing compiler, JAVAR-KAI, which exploits parallelisms in a sequential Java program and translates into a multithreaded Java program. JAVAR-KAI compiler implemented two kinds of parallelizations, which are inner loop parallelization and outer loop parallelization. Experimental evaluations of multithreaded Java programs generated by JAVAR-KAI compiler sho...

.............................................................................................................................6 Declaration .........................................................................................................................7 Copyright ...........................................................................................................................8 ...

An evaluation for a parallel Particle-In-Cell code leveraging heterogeneous hardware is presented. Two parallelization strategies are investigated on Intel R © Xeon Phi TM coprocessors. Hybrid parallelization is implemented to support optional workload offloading to coprocessors. A performance model is applied to load balance heterogeneous setups. Performance measurements of a benchmark show th...

Software parallelization allows an eecient use of available computing power to increase the performance of applications. In a case study we have investigated the parallelization of high-energy physics event reconstruction software in terms of costs (eeort, computing resource requirements), beneets (performance increase), and the feasibility of a systematic parallelization approach. Guidelines f...