173 search results - page 10 / 35 » Loop Parallelization Algorithms: From Parallelism Extraction... |
ICS
2000
Tsinghua U.
14 years 5 hour ago
2000
Tsinghua U.
Processing and analyzing large volumes of data plays an increasingly important role in many domains of scienti c research. High-level language and compiler support for developing ...
EUROPAR
1997
Springer
14 years 17 days ago
1997
Springer
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...
PPOPP
1999
ACM
14 years 22 days 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...
CODES
2010
IEEE
13 years 6 months ago
2010
IEEE
The last years have shown that there is no way to disregard the advantages provided by multiprocessor System-on-Chip (MPSoC) architectures in the embedded systems domain. Using mu...
CGO
2010
IEEE
14 years 3 months ago
2010
IEEE
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...