Sciweavers

27 search results - page 1 / 6
» k-ary search on modern processors
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 6 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
DAMON
2009
Springer
14 years 8 days ago
k-ary search on modern processors
This paper presents novel tree-based search algorithms that exploit the SIMD instructions found in virtually all modern processors. The algorithms are a natural extension of binar...
Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner
IEEECIT
2007
IEEE
14 years 5 months ago
Indirect Tag Search Mechanism for Instruction Window Energy Reduction
Instruction window is a key component which extracts Instruction Level Parallelism (ILP) in modern out-of-order microprocessors. In order to exploit ILP for improving processor pe...
Shingo Watanabe, Akihiro Chiyonobu, Toshinori Sato
HPCC
2007
Springer
14 years 5 months ago
Parallel Genetic Algorithms for DVS Scheduling of Distributed Embedded Systems
Many of today’s embedded systems, such as wireless and portable devices rely heavily on the limited power supply. Therefore, energy efficiency becomes one of the major design con...
Man Lin, Chen Ding
IEEEPACT
2008
IEEE
14 years 5 months ago
A tuning framework for software-managed memory hierarchies
Achieving good performance on a modern machine with a multi-level memory hierarchy, and in particular on a machine with software-managed memories, requires precise tuning of progr...
Manman Ren, Ji Young Park, Mike Houston, Alex Aike...