155 search results - page 3 / 31 » On the Automatic Parallelization of the Perfect Benchmarks |
IPPS
1998
IEEE
13 years 10 months ago
1998
IEEE
This study1 explores the applicability of fully automatic parallelizing techniques for parallel computers. In this study, we capitalize on a variety of traditional compiling techn...
IPPS
1999
IEEE
13 years 10 months ago
1999
IEEE
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
EUROPAR
2000
Springer
13 years 10 months ago
2000
Springer
This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (patter...
PKC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
ICS
2009
Tsinghua U.
14 years 1 months ago
2009
Tsinghua U.
Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multilevel tiled code is essential for maximizing da...