Add to ORKG124 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.We use stack distances to quantify locality and we show that the average locality computed using stack distances is a very reliable metric. A new algorithm for stack processing, that is 30% faster than the best know algorithm on the suite of programs traced, is also presented.Ope
Feedback-directed optimization has become an increasingly important tool in designing and building o...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This paper presents two economical tools to measure the average working set size of a program. Among...
124 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.We use stack distances to qua...
This paper 1 describes our experience using the stack pro-cessing algorithm [6] for estimating the n...
In this paper we present results we obtained using a compiler to predict performance of scientific c...
Locality, characterized by data reuses, determines caching performance. Reuse distance (i.e. LRU st...
As computing efficiency becomes constrained by hardware scaling limitations, code optimization grows...
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can...
Locality increasingly determines system performance. As a rigor-ous and precise locality model, reus...
A scalar metric for temporal locality is proposed. The metric is based on LRU stack distance. This p...
The widening gap between processor speed and main memory speed has generated interest in compiletime...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
The standard language for describing the asymptotic behavior of algorithms is theoretical computatio...
In the past decade, processor speed has become significantly faster than memory speed. Small, fast c...
Feedback-directed optimization has become an increasingly important tool in designing and building o...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This paper presents two economical tools to measure the average working set size of a program. Among...
124 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2000.We use stack distances to qua...
This paper 1 describes our experience using the stack pro-cessing algorithm [6] for estimating the n...
In this paper we present results we obtained using a compiler to predict performance of scientific c...
Locality, characterized by data reuses, determines caching performance. Reuse distance (i.e. LRU st...
As computing efficiency becomes constrained by hardware scaling limitations, code optimization grows...
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can...
Locality increasingly determines system performance. As a rigor-ous and precise locality model, reus...
A scalar metric for temporal locality is proposed. The metric is based on LRU stack distance. This p...
The widening gap between processor speed and main memory speed has generated interest in compiletime...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
The standard language for describing the asymptotic behavior of algorithms is theoretical computatio...
In the past decade, processor speed has become significantly faster than memory speed. Small, fast c...
Feedback-directed optimization has become an increasingly important tool in designing and building o...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This paper presents two economical tools to measure the average working set size of a program. Among...