15485 search results - page 2732 / 3097 » Computing Optimal Subsets |
170
click to vote
LCPC
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. As processor complexity increases compilers tend to deliver suboptimal performance. Library generators such as ATLAS, FFTW and SPIRAL overcome this issue by empirically s...
174
click to vote
PVM
2005
Springer
16 years 7 days ago
2005
Springer
We present design and implementation details as well as performance results for two new parallel checkpointing libraries developed by us for parallel MPI applications. The first o...
167
click to vote
PVM
2005
Springer
16 years 7 days ago
2005
Springer
We present an algorithm for implementing byte-range locks using MPI passive-target one-sided communication. This algorithm is useful in any scenario in which multiple processes of ...
172
click to vote
ACMMSP
2004
ACM
16 years 5 days ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
159
click to vote
ASPDAC
2004
ACM
16 years 5 days ago
2004
ACM
Abstract We propose a novel approach to preserve the synchronizing sequences of a circuit after retiming. The significance of this problem stems from the necessity of maintaining c...