Sciweavers

522 search results - page 18 / 105
» Fast Smith-Waterman hardware implementation
Sort
View
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
13 years 2 months ago
Hardware Support for Relaxed Concurrency Control in Transactional Memory
Today's transactional memory systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict happens. 2PL is a simple algorithm that pr...
Utku Aydonat, Tarek S. Abdelrahman
ICCD
1997
IEEE
140views Hardware» more  ICCD 1997»
13 years 12 months ago
Parallel-Array Implementations of a Non-Restoring Square Root Algorithm
In this paper, we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQ...
Yamin Li, Wanming Chu
MICRO
2009
IEEE
132views Hardware» more  MICRO 2009»
14 years 2 months ago
EazyHTM: eager-lazy hardware transactional memory
Transactional Memory aims to provide a programming model that makes parallel programming easier. Hardware implementations of transactional memory (HTM) suffer from fewer overhead...
Sasa Tomic, Cristian Perfumo, Chinmay Eishan Kulka...
VTS
2005
IEEE
96views Hardware» more  VTS 2005»
14 years 1 months ago
Implementing a Scheme for External Deterministic Self-Test
A new method for test resource partitioning is introduced which keeps the design-for-test logic independent of the test set and moves the test pattern dependent information to an ...
Abdul Wahid Hakmi, Hans-Joachim Wunderlich, Valent...
GECCO
2009
Springer
241views Optimization» more  GECCO 2009»
14 years 9 days ago
A fast high quality pseudo random number generator for nVidia CUDA
Previously either due to hardware GPU limits or older versions of software, careful implementation of PRNGs was required to make good use of the limited numerical precision availa...
William B. Langdon