Introduction It is widely known that most applications exhibit locality of reference. That is, applications access only a subset of their pages during any phase of their execution. This subset of pages is usually called the working set of the application. In this note we present the working set of applications in pictorial form so that it can be easily viewed and understood. Based on these working set "pictures' we make observations about the size, the duration, and the regularity of the working sets of various applications. Our applications cover several domains, ranging from numerical applications, program development tools, CAD simulations, and database applications. Our results suggest that most numerical and some database ap...
Traditionally, the performance of algorithms is evaluated using worst-case analysis. For a number of...
In POPL 2002, Petrank and Rawitz showed a universal result---finding optimal data placement is not o...
Radial Sets is a new technique for visualizing large overlapping sets in a more scalable way then cl...
The trend in computer architecture is that of an increasing gap between rapidly increasing processor...
This paper presents two economical tools to measure the average working set size of a program. Among...
Abstract. The characterization of workloads used in memory systems analysis and evaluation is import...
Over the past decades, core speeds have been improving at a much higher rate than memory bandwidth. ...
The visualization tool rdvis is presented which aims at helping the programmer to find program trans...
Access requests to keys stored into a data structure often exhibit locality of reference in practice...
The trend in computer architecture is that processor speeds are increasing rapidly compared to memor...
In this article, we introduce SPLAT (Static and Profiled Data Locality Analysis Tool). The tool's pu...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
Data locality is central to modern computer designs. The widening gap between processor speed and me...
This paper examines the processing of visual information beyond the creation of the early represen...
Several benchmarks for measuring memory performance of HPC systems along dimensions of spatial and t...
Traditionally, the performance of algorithms is evaluated using worst-case analysis. For a number of...
In POPL 2002, Petrank and Rawitz showed a universal result---finding optimal data placement is not o...
Radial Sets is a new technique for visualizing large overlapping sets in a more scalable way then cl...
The trend in computer architecture is that of an increasing gap between rapidly increasing processor...
This paper presents two economical tools to measure the average working set size of a program. Among...
Abstract. The characterization of workloads used in memory systems analysis and evaluation is import...
Over the past decades, core speeds have been improving at a much higher rate than memory bandwidth. ...
The visualization tool rdvis is presented which aims at helping the programmer to find program trans...
Access requests to keys stored into a data structure often exhibit locality of reference in practice...
The trend in computer architecture is that processor speeds are increasing rapidly compared to memor...
In this article, we introduce SPLAT (Static and Profiled Data Locality Analysis Tool). The tool's pu...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
Data locality is central to modern computer designs. The widening gap between processor speed and me...
This paper examines the processing of visual information beyond the creation of the early represen...
Several benchmarks for measuring memory performance of HPC systems along dimensions of spatial and t...
Traditionally, the performance of algorithms is evaluated using worst-case analysis. For a number of...
In POPL 2002, Petrank and Rawitz showed a universal result---finding optimal data placement is not o...
Radial Sets is a new technique for visualizing large overlapping sets in a more scalable way then cl...