Search results for "Parallel"
showing 10 items of 667 documents
An Evolution of the Non-Parameter Harris Affine Corner Detector: A Distributed Approach
2009
A parallel version of a new automatic Harris-based corner detector is presented. A scheduler to dynamically and homogeneously distribute high computational workload on heterogeneous parallel architectures such as Grid systems has been implemented to speedup the whole procedure. Experimental results show the robustness of the underlying scheduler, which can be easily exploited in various automatic image analysis systems.
Embedded Coprocessors for Native Execution of Geometric Algebra Operations
2016
Clifford algebra or geometric algebra (GA) is a simple and intuitive way to model geometric objects and their transformations. Operating in high-dimensional vector spaces with significant computational costs, the practical use of GA requires dedicated software and/or hardware architectures to directly support Clifford data types and operators. In this paper, a family of embedded coprocessors for the native execution of GA operations is presented. The paper shows the evolution of the coprocessor family focusing on the latest two architectures that offer direct hardware support to up to five-dimensional Clifford operations. The proposed coprocessors exploit hardware-oriented representations o…
The egoistic approach to parallel process migration into heterogeneous workstation network
1996
Abstract A new approach to the allocation of processes in a distributed system is discussed. The proposed solution deals with process migration into heterogeneous systems by means of a strategy that delegates the individual parallel applications to manage the migration of their processes by themselves, on the basis of their own performance objectives. This approach is discussed in opposition to the global scheduling based one, and the load balancing objective is pursued as an effect of the optimization of individual applications. A new performance evaluation criterion is introduced that consists in monitoring the delays that occur when two parallel processes run towards a common synchroniza…
Job shop scheduling by a parallel approach
1993
The paper deals with a parallel approach to job shop scheduling by a branch and bound methodology using the lower bound proposed by Ashour and Hiremath. The optimal solution is achieved by an iterative-reductive strategy. At each iteration the algorithm investigates the conflict intervals and it selects a subset of the possible solutions. The makespan value, achieved by the parallel processes, gives the upper limit for the admissible lower bound of the intermediate solutions. Furthermore the best makespan reached by each iteration is reused as a filter to reduce the complexity of the next iteration. The computation is speeded up by a parallel implementation, giving the possibility of distri…
Stragi
2006
Si ripercorre la vicenda delle stragi che hanno insanguinato il nostro Paese a partire dall'immediato secondo dopoguerra fino ai primi anni '90, mettendo in luce trame di potere i cui attori non sono stati ancora identificati.
Trattativa
2006
Se – come emerge dalle più recenti inchieste della magistratura – Cosa Nostra mantiene ancora oggi il controllo su un’estesa area del territorio nazionale, condizionandone le scelte politiche, soggiogandone l’economia e veicolando un’ingente mole di flussi finanziari dentro e fuori i confini dell’economia nazionale attraverso complesse operazioni di riciclaggio, allora è plausibile ipotizzare anche uno scenario in cui l’organizzazione mafiosa sia indotta a interferire direttamente – e non più in via mediata – con il mondo della politica e delle istituzioni, aspirando a proporsi quale autorevole soggetto politico, forte al punto da impegnare i poteri istituzionali in una trattativa, in una n…
A Spatial-Temporal Correlation Approach for Data Reduction in Cluster-Based Sensor Networks
2019
International audience; In a resource-constrained Wireless Sensor Networks (WSNs), the optimization of the sampling and the transmission rates of each individual node is a crucial issue. A high volume of redundant data transmitted through the network will result in collisions, data loss, and energy dissipation. This paper proposes a novel data reduction scheme, that exploits the spatial-temporal correlation among sensor data in order to determine the optimal sampling strategy for the deployed sensor nodes. This strategy reduces the overall sampling/transmission rates while preserving the quality of the data. Moreover, a back-end reconstruction algorithm is deployed on the workstation (Sink)…
Information Processing Schemes Based on Monolayer Protected Metallic Nanoclusters
2011
Nanostructures are potentially useful as building blocks to complement future electronics because of their high versatility and packing densities. The fabrication and characterization of particular nanostructures and the use of new theoretical tools to describe their properties are receiving much attention. However, the integration of these individual systems into general schemes that could perform simple tasks is also necessary because modern electronics operation relies on the concerted action of many basic units. We review here new conceptual schemes that can allow information processing with ligand or monolayer protected metallic nanoclusters (MPCs) on the basis of the experimentally de…
Faster GPU-Accelerated Smith-Waterman Algorithm with Alignment Backtracking for Short DNA Sequences
2014
In this paper, we present a GPU-accelerated Smith-Waterman (SW) algorithm with Alignment Backtracking, called GSWAB, for short DNA sequences. This algorithm performs all-to-all pairwise alignments and retrieves optimal local alignments on CUDA-enabled GPUs. To facilitate fast alignment backtracking, we have investigated a tile-based SW implementation using the CUDA programming model. This tiled computing pattern enables us to more deeply explore the powerful compute capability of GPUs. We have evaluated the performance of GSWAB on a Kepler-based GeForce GTX Titan graphics card. The results show that GSWAB can achieve a performance of up to 56.8 GCUPS on large-scale datasets. Furthermore, ou…
SWAPHI: Smith-Waterman Protein Database Search on Xeon Phi Coprocessors
2014
The maximal sensitivity of the Smith-Waterman (SW) algorithm has enabled its wide use in biological sequence database search. Unfortunately, the high sensitivity comes at the expense of quadratic time complexity, which makes the algorithm computationally demanding for big databases. In this paper, we present SWAPHI, the first parallelized algorithm employing Xeon Phi coprocessors to accelerate SW protein database search. SWAPHI is designed based on the scale-and-vectorize approach, i.e. it boosts alignment speed by effectively utilizing both the coarse-grained parallelism from the many co-processing cores (scale) and the fine-grained parallelism from the 512-bit wide single instruction, mul…