Sciweavers

1182 search results - page 21 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
POPL
2007
ACM
14 years 7 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
ICS
2005
Tsinghua U.
14 years 1 months ago
A performance-conserving approach for reducing peak power consumption in server systems
The combination of increasing component power consumption, a desire for denser systems, and the required performance growth in the face of technology-scaling issues are posing eno...
Wesley M. Felter, Karthick Rajamani, Tom W. Keller...
DAC
2007
ACM
14 years 8 months ago
A Self-Tuning Configurable Cache
The memory hierarchy of a system can consume up to 50% of microprocessor system power. Previous work has shown that tuning a configurable cache to a particular application can red...
Ann Gordon-Ross, Frank Vahid
KBSE
2005
IEEE
14 years 1 months ago
Optimized run-time race detection and atomicity checking using partial discovered types
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...
Rahul Agarwal, Amit Sasturkar, Liqiang Wang, Scott...
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...