Sciweavers

114 search results - page 9 / 23
» Dynamic prediction of collection yield for managed runtimes
Sort
View
WOSP
2010
ACM
15 years 4 months ago
A page fault equation for dynamic heap sizing
For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to autom...
Y. C. Tay, X. R. Zong
106
Voted
CCGRID
2008
IEEE
14 years 11 months ago
Scheduling Dynamic Workflows onto Clusters of Clusters using Postponing
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
Sascha Hunold, Thomas Rauber, Frédér...
EUROSYS
2009
ACM
15 years 6 months ago
Koala: a platform for OS-level power management
Managing the power consumption of computing platforms is a complicated problem thanks to a multitude of hardware configuration options and characteristics. Much of the academic r...
David C. Snowdon, Etienne Le Sueur, Stefan M. Pett...
PODC
2010
ACM
15 years 1 months ago
Adaptive system anomaly prediction for large-scale hosting infrastructures
Large-scale hosting infrastructures require automatic system anomaly management to achieve continuous system operation. In this paper, we present a novel adaptive runtime anomaly ...
Yongmin Tan, Xiaohui Gu, Haixun Wang
OOPSLA
2004
Springer
15 years 2 months ago
The garbage collection advantage: improving program locality
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
Xianglong Huang, Stephen M. Blackburn, Kathryn S. ...