Memory Mapping and Parallelizing Random Forests for Speed and Cache Efficiency

2021 ◽  
Author(s):  
Eduardo Romero-Gainza ◽  
Christopher Stewart ◽  
Angela Li ◽  
Kyle Hale ◽  
Nathaniel Morris
Keyword(s):  
Random Forests ◽  
Memory Mapping ◽  
Cache Efficiency

Cache Efficiency and Scalability on Multi-core Architectures

2011 ◽  
pp. 88-97
Author(s):  
Thomas Müller ◽  
Carsten Trinitis ◽  
Jasmin Smajic
Keyword(s):  
Cache Efficiency

scholarly journals Comparative Analysis of XML Compression Technologies

2005 ◽  
Vol 9 (1) ◽  
pp. 5-33 ◽  
Author(s):  
Wilfred Ng ◽  
Wai-Yeung Lam ◽  
James Cheng
Keyword(s):  
Comparative Analysis ◽  
Xml Compression

IMPROVING peLIFO CACHE REPLACEMENT POLICY: HARDWARE REDUCTION AND THREAD-AWARE EXTENSION

2014 ◽  
Vol 23 (04) ◽  
pp. 1450046
Author(s):  
ENRIQUE SEDANO ◽  
SILVIO SEPULVEDA ◽  
FERNANDO CASTRO ◽  
DANIEL CHAVER ◽  
RODRIGO GONZALEZ-ALBERQUILLA ◽  
...  
Keyword(s):  
New York ◽  
Replacement Policy ◽  
Cache Replacement ◽  
Dynamic Information ◽  
Processor Performance ◽  
Replacement Algorithm ◽  
L2 Cache ◽  
Cache Efficiency ◽  
Performance Penalty

Studying blocks behavior during their lifetime in cache can provide useful information to reduce the miss rate and therefore improve processor performance. According to this rationale, the peLIFO replacement algorithm [M. Chaudhuri, Proc. Micro'09, New York, 12–16 December, 2009, pp. 401–412], which learns dynamically the number of cache ways required to satisfy short-term reuses preserving the remaining ways for long-term reuses, has been recently proposed. In this paper, we propose several changes to the original peLIFO policy in order to reduce the implementation complexity involved, and we extend the algorithm to a shared-cache environment considering dynamic information about threads behavior to improve cache efficiency. Experimental results confirm that our simplification techniques reduce the required hardware with a negligible performance penalty, while the best of our thread-aware extension proposals reduces average CPI by 8.7% and 15.2% on average compared to the original peLIFO and LRU respectively for a set of 43 multi-programmed workloads on an 8 MB 16-way set associative shared L2 cache.

Domain-Specific XML Compression

2013 ◽  
Author(s):  
J. P. T. Moore ◽  
A. D. Kheirkhahzadeh ◽  
J. N. Bagale
Keyword(s):  
Domain Specific ◽  
Xml Compression

Cache Efficiency Research for Using in Adaptive Data Storage

2019 ◽  
Vol 25 (4) ◽  
pp. 216-222
Author(s):  
D. R. Potapov ◽  
Keyword(s):  
Data Storage ◽  
Cache Efficiency
Sign in / Sign up

Export Citation Format

Share Document