Sciweavers

27 search results - page 2 / 6
» k-ary search on modern processors
Sort
View
HPDC
2006
IEEE
13 years 11 months ago
Exploring I/O Strategies for Parallel Sequence-Search Tools with S3aSim
Parallel sequence-search tools are rising in popularity among computational biologists. With the rapid growth of sequence databases, database segmentation is the trend of the futu...
Avery Ching, Wu-chun Feng, Heshan Lin, Xiaosong Ma...
AIPS
2009
13 years 6 months ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
ASAP
2004
IEEE
124views Hardware» more  ASAP 2004»
13 years 9 months ago
Biosequence Similarity Search on the Mercury System
Biosequence similarity search is an important application in modern molecular biology. Search algorithms aim to identify sets of sequences whose extensional similarity suggests a c...
Praveen Krishnamurthy, Jeremy Buhler, Roger D. Cha...
MICRO
2006
IEEE
89views Hardware» more  MICRO 2006»
13 years 11 months ago
DMDC: Delayed Memory Dependence Checking through Age-Based Filtering
One of the main challenges of modern processor design is the implementation of a scalable and efficient mechanism to detect memory access order violations as a result of out-of-o...
Fernando Castro, Luis Piñuel, Daniel Chaver...
PDP
2006
IEEE
13 years 11 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak