Sciweavers

590 search results - page 17 / 118
» Debugging Program Loops Using Approximate Modeling
Sort
View
ASPLOS
1994
ACM
15 years 1 months ago
Compiler Optimizations for Improving Data Locality
In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effe...
Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
EMSOFT
2004
Springer
15 years 3 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
CODES
2008
IEEE
14 years 11 months ago
Slack analysis in the system design loop
We present a system-level technique to analyze the impact of design optimizations on system-level timing dependencies. This technique enables us to speed up the design cycle by su...
Girish Venkataramani, Seth Copen Goldstein
ICS
2003
Tsinghua U.
15 years 3 months ago
Estimating cache misses and locality using stack distances
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
Calin Cascaval, David A. Padua
IPPS
1999
IEEE
15 years 2 months ago
A Structured Approach to Parallel Programming: Methodology and Models
Parallel programming continues to be difficult, despite substantial and ongoing research aimed at making it tractable. Especially dismaying is the gulf between theory and the pract...
Berna L. Massingill