Automatic Optimize-time Validation for Binary Optimizers

• Item type: Trans(1)
• 公開日: 2022-01-05
• タイトル: Automatic Optimize-time Validation for Binary Optimizers
• タイトル / 言語: en
• タイトル: Automatic Optimize-time Validation for Binary Optimizers
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [通常論文] validation, binary optimizer, code generation
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: IBM Research - Tokyo
• 著者所属: IBM Canada
• 著者所属: IBM Research - Tokyo
• 著者所属: IBM United Kingdom Limited
• 著者所属: IBM Research - Tokyo
• 著者所属(英): en
• 著者所属(英): IBM Research - Tokyo
• 著者所属(英): en
• 著者所属(英): IBM Canada
• 著者所属(英): en
• 著者所属(英): IBM Research - Tokyo
• 著者所属(英): en
• 著者所属(英): IBM United Kingdom Limited
• 著者所属(英): en
• 著者所属(英): IBM Research - Tokyo
• 著者名: Motohiro, Kawahito; Reid, Copeland; Toshihiko, Koju; David, Siegwart; Moriyoshi, Ohara
• 著者名(英): Motohiro, Kawahito; Reid, Copeland; Toshihiko, Koju; David, Siegwart; Moriyoshi, Ohara
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: We propose an approach called automatic optimize-time validation for binary optimizers. Our approach does not involve executing the whole program for validation but selecting a small part of code (1 to 100 instructions) for the target test code. It executes the target code and its optimized code with several input data during binary optimization. One benefit is that we can test a small part of an actual customer's code during binary optimization. Our approach can be used to test several input data not included in the target code, which is the most beneficial aspect of the approach. If the results are the same after execution, we will use the optimized code for the final output code. If the results differ, we can consider a couple of option, e.g., while developing a binary optimizer, we can abort the compilation with an error message to easily detect a bug. After a binary optimizer becomes generally available, we can use the input code for the final output code to maintain compatibility. Our goal is for the output binary code to be compatible, fast, and small. We focused on how to improve compatibility in this study. We implemented our approach in our binary optimizer and successfully detected one new bug. We used a very small binary program to observe the worst case of increased compilation time and output binary file size. Our implementation showed that our approach increases optimization time by only 0.02% and output binary file size by 8%.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.30(2022) (online); ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: We propose an approach called automatic optimize-time validation for binary optimizers. Our approach does not involve executing the whole program for validation but selecting a small part of code (1 to 100 instructions) for the target test code. It executes the target code and its optimized code with several input data during binary optimization. One benefit is that we can test a small part of an actual customer's code during binary optimization. Our approach can be used to test several input data not included in the target code, which is the most beneficial aspect of the approach. If the results are the same after execution, we will use the optimized code for the final output code. If the results differ, we can consider a couple of option, e.g., while developing a binary optimizer, we can abort the compilation with an error message to easily detect a bug. After a binary optimizer becomes generally available, we can use the input code for the final output code to maintain compatibility. Our goal is for the output binary code to be compatible, fast, and small. We focused on how to improve compatibility in this study. We implemented our approach in our binary optimizer and successfully detected one new bug. We used a very small binary program to observe the worst case of increased compilation time and output binary file size. Our implementation showed that our approach increases optimization time by only 0.02% and output binary file size by 8%.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.30(2022) (online); ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11464814
• 書誌情報: 情報処理学会論文誌プログラミング（PRO）; 巻 15, 号 1, 発行日 2022-01-05
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7802
• 出版者 / 言語: ja
• 出版者: 情報処理学会