Sciweavers

874 search results - page 124 / 175
» Predicting the Running Times of Parallel Programs by Simulat...
Sort
View
ICPP
1998
IEEE
15 years 7 months ago
A memory-layout oriented run-time technique for locality optimization
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 ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
ICS
2009
Tsinghua U.
15 years 10 months ago
Dynamic topology aware load balancing algorithms for molecular dynamics applications
Molecular Dynamics applications enhance our understanding of biological phenomena through bio-molecular simulations. Large-scale parallelization of MD simulations is challenging b...
Abhinav Bhatele, Laxmikant V. Kalé, Sameer ...
ISCA
2007
IEEE
208views Hardware» more  ISCA 2007»
15 years 9 months ago
Core fusion: accommodating software diversity in chip multiprocessors
This paper presents core fusion, a reconfigurable chip multiprocessor (CMP) architecture where groups of fundamentally independent cores can dynamically morph into a larger CPU, ...
Engin Ipek, Meyrem Kirman, Nevin Kirman, Jos&eacut...
113
Voted
ML
2002
ACM
114views Machine Learning» more  ML 2002»
15 years 2 months ago
Building a Basic Block Instruction Scheduler with Reinforcement Learning and Rollouts
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...
Amy McGovern, J. Eliot B. Moss, Andrew G. Barto
ICDCS
2005
IEEE
15 years 8 months ago
Rapid Development and Flexible Deployment of Adaptive Wireless Sensor Network Applications
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...
Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu