Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis 2009
DOI: 10.1145/1654059.1654116
|View full text |Cite
|
Sign up to set email alerts
|

Machine learning-based prefetch optimization for data center applications

Abstract: Performance tuning for data centers is essential and complicated. It is important since a data center comprises thousands of machines and thus a single-digit performance improvement can significantly reduce cost and power consumption. Unfortunately, it is extremely difficult as data centers are dynamic environments where applications are frequently released and servers are continually upgraded.In this paper, we study the effectiveness of different processor prefetch configurations, which can greatly influence … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
42
0
1

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 61 publications
(43 citation statements)
references
References 27 publications
0
42
0
1
Order By: Relevance
“…In our previous work [17,26] we used static or dynamic (performance counters) code features with SUIF, Intel and PathScale compilers to predict a set of multiple optimizations that improve execution time for new programs based on similarities between previously optimized programs. Liao et al [82] used machine learning to performance counters and decision trees to choose hardware prefetcher configurations. Several researchers [24,58,62] attempted to characterize program input in order to predict best code variant at run-time using several machine learning methods, including automatically generated decision trees and statistical modeling.…”
Section: Related Workmentioning
confidence: 99%
“…In our previous work [17,26] we used static or dynamic (performance counters) code features with SUIF, Intel and PathScale compilers to predict a set of multiple optimizations that improve execution time for new programs based on similarities between previously optimized programs. Liao et al [82] used machine learning to performance counters and decision trees to choose hardware prefetcher configurations. Several researchers [24,58,62] attempted to characterize program input in order to predict best code variant at run-time using several machine learning methods, including automatically generated decision trees and statistical modeling.…”
Section: Related Workmentioning
confidence: 99%
“…Critical algorithms, such as garbage collection [7], may gain more than two times speedup. Application performance metrics due to prefetcher configuration may reach up to 70% improvement, depending on the extensiveness of the memory usage by the workload [2,26].…”
Section: Methodsmentioning
confidence: 99%
“…The most notable merit of M5P is that it can provide an interpretable model to help designers focus on the most critical performance bottlenecks. Actually, M5P has already been employed for performance modeling and analysis of computer systems [Ould-Ahmed-Vall et al 2007b;Liao et al 2009;Guo et al 2011]. In short, the reason why we use ANN, SVM, and M5P as the base models to build ELSE is that these models have been widely used in performance analysis and modeling of computer systems, and their abilities in predicting the performance and power consumption have also been well demonstrated.…”
Section: Base Regression Modelsmentioning
confidence: 99%