86 search results - page 17 / 18 » Custom Data Layout for Memory Parallelism |
CCGRID
2011
IEEE
12 years 8 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
ICS
2007
Tsinghua U.
13 years 11 months ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
SIGGRAPH
1993
ACM
13 years 9 months ago
1993
ACM
A physically compact, low cost, high performance 3D graphics accelerator is presented. It supports shaded rendering of triangles and antialiased lines into a double-buffered 24-bi...
ICPP
1998
IEEE
13 years 9 months ago
1998
IEEE
Many large scale applications, have significant I/O requirements as well as computational and memory requirements. Unfortunately, limited number of I/O nodes provided by the conte...
ISPASS
2006
IEEE
13 years 11 months ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...