Sciweavers

22 search results - page 1 / 5
» Using Dynamic Tracing Sampling to Measure Long Running Progr...
Sort
View
SC
2005
ACM
13 years 10 months ago
Using Dynamic Tracing Sampling to Measure Long Running Programs
Ø Ð × ÑÙÐ Ø ÓÒ Ò Ù× ÙÐ ØÓ ÓØ ×Ý×Ø Ñ ¹ Ú ÐÓÔ Ö× Ò ÔÔÐ Ø ÓÒ ÛÖ Ø Ö× ØÓ ÙÒ Ö×Ø Ò Ò ÔÔÐ ¹ Ø ÓÒ³× Ô Ö ÓÖÑ Ò º ÀÓÛ ...
Jeffrey Odom, Jeffrey K. Hollingsworth, Luiz De Ro...
SIGSOFT
2006
ACM
14 years 5 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
CGO
2003
IEEE
13 years 9 months ago
Dynamic Trace Selection Using Performance Monitoring Hardware Sampling
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...
Howard Chen, Wei-Chung Hsu, Dong-yuan Chen
ISSTA
2012
ACM
11 years 6 months ago
Measuring enforcement windows with symbolic trace interpretation: what well-behaved programs say
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
Devin Coughlin, Bor-Yuh Evan Chang, Amer Diwan, Je...
IPPS
1999
IEEE
13 years 8 months ago
Dynamically Scheduling the Trace Produced During Program Execution into VLIW Instructions
VLIW machines possibly provide the most direct way to exploit instruction level parallelism; however, they cannot be used to emulate current general-purpose instruction set archit...
Alberto Ferreira de Souza, Peter Rounce