304 search results - page 31 / 61 » Programmable memory blocks supporting content-addressable me... |
117
Voted
PPOPP
2009
ACM
16 years 3 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
134
Voted
PARA
2004
Springer
15 years 8 months ago
2004
Springer
During the last half-decade, a number of research efforts have centered around developing software for generating automatically tuned matrix multiplication kernels. These include ...
111
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
156
Voted
IPPS
2010
IEEE
15 years 15 days ago
2010
IEEE
There is building interest in using FPGAs as accelerators for high-performance computing, but existing systems for programming them are so far inadequate. In this paper we propose...
125
Voted
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...