Pith. sign in

REVIEW 4 cited by

OMPar: Automatic Parallelization with AI-Driven Source-to-Source Compilation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.14771 v1 pith:CBVGBBZD submitted 2024-09-23 cs.CL

classification cs.CL
keywords omparparallelizationcodeaccuracypragmasai-drivenautomaticefficient
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Manual parallelization of code remains a significant challenge due to the complexities of modern software systems and the widespread adoption of multi-core architectures. This paper introduces OMPar, an AI-driven tool designed to automate the parallelization of C/C++ code using OpenMP pragmas. OMPar integrates Large Language Models (LLMs) through two key components: OMPify, which assesses loop parallelization potential, and MonoCoder-OMP, a new fine-tuned model which generates precise OpenMP pragmas. The evaluation of OMPar follows the same rigorous process applied to traditional tools like source-to-source AutoPar and ICPC compilers: (1) ensuring the generated code compiles and runs correctly in serial form, (2) assessing performance with the gradual addition of threads and corresponding physical cores, and (3) verifying and validating the correctness of the code's output. Benchmarks from HeCBench and ParEval are used to evaluate accuracy and performance. Experimental results demonstrate that OMPar significantly outperforms traditional methods, achieving higher accuracy in identifying parallelizable loops and generating efficient pragmas. Beyond accuracy, OMPar offers advantages such as the ability to work on partial or incomplete codebases and the capacity to continuously learn from new code patterns, enhancing its parallelization capabilities over time. These results underscore the potential of LLMs in revolutionizing automatic parallelization techniques, paving the way for more efficient and scalable parallel computing systems.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation

    cs.AI 2026-06 conditional novelty 6.0 of 10

    A new kernel-centric benchmark with AST augmentation shows LLM parallel-API translation passes 23.9–62.7% of tasks at pass@1, with build-stage API adaptation the dominant failure mode.

  2. P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code

    cs.SE 2025-06 conditional novelty 6.0 of 10

    Retrieval-augmented prompting with OpenMP tutorial text raises LLM-generated code compilation success from 80.4% to 100% on 102 parallelizable benchmark cases.

  3. HARGO: Heterogeneity-Aware Reward-Guided Optimization for RL Post-Training of LLMs on HPC Tasks

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Confidence-modulated per-response advantage weighting (HARGO) improves GRPO-style RL post-training on four heterogeneous HPC tasks, leading WinRate, data-race F1, and PLP similarity at 0.5B.

  4. Accelerating Latency-Critical Applications with AI-Powered Semi-Automatic Fine-Grained Parallelization on SMT Processors

    cs.DC 2025-08 conditional novelty 5.0 of 10

    An LLM-agent pipeline with profiling, binary analysis, and SMT simulation automatically parallelizes latency-critical benchmarks via the Relic framework, reporting a 17% geomean gain after excluding failures.

Pith tools