Sciweavers

27 search results - page 5 / 6
» Optimized Pipelined Parallel Merge Sort on the Cell BE
Sort
View
HPCA
2012
IEEE
12 years 27 days ago
Power balanced pipelines
Since the onset of pipelined processors, balancing the delay of the microarchitectural pipeline stages such that each microarchitectural pipeline stage has an equal delay has been...
John Sartori, Ben Ahrens, Rakesh Kumar
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 5 months ago
Executing Stream Joins on the Cell Processor
Low-latency and high-throughput processing are key requirements of data stream management systems (DSMSs). Hence, multi-core processors that provide high aggregate processing capa...
Bugra Gedik, Philip S. Yu, Rajesh Bordawekar
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
LCTRTS
2009
Springer
14 years 2 days ago
Synergistic execution of stream programs on multicores with accelerators
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
Abhishek Udupa, R. Govindarajan, Matthew J. Thazhu...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 5 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang