Search results for "Parallelism"
showing 10 items of 44 documents
Pairwise DNA Sequence Alignment Optimization
2015
This chapter presents a parallel implementation of the Smith-Waterman algorithm to accelerate the pairwise alignment of DNA sequences. This algorithm is especially computationally demanding for long DNA sequences. Parallelization approaches are examined in order to deeply explore the inherent parallelism within Intel Xeon Phi coprocessors. This chapter looks at exploiting instruction-level parallelism within 512-bit single instruction multiple data instructions (vectorization) as well as thread-level parallelism over the many cores (multithreading using OpenMP). Between coprocessors, device-level parallelism through the compute power of clusters including Intel Xeon Phi coprocessors using M…
Portable Video Supercomputing
2004
As inexpensive imaging chips and wireless telecommunications are incorporated into an increasing array, of portable products, the need for high efficiency, high throughput embedded processing will become an important challenge in computer architecture. Videocentric applications, such wireless videoconferencing, real-time video enhancement and analysis, and new, immersive modes of distance education, will exceed the computational capabilities of current microprocessor and digital signal processor (DSP) architectures. A new class of embedded computers, portable video supercomputers, will combine supercomputer performance with the energy efficiency required for deployment in portable systems. …
Accelerating bioinformatics applications via emerging parallel computing systems [Guest editorial]
2015
The papers in this issue focus on advanced parallel computing systems for bioinformatics applications. This papers provide a forum to publish recent advances in the improvement of handling bioinformatics problems on emerging parallel computing systems. These systems can be characterized by exploiting different types of parallelism, including fine-grained versus coarse-grained and thread-level parallelism versus datalevel parallelism versus request-level parallelism. Hence, parallel computing systems based on multi- and many-core CPUs, many-core GPUs, vector processors, or FPGAs offer the promise to massively accelerate many bioinformatics algorithms and applications, ranging from computeint…
SWAPHI-LS: Smith-Waterman Algorithm on Xeon Phi coprocessors for Long DNA Sequences
2014
As an optimal method for sequence alignment, the Smith-Waterman (SW) algorithm is widely used. Unfortunately, this algorithm is computationally demanding, especially for long sequences. This has motivated the investigation of its acceleration on a variety of high-performance computing platforms. However, most work in the literature is only suitable for short sequences. In this paper, we present SWAPHI-LS, the first parallel SW algorithm exploiting emerging Xeon Phi coprocessors to accelerate the alignment of long DNA sequences. In SWAPHI-LS, we have investigated three parallelization approaches (naive, tiled, and distributed) in order to deeply explore the inherent parallelism within Xeon P…
Pure Functions in C: A Small Keyword for Automatic Parallelization
2017
AbstractThe need for parallel task execution has been steadily growing in recent years since manufacturers mainly improve processor performance by increasing the number of installed cores instead of scaling the processor’s frequency. To make use of this potential, an essential technique to increase the parallelism of a program is to parallelize loops. Several automatic loop nest parallelizers have been developed in the past such as PluTo. The main restriction of these tools is that the loops must be statically analyzable which, among other things, disallows function calls within the loops. In this article, we present a seemingly simple extension to the C programming language which marks fun…
Les Expressions Figées des Verbes Ser et Estar Suivies de Prép X
1996
The present work is based on the methodological setting of the LADL studies. In order to establish the body subject to analysis, we selected only the fixed phrases N0 ser/estar Prep X. In this way, we have collected 1138 expressions involving estar Prep X, and 534 with ser Prep X. In order to classify these expressions, we have grouped them according to the number and form of their complements. As to the part pertaining to semantics, the alphabetical indices have allowed us to establish that, concerning ser and estar, all the formal schemes exists for both Spanish and french, at least under the form of fixed expressions. As to the part concerning translation, we have attempted to mesure the…
A dialectal reading of the History of Translation
2013
La traducción de variedades dialectales es uno de los retos más difíciles y a la vez interesantes que enfrentan los traductores literarios. Si bien los aportes teóricos acerca de la traducción dialectal surgen principalmente a partir de 1960, el presente artículo propone una lectura histórica de la traductología desde la antigüedad hasta la primera mitad del siglo XX indagando acerca de las “implicaciones” que los grandes hitos traductológicos hubieran podido tener para la traducción de dialectos. Ya que los textos dialectales se conciben dentro de una jerarquización política de la lengua, se propone un paralelismo entre ‘dialecto-estándar’ y ‘lengua vernácula-lengua dominante’. Se rastrea …
Sentence judgments and the grammar of poetry: Linking linguistic structure and poetic effect
2018
The present article aims to show that the elicitation of intuitive literary-aesthetic sentence judgments taps into readers’ poetry-specific linguistic register, and how such judgment methods can be used to support and constrain future theory formation in experimental poetics. In two experiments, we examined effects of deviant and parallelistic linguistic features on readers’ grammatical and literary-aesthetic evaluation of single sentences.In Experiment 1, participants rated carefully selected and modified lines of German poetry for either acceptability or poeticity (n = 40 each) on a 7-point scale; original lines featured grammatical deviations that were absent in modified versions. All in…
Parallel Simulated Annealing: Getting Super Linear Speedups
2005
The study described in this paper tries to improve and combine different approaches that are able to speed up applications of the Simulated Annealing model. It investigates separately two main aspects concerning the degree of parallelism an implementation can egectively exploit at the initial andfinal periods of an execution. As for case studies, it deals with two implementations: the Job shop Scheduling problem and the poryblio selection problem. The paper reports the results of a large number of experiments, carried out by means of a transputer network and a hypercube system. They give useful suggestions about selecting the most suitable values of the intervention parameters to achieve su…
Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
2015
International audience; Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the state of the art. Computational results and statistical tests applied show that the proposed algorithm produces significantly better outcomes than the previous algorithm in shorter computing time.