Abstract
The working set (WS) model pioneered by Denning and others is the foundation for analyzing memory performance and optimizing memory management. An important measure is the average working set size (WSS). In 1968, Denning derived a recursive formula to compute the average WSS. The Denning recursion was originally derived for infinitely long program executions and later adapted to use on finite length traces. All previous adaptations, however, have had to modify the Denning recursion for boundary correction.
This paper presents footmark, which redefines average WSS for finite length traces. It has three benefits. By definition, footmark satisfies a new type of symmetry. Mathematically, the paper gives four equivalent formulas for computing footmark including one that is identical to the Denning recursion. The mathematical simplicity is beneficial in both formal and practical analysis of working sets. Based on the new formulas, the paper proves a previously unknown equivalence relation between two working set definitions. Finally, the paper evaluates three WSS definitions using six test programs from the SPEC 2017 benchmark suite.
The research was conducted when the first author visited University of Rochester from September 2017 to September 2018 and when the second author worked at the university in summer 2018.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
This trick was first used by Denning and Slutz to count the end corrections for space-time working set [8].
References
Loca: Program locality analysis tools (2018). https://github.com/dcompiler/loca
Brock, J., Ding, C., Lavaee, R., Liu, F., Yuan, L.: Prediction and bounds on shared cache demand from memory access interleaving. In: Proceedings of the International Symposium on Memory Management, pp. 96–108 (2018). https://doi.org/10.1145/3210563.3210565. http://doi.acm.org/10.1145/3210563.3210565
Chen, D., Liu, F., Ding, C., Pai, S.: Locality analysis through static parallel sampling. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 557–570 (2018). https://doi.org/10.1145/3192366.3192402. http://doi.acm.org/10.1145/3192366.3192402
Coffman Jr., E.G., Denning, P.J.: Operating Systems Theory. Prentice-Hall, Englewood Cliffs (1973)
Denning, P.J.: Resource Allocation in Multiprocess Computer Systems. Ph.D. thesis, Massachusetts Institute of Technology (1968)
Denning, P.J.: The working set model for program behaviour. Commun. ACM 11(5), 323–333 (1968)
Denning, P.J., Schwartz, S.C.: Properties of the working set model. Commun. ACM 15(3), 191–198 (1972)
Denning, P.J., Slutz, D.R.: Generalized working sets for segment reference strings. Commun. ACM 21(9), 750–759 (1978)
Ding, C., Chilimbi, T.: All-window profiling of concurrent executions. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (2008). Poster paper
Hu, X., et al.: Fast miss ratio curve modeling for storage cache. ACM Trans. Storage 14(2), 12:1–12:34 (2018). https://doi.org/10.1145/3185751. http://doi.acm.org/10.1145/3185751
Luk, C.K., et al.: Pin: building customized program analysis tools with dynamic instrumentation. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 190–200 (2005)
Pan, C., Hu, X., Zhou, L., Luo, Y., Wang, X., Wang, Z.: PACE: penalty aware cache modeling with enhanced AET. In: 9th ACM SIGOPS Asia-Pacific Workshop on Systems (APSys 2018) (2018)
Slutz, D.R., Traiger, I.L.: A note on the calculation working set size. Commun. ACM 17(10), 563–565 (1974). https://doi.org/10.1145/355620.361167. http://doi.acm.org/10.1145/355620.361167
Xiang, X., Bao, B., Ding, C., Gao, Y.: Linear-time modeling of program working set in shared cache. In: Proceedings of the International Conference on Parallel Architecture and Compilation Techniques, pp. 350–360 (2011)
Xiang, Y., Wang, X., Huang, Z., Wang, Z., Luo, Y., Wang, Z.: DCAPS: dynamic cache allocation with partial sharing. In: Proceedings of the EuroSys Conference, pp. 13:1–13:15 (2018). https://doi.org/10.1145/3190508.3190511. http://doi.acm.org/10.1145/3190508.3190511
Yuan, L., Ding, C., Denning, P.J., Zhang, Y.: A measurement theory of locality. CoRR abs/1802.01254 (2018). http://arxiv.org/abs/1802.01254
Acknowledgement
The authors wish to thank Peter Denning for the feedback and suggestions on the presentation of the paper’s contributions and William Wilson for help on the use of the loca tool. The funding was provided in part by National Key R&D Program of China (2016YFB0200803) and NFSC (61432018, 61402441, 61521092, 61502450, 61602443), by the National Science Foundation of the United States (Contract No. CCF-1717877 and CCF-1629376), by an IBM CAS Faculty Fellowship, and by Guangdong Province Key Laboratory of Popular High Performance Computers (2017B030314073).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Yuan, L., Smith, W., Fan, S., Chen, Z., Ding, C., Zhang, Y. (2019). Footmark: A New Formulation for Working Set Statistics. In: Hall, M., Sundar, H. (eds) Languages and Compilers for Parallel Computing. LCPC 2018. Lecture Notes in Computer Science(), vol 11882. Springer, Cham. https://doi.org/10.1007/978-3-030-34627-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-34627-0_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34626-3
Online ISBN: 978-3-030-34627-0
eBook Packages: Computer ScienceComputer Science (R0)