Sciweavers

429 search results - page 1 / 86
» New Algorithms for SIMD Alignment
Sort
View
CC
2007
Springer
157views System Software» more  CC 2007»
13 years 11 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks
IEEEPACT
2007
IEEE
13 years 11 months ago
AA-Sort: A New Parallel Sorting Algorithm for Multi-Core SIMD Processors
Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both SIMD instructions and threadlevel parallelism. In this...
Hiroshi Inoue, Takao Moriyama, Hideaki Komatsu, To...
PLDI
2004
ACM
13 years 10 months ago
Vectorization for SIMD architectures with alignment constraints
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
Alexandre E. Eichenberger, Peng Wu, Kevin O'Brien
BMCBI
2011
12 years 8 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
PPAM
2007
Springer
13 years 11 months ago
Applying SIMD Approach to Whole Genome Comparison on Commodity Hardware
Abstract. Whole genome comparison compares (aligns) two genome sequences assuming that analogous characteristics may be found. In this paper, we present an SIMD version of the Smit...
Arpith C. Jacob, Marcin Paprzycki, Maria Ganzha, S...