W-Order scan: minimizing cache pollution by application software level cache management for MMDB

作者: Yansong Zhang , Min Jiao , Zhanwei Wang , Shan Wang , Xuan Zhou

DOI: 10.1007/978-3-642-23535-1_41

关键词: Parallel computingLocality of referenceCache invalidationPage cacheCache pollutionOperating systemCache coloringCache algorithmsSmart CacheComputer scienceCache

摘要: The utilization of shared LLC(Last Level Cache) is important for efficiency multi-core processor. Uncontrolled sharing leads to cache pollution i.e. the weak locality data(single-usage data without re-using) continuously evict strong (frequently re-used data) from LLC in both inner query processing and co-running programs. For analytical MMDB (Main-Memory Database) applications, with skewed star schema DW, more than 95% memory capacity occupied by memory-resident fact table there are only small size dimension tables locality. Cache partitioning must manage different localities inside avoid table. static OS-based suffers insufficient address due large dynamic also movement overhead during re-allocation. In order employ a practical effective policy, we propose an application softwarebased W-order scan policy real application. consecutive physical based proposed reduce misses high controlling page accessing within pages. Another approach page-color index extract bits pages sort bits, when perform scan, can control too supporting OS allocating. We measure L2 miss rate simulating typical hash join operation. experimental results show that DBMSs improve performance through pattern themselves oppose depending on supports hardware or OS.

参考文章(18)
William L. Lunch, Michael J. Flynn, Brian K. Bray, Page allocation to reduce access time of physical caches Stanford University. ,(1990)
Thomas Piquet, Olivier Rochecouste, André Seznec, None, Exploiting Single-Usage for Effective Memory Management ACSAC '07 Proceedings of the 12th Asia-Pacific conference on Advances in Computer Systems Architecture. pp. 90- 101 ,(2007) , 10.1007/978-3-540-74309-5_11
Peter A. Boncz, Martin L. Kersten, Stefan Manegold, Database Architecture Optimized for the New Bottleneck: Memory Access very large data bases. pp. 54- 65 ,(1999)
G. E. Suh, L. Rudolph, S. Devadas, Dynamic Partitioning of Shared Cache Memory The Journal of Supercomputing. ,vol. 28, pp. 7- 26 ,(2004) , 10.1023/B:SUPE.0000014800.27383.8F
Jichuan Chang, Gurindar S. Sohi, Cooperative cache partitioning for chip multiprocessors international conference on supercomputing. pp. 242- 252 ,(2007) , 10.1145/1274971.1275005
Xiao Zhang, Sandhya Dwarkadas, Kai Shen, Towards practical page coloring-based multicore cache management european conference on computer systems. pp. 89- 102 ,(2009) , 10.1145/1519065.1519076
Fei Guo, Yan Solihin, An analytical model for cache replacement policy performance ACM SIGMETRICS Performance Evaluation Review. ,vol. 34, pp. 228- 239 ,(2006) , 10.1145/1140103.1140304
R. E. Kessler, Mark D. Hill, Page placement algorithms for large real-indexed caches ACM Transactions on Computer Systems. ,vol. 10, pp. 338- 359 ,(1992) , 10.1145/138873.138876
Jiang Lin, Qingda Lu, Xiaoning Ding, Zhao Zhang, Xiaodong Zhang, P Sadayappan, None, Enabling software management for multicore caches with a lightweight hardware support ieee international conference on high performance computing data and analytics. pp. 14- ,(2009) , 10.1145/1654059.1654074
George Taylor, Peter Davies, Michael Farmwald, The TLB slice—a low-cost high-speed address translation mechanism ACM SIGARCH Computer Architecture News. ,vol. 18, pp. 355- 363 ,(1990) , 10.1145/325096.325161