Evangelos P. Markatos
Abstract
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 applications have regular access patterns and good locality of reference. Although most database and program development applications seem to have little locality of reference, careful observations at the appropriate granularity reveal regular and sometimes periodic access patterns.
- {1} M. Carey, D. DeWitt, and J. Naughton. The OO7 Bechmark. In Proceedings of the 1993 ACM SIGMOD Conference, pages 12-21, 1993. Google Scholar
Digital Library
- {2} S. Gribble and M. Kornacker. Memory Hierarchies and Real-World Applications, 1996. Working paper.Google Scholar
- {3} T.C. Mowry, A.K. Demke, and O. Krieger. Automatic Compiler-Inserted I/O Prefetching for Out-of-Core Applications. In Second Symposium on Operating System Design and Implementation , pages 3-17, Seattle, WA, October 1996. Google ScholarDigital Library
- {4} S.E. Perl and R.L. Sites. Studies of Windows NT Performance Using Dynamic Execution Traces. In Second Symposium on Operating System Design and Implementation, pages 169-184, October 1996. Google ScholarDigital Library
- {5} A. Srivastava and A. Eustace. ATOM: A System for Building Customized Program Analysis Tools. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, pages 196-205, Orlando, FL, June 1994. Google ScholarDigital Library
Index Terms
- Visualizing working sets
Recommendations
Relationships between covering-based rough sets and relation-based rough sets
Rough set theory is an important technique to deal with vagueness and granularity in information systems. In rough set theory, relation-based rough sets and covering-based rough sets are two important extensions of the classical rough sets. This paper ...
Granular rough sets and granular shadowed sets: Three-way approximations in Pawlak approximation spaces
AbstractA Pawlak approximation space is a pair of a ground set/space and a quotient set/space of the ground set induced by an equivalence relation on the ground set. The quotient space is a simple granulation of the ground space such that an ...
Soft rough fuzzy sets and soft fuzzy rough sets
Fuzzy set theory, soft set theory and rough set theory are mathematical tools for dealing with uncertainties and are closely related. Feng et al. introduced the notions of rough soft set, soft rough set and soft rough fuzzy set by combining fuzzy set, ...
Comments