Automatic Identification of Parallelizable Loops Using Transformer-Based Source Code Representations

View PDF HTML (experimental)

Abstract:Automatic parallelization remains a challenging problem in software engineering, particularly in identifying code regions where loops can be safely executed in parallel on modern multi-core architectures. Traditional static analysis techniques, such as dependence analysis and polyhedral models, often struggle with irregular or dynamically structured code. In this work, we propose a Transformer-based approach to classify the parallelization potential of source code, focusing on distinguishing independent (parallelizable) loops from undefined ones. We adopt DistilBERT to process source code sequences using subword tokenization, enabling the model to capture contextual syntactic and semantic patterns without handcrafted features. The approach is evaluated on a balanced dataset combining synthetically generated loops and manually annotated real-world code, using 10-fold cross-validation and multiple performance metrics. Results show consistently high performance, with mean accuracy above 99% and low false positive rates, demonstrating robustness and reliability. Compared to prior token-based methods, the proposed approach simplifies preprocessing while improving generalization and maintaining computational efficiency. These findings highlight the potential of lightweight Transformer models for practical identification of parallelization opportunities at the loop level.

Comments: 28 pages, 12 figures

Subjects:

Software Engineering (cs.SE); Artificial Intelligence (cs.AI)

Cite as: arXiv:2603.30040 [cs.SE]

(or arXiv:2603.30040v1 [cs.SE] for this version)

https://doi.org/10.48550/arXiv.2603.30040

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Izavan Dos Santos Correia [view email] [v1] Tue, 31 Mar 2026 17:54:27 UTC (1,440 KB)