535 search results - page 49 / 107 » The Cache Performance and Optimizations of Blocked Algorithm... |
SIGGRAPH
1994
ACM
15 years 3 months ago
1994
ACM
FBRAM, a new form of dynamic random access memory that greatly accelerates the rendering of Z-buffered primitives, is presented. Two key concepts make this acceleration possible. ...
ASPLOS
1994
ACM
15 years 3 months ago
1994
ACM
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
WWW
2005
ACM
16 years 14 days ago
2005
ACM
While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the i...
192
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream syst...
109
click to vote
PPOPP
1999
ACM
15 years 4 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...