874 search results - page 124 / 175 » Predicting the Running Times of Parallel Programs by Simulat... |
101
click to vote
ICPP
1998
IEEE
15 years 2 months ago
1998
IEEE
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
ICS
2009
Tsinghua U.
15 years 4 months ago
2009
Tsinghua U.
Molecular Dynamics applications enhance our understanding of biological phenomena through bio-molecular simulations. Large-scale parallelization of MD simulations is challenging b...
ISCA
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper presents core fusion, a reconfigurable chip multiprocessor (CMP) architecture where groups of fundamentally independent cores can dynamically morph into a larger CPU, ...
ML
2002
ACM
14 years 9 months ago
2002
ACM
The execution order of a block of computer instructions on a pipelined machine can make a difference in running time by a factor of two or more. Compilers use heuristic schedulers...
ICDCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Wireless sensor networks (WSNs) are difficult to program and usually run statically-installed software limiting its flexibility. To address this, we developed Agilla, a new midd...