573 search results - page 112 / 115 » Parallel Algorithms for Dandelion-Like Codes |
IEEEPACT
2006
IEEE
14 years 19 days ago
2006
IEEE
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
ICS
2004
Tsinghua U.
13 years 12 months ago
2004
Tsinghua U.
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...
WWW
2007
ACM
14 years 7 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
ICS
2007
Tsinghua U.
14 years 22 days 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...
IEEEPACT
2006
IEEE
14 years 19 days ago
2006
IEEE
This paper presents an automated performance tuning solution, which partitions a program into a number of tuning sections and finds the best combination of compiler options for e...