TY - GEN
T1 - TrivialSpy
T2 - 2023 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2023
AU - You, Xin
AU - Yang, Hailong
AU - Lei, Kelun
AU - Luan, Zhongzhi
AU - Qian, Depei
N1 - Publisher Copyright:
© 2023 ACM.
PY - 2023
Y1 - 2023
N2 - Trivial operations cause software inefficiencies that waste functional units and memory bandwidth for executing useless instructions. Although previous works have identified a significant amount of trivial operations in widely used programs, the proposed solutions only provide useful observations, other than actionable guid-ance to eliminate trivial operations for better performance. In this paper, we propose TrivialSpy - a fine-grained and dataflow-based value profiler to effectively identify software triviality with optimization potential estimation. With the help of dataflow analysis, TrivialSpy can detect software trivialities of heavy operation, triv-ial chain, and redundant backward slice. In addition, TrivialSpy can identify trivial breakpoints that combine multiple trivial conditions for more optimization opportunities. The evaluation results demonstrate TrivialSpy is capable of identifying software triviality in highly optimized programs. Based on the optimization guid-ance provided by TrivialSpy, we can achieve 52.09% performance speedup at maximum after eliminating trivial operations.
AB - Trivial operations cause software inefficiencies that waste functional units and memory bandwidth for executing useless instructions. Although previous works have identified a significant amount of trivial operations in widely used programs, the proposed solutions only provide useful observations, other than actionable guid-ance to eliminate trivial operations for better performance. In this paper, we propose TrivialSpy - a fine-grained and dataflow-based value profiler to effectively identify software triviality with optimization potential estimation. With the help of dataflow analysis, TrivialSpy can detect software trivialities of heavy operation, triv-ial chain, and redundant backward slice. In addition, TrivialSpy can identify trivial breakpoints that combine multiple trivial conditions for more optimization opportunities. The evaluation results demonstrate TrivialSpy is capable of identifying software triviality in highly optimized programs. Based on the optimization guid-ance provided by TrivialSpy, we can achieve 52.09% performance speedup at maximum after eliminating trivial operations.
KW - Dynamic Binary Instrumentation
KW - Performance Analysis
KW - Performance Optimization
KW - Software Triviality
UR - https://www.scopus.com/pages/publications/85190426771
U2 - 10.1145/3581784.3607052
DO - 10.1145/3581784.3607052
M3 - 会议稿件
AN - SCOPUS:85179555209
T3 - International Conference for High Performance Computing, Networking, Storage and Analysis, SC
BT - SC 2023 - International Conference for High Performance Computing, Networking, Storage and Analysis
PB - IEEE Computer Society
Y2 - 12 November 2023 through 17 November 2023
ER -