Learning to Parallelize in a Shared-Memory Environment with Transformers
Պահպանված է:
| Հրատարակված է: | arXiv.org (Jul 14, 2022), p. n/a |
|---|---|
| Հիմնական հեղինակ: | |
| Այլ հեղինակներ: | , |
| Հրապարակվել է: |
Cornell University Library, arXiv.org
|
| Խորագրեր: | |
| Առցանց հասանելիություն: | Citation/Abstract Full text outside of ProQuest |
| Ցուցիչներ: |
Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2656447182 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2656447182 | ||
| 045 | 0 | |b d20220714 | |
| 100 | 1 | |a Harel, Re'em | |
| 245 | 1 | |a Learning to Parallelize in a Shared-Memory Environment with Transformers | |
| 260 | |b Cornell University Library, arXiv.org |c Jul 14, 2022 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a In past years, the world has switched to many-core and multi-core shared memory architectures. As a result, there is a growing need to utilize these architectures by introducing shared memory parallelization schemes to software applications. OpenMP is the most comprehensive API that implements such schemes, characterized by a readable interface. Nevertheless, introducing OpenMP into code is challenging due to pervasive pitfalls in management of parallel shared memory. To facilitate the performance of this task, many source-to-source (S2S) compilers have been created over the years, tasked with inserting OpenMP directives into code automatically. In addition to having limited robustness to their input format, these compilers still do not achieve satisfactory coverage and precision in locating parallelizable code and generating appropriate directives. In this work, we propose leveraging recent advances in ML techniques, specifically in natural language processing (NLP), to replace S2S compilers altogether. We create a database (corpus), Open-OMP, specifically for this goal. Open-OMP contains over 28,000 code snippets, half of which contain OpenMP directives while the other half do not need parallelization at all with high probability. We use the corpus to train systems to automatically classify code segments in need of parallelization, as well as suggest individual OpenMP clauses. We train several transformer models, named PragFormer, for these tasks, and show that they outperform statistically-trained baselines and automatic S2S parallelization compilers in both classifying the overall need for an OpenMP directive and the introduction of private and reduction clauses. Our source code and database are available at: https://github.com/Scientific-Computing-Lab-NRCN/PragFormer. | |
| 653 | |a Compilers | ||
| 653 | |a Source code | ||
| 653 | |a Computer memory | ||
| 653 | |a Classification | ||
| 653 | |a Computer architecture | ||
| 653 | |a Applications programs | ||
| 653 | |a Natural language processing | ||
| 653 | |a Transformers | ||
| 700 | 1 | |a Pinter, Yuval | |
| 700 | 1 | |a Gal Oren | |
| 773 | 0 | |t arXiv.org |g (Jul 14, 2022), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2656447182/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2204.12835 |