23 search results - page 2 / 5 » Automatic measurement of memory hierarchy parameters |
EUROPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. A choice of a cost-effective cluster computing platform ...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
CIDR
2007
13 years 6 months ago
2007
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
CIKM
2006
Springer
13 years 8 months ago
2006
Springer
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...