1024 search results - page 64 / 205 » Complexity and Performance in Parallel Programming Languages |
98
Voted
ISCOPE
1999
Springer
15 years 4 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
141
click to vote
ICS
1994
Tsinghua U.
15 years 4 months ago
1994
Tsinghua U.
This paper describes the design of a compiler which can translate out-of-core programs written in a data parallel language like HPF. Such a compiler is required for compiling larg...
95
Voted
WMPI
2004
ACM
15 years 6 months ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
With the increasing trend of microprocessor manufacturers to rely on parallelism to increase their products’ performance, there is an associated increasing need for simple techn...
94
Voted
ICS
2009
Tsinghua U.
15 years 7 months ago
2009
Tsinghua U.
Power and energy are first-order design constraints in high performance computing. Current research using dynamic voltage scaling (DVS) relies on trading increased execution time...