60 search results - page 7 / 12 » DPF: A Data Parallel Fortran Benchmark Suite |
IEEEPACT
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
SC
2004
ACM
14 years 2 months ago
2004
ACM
Programmers of message-passing codes for clusters of workstations face a daunting challenge in understanding the performance bottlenecks of their applications. This is largely due...
PPOPP
2012
ACM
12 years 4 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
ICS
2005
Tsinghua U.
14 years 2 months ago
2005
Tsinghua U.
Supercomputer architects strive to maximize the performance of scientific applications. Unfortunately, the large, unwieldy nature of most scientific applications has lead to the...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Data prefetching has been widely used in the past as a technique for hiding memory access latencies. However, data prefetching in multi-threaded applications running on chip multi...