146 search results - page 6 / 30 » Automatic Optimization of Parallel Dataflow Programs |
233
click to vote
PLDI
1993
ACM
15 years 10 months ago
1993
ACM
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
198
Voted
CC
2008
Springer
15 years 7 months ago
2008
Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
199
Voted
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Today’s parallel computers with SMP nodes provide both multithreading and message passing as their modes of parallel execution. As a consequence, performance analysis a...
163
Voted
OSDI
1994
ACM
15 years 7 months ago
1994
ACM
A fine-grain parallel program is one in which processes are typically small, ranging from a few to a few hundred instructions. Fine-grain parallelism arises naturally in many situ...
175
click to vote
TPDS
1998
15 years 5 months ago
1998
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...