A Unified Framework for Automated Code Transformation and Pragma Insertion

• URL: http://arxiv.org/abs/2405.03058v6
• Date: Sat, 01 Mar 2025 05:43:19 GMT
• Title: A Unified Framework for Automated Code Transformation and Pragma Insertion
• Abstract summary: High-level synthesis, source-to-source compilers, and various Design Space Exploration techniques for pragma insertion have significantly improved the Quality of Results of generated designs.<n>These tools offer benefits such as reduced development time and enhanced performance.<n>However, achieving high-quality results often requires additional manual code transformations and tiling selections, which are typically performed separately or as pre-processing steps.
• Score: 5.669524030828314
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-level synthesis, source-to-source compilers, and various Design Space Exploration techniques for pragma insertion have significantly improved the Quality of Results of generated designs. These tools offer benefits such as reduced development time and enhanced performance. However, achieving high-quality results often requires additional manual code transformations and tiling selections, which are typically performed separately or as pre-processing steps. Although DSE techniques enable code transformation upfront, the vastness of the search space often limits the exploration of all possible code transformations, making it challenging to determine which transformations are necessary. Additionally, ensuring correctness remains challenging, especially for complex transformations and optimizations. To tackle this obstacle, we first propose a comprehensive framework leveraging HLS compilers. Our system streamlines code transformation, pragma insertion, and tiles size selection for on-chip data caching through a unified optimization problem, aiming to enhance parallelization, particularly beneficial for computation-bound kernels. Them employing a novel Non-Linear Programming (NLP) approach, we simultaneously ascertain transformations, pragmas, and tile sizes, focusing on regular loop-based kernels. Our evaluation demonstrates that our framework adeptly identifies the appropriate transformations, including scenarios where no transformation is necessary, and inserts pragmas to achieve a favorable Quality of Results.

Related papers

• Accelerated Decoding of Centroid Positional Encoding for Instance Segmentation [49.97373153077311]
  We investigate the decoding overhead associated with a centroid encoding for Instance, in which each pixel regresses a positional embedding of its instance centroid.<n>Our solution significantly reduces decoding overhead and improves Endto-End latency, outperforming both CPU-based approaches and naive GPU implementations.
  arXiv  Detail & Related papers  (2026-09-15T09:05:17Z)
• From Block-encoding to Generalized Quantum Signal Processing: Principles, Algorithms and Applications [4.014371002279176]
  Five tools are used to transform matrix functions into implementable quantum circuits: block-encoding, qubitization, QSP, QSVT and GQSP.<n>This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms.
  arXiv  Detail & Related papers  (2026-09-09T10:06:42Z)
• From Constraint to Code: DQI-Kit -- A Software Framework for Decoded Quantum Interferometry [1.1683938179815823]
  Trying to solve hard optimisation problems with quantum techniques requires transformations of domain objectives and constraints into formats compatible with a chosen quantum algorithm.<n>This often introduces inefficiencies and overheads that limit or even endanger potential quantum advantage for current and future approaches.<n>We present DQI-Kit, a software framework that provides a unified interface for automatically encoding constrained optimisation problems into Max-LINSAT.
  arXiv  Detail & Related papers  (2026-05-16T12:14:30Z)
• SemRep: Generative Code Representation Learning with Code Transformations [5.790824314596833]
  SemRep is a framework that improves code transformation through generative code representation learning.<n>Our key insight is to employ the semantics-preserving transformations as the intermediate representation.<n>With the improved exploration of diverse code transformations, SemRep is particularly amenable to evolutionary search.
  arXiv  Detail & Related papers  (2026-03-13T22:47:11Z)
• PEAK: A Performance Engineering AI-Assistant for GPU Kernels Powered by Natural Language Transformations [0.8699280339422538]
  We introduce PEAK, a Performance Engineering AI-Assistant for Kernels powered by natural language transformations.<n>We show that our implementations are competitive with vendor libraries when available, and for HLSL (without a library) our documented FLOPS.
  arXiv  Detail & Related papers  (2025-12-22T04:15:24Z)
• Quantum Hardware-Efficient Selection of Auxiliary Variables for QUBO Formulations [5.74796205166378]
  We present a novel approach for the selection of auxiliary variables tailored for architectures with limited connectivity.<n>We show that, compared to circuits constructed from a QUBO formulation using conventional auxiliary selection methods, the proposed approach reduces the circuit depth by almost 40%.
  arXiv  Detail & Related papers  (2025-11-24T19:00:05Z)
• Adaptive Layer-Wise Transformations for Post-Training Quantization of Large Language Models [47.54958360970588]
  Large language models require significant computational resources for deployment.<n>Main obstacle to effective quantization lies in systematic outliers in activations and weights.<n>We propose an adaptive transformation selection framework that systematically determines optimal transformations on a per-layer basis.
  arXiv  Detail & Related papers  (2025-11-21T22:01:58Z)
• GPT-FT: An Efficient Automated Feature Transformation Using GPT for Sequence Reconstruction and Performance Enhancement [18.888674282162032]
  Feature transformation plays a critical role in enhancing machine learning model performance by optimizing data representations.<n>Recent state-of-the-art approaches address this task as a continuous embedding optimization problem, converting discrete search into a learnable process.<n>We propose a novel framework that accomplishes automated feature transformation through four steps.
  arXiv  Detail & Related papers  (2025-08-28T14:21:08Z)
• GENIAL: Generative Design Space Exploration via Network Inversion for Low Power Algorithmic Logic Units [1.5845117761091052]
  We introduce GENIAL, a machine learning-based framework for the automatic generation and optimization of arithmetic units.<n>We show that GENIAL is consistently more sample efficient than other methods, and converges faster towards optimized designs.<n>We also demonstrate the versatility of our approach by achieving significant improvements on Finite State Machines.
  arXiv  Detail & Related papers  (2025-07-25T06:34:59Z)
• Introduction to Analytical Software Engineering Design Paradigm [0.0]
  This paper presents Behavioral Software Engineering (ASE), a novel design paradigm aimed at balancing abstraction, tool inadequacy, compatibility, and scalability.<n>The paradigm is evaluated through two frameworks- Structural Sequences (BSS) and Optimized Design Refactoring (ODR)
  arXiv  Detail & Related papers  (2025-05-17T12:23:55Z)
• Path Matters: Industrial Data Meet Quantum Optimization [2.7883868459582737]
  Real-world optimization problems must undergo a series of transformations before becoming solvable on current quantum hardware. We benchmark a representative subset of these transformation paths using a real-world industrial production planning problem with industry data. Our results show that QA on D-Wave hardware consistently produces near-optimal solutions, whereas LR-QAOA on IBM quantum devices struggles to reach comparable performance.
  arXiv  Detail & Related papers  (2025-04-23T10:45:38Z)
• Feature Alignment with Equivariant Convolutions for Burst Image Super-Resolution [52.55429225242423]
  We propose a novel framework for Burst Image Super-Resolution (BISR), featuring an equivariant convolution-based alignment. This enables the alignment transformation to be learned via explicit supervision in the image domain and easily applied in the feature domain. Experiments on BISR benchmarks show the superior performance of our approach in both quantitative metrics and visual quality.
  arXiv  Detail & Related papers  (2025-03-11T11:13:10Z)
• Vector Optimization with Gaussian Process Bandits [7.049738935364297]
  Learning problems in which multiple objectives must be considered simultaneously often arise in various fields, including engineering, drug design, and environmental management. Traditional methods for dealing with multiple black-box objective functions have limitations in incorporating objective preferences and exploring the solution space accordingly. We propose Vector Optimization with Gaussian Process (VOGP), a probably approximately correct adaptive elimination algorithm that performs black-box vector optimization using Gaussian process bandits.
  arXiv  Detail & Related papers  (2024-12-03T14:47:46Z)
• Variable-size Symmetry-based Graph Fourier Transforms for image compression [65.7352685872625]
  We propose a new family of Symmetry-based Graph Fourier Transforms of variable sizes into a coding framework. Our proposed algorithm generates symmetric graphs on the grid by adding specific symmetrical connections between nodes. Experiments show that SBGFTs outperform the primary transforms integrated in the explicit Multiple Transform Selection.
  arXiv  Detail & Related papers  (2024-11-24T13:00:44Z)
• UIO-LLMs: Unbiased Incremental Optimization for Long-Context LLMs [111.12010207132204]
  UIO-LLMs is an incremental optimization approach for memory-enhanced transformers under long-context settings. We refine the training process using the Truncated Backpropagation Through Time (TBPTT) algorithm. UIO-LLMs successfully handle long context, such as extending the context window of Llama2-7b-chat from 4K to 100K tokens with minimal 2% additional parameters.
  arXiv  Detail & Related papers  (2024-06-26T08:44:36Z)
• RTDK-BO: High Dimensional Bayesian Optimization with Reinforced Transformer Deep kernels [39.53062980223013]
  We combine recent developments in Deep Kernel Learning (DKL) and attention-based Transformer models to improve the modeling powers of GP surrogates with meta-learning. We propose a novel method for improving meta-learning BO surrogates by incorporating attention mechanisms into DKL. We combine this Transformer Deep Kernel with a learned acquisition function trained with continuous Soft Actor-Critic Reinforcement Learning to aid in exploration.
  arXiv  Detail & Related papers  (2023-10-05T21:37:20Z)
• A Circuit Domain Generalization Framework for Efficient Logic Synthesis in Chip Design [92.63517027087933]
  A key task in Logic Synthesis (LS) is to transform circuits into simplified circuits with equivalent functionalities. To tackle this task, many LS operators apply transformations to subgraphs -- rooted at each node on an input DAG -- sequentially. We propose a novel data-driven LS operator paradigm, namely PruneX, to reduce ineffective transformations.
  arXiv  Detail & Related papers  (2023-08-22T16:18:48Z)
• B-cos Alignment for Inherently Interpretable CNNs and Vision Transformers [97.75725574963197]
  We present a new direction for increasing the interpretability of deep neural networks (DNNs) by promoting weight-input alignment during training. We show that a sequence of such transformations induces a single linear transformation that faithfully summarises the full model computations. We show that the resulting explanations are of high visual quality and perform well under quantitative interpretability metrics.
  arXiv  Detail & Related papers  (2023-06-19T12:54:28Z)
• Evolutionary Solution Adaption for Multi-Objective Metal Cutting Process Optimization [59.45414406974091]
  We introduce a framework for system flexibility that allows us to study the ability of an algorithm to transfer solutions from previous optimization tasks. We study the flexibility of NSGA-II, which we extend by two variants: 1) varying goals, that optimize solutions for two tasks simultaneously to obtain in-between source solutions expected to be more adaptable, and 2) active-inactive genotype, that accommodates different possibilities that can be activated or deactivated. Results show that adaption with standard NSGA-II greatly reduces the number of evaluations required for optimization to a target goal, while the proposed variants further improve the adaption costs.
  arXiv  Detail & Related papers  (2023-05-31T12:07:50Z)
• Full Stack Optimization of Transformer Inference: a Survey [58.55475772110702]
  Transformer models achieve superior accuracy across a wide range of applications. The amount of compute and bandwidth required for inference of recent Transformer models is growing at a significant rate. There has been an increased focus on making Transformer models more efficient.
  arXiv  Detail & Related papers  (2023-02-27T18:18:13Z)
• Execution-based Code Generation using Deep Reinforcement Learning [8.085533911328577]
  PPOCoder is a new framework for code generation that combines pre-trained PL models with Proximal Policy Optimization. PPOCoder seamlessly integrates external code-specific knowledge into the model optimization process. It's important to note that PPOCoder is a task-agnostic and model-agnostic framework that can be used across different code generation tasks and PLs.
  arXiv  Detail & Related papers  (2023-01-31T18:02:26Z)
• Quantum-Inspired Optimization over Permutation Groups [0.2294014185517203]
  Quantum-inspired optimization (QIO) algorithms are computational techniques that emulate certain quantum mechanical effects on a classical hardware. We develop an algorithmic framework, called Perm-QIO, to tailor QIO tools to solve an arbitrary optimization problem.
  arXiv  Detail & Related papers  (2022-12-06T00:02:39Z)
• Progress Report: A Deep Learning Guided Exploration of Affine Unimodular Loop Transformations [1.5699353548228476]
  We present a work in progress about a deep learning based approach for automatic code optimization in polyhedral compilers. The proposed technique explores combinations of affine and non-affine loop transformations to find the sequence of transformations that minimizes the execution time of a given program. Preliminary results show that the proposed techniques achieve a 2.35x geometric mean speedup over state of the art polyhedral compilers.
  arXiv  Detail & Related papers  (2022-06-08T05:47:42Z)
• An Adaptive Incremental Gradient Method With Support for Non-Euclidean Norms [19.41328109094503]
  We propose and analyze several novel adaptive variants of the popular SAGA algorithm. We establish its convergence guarantees under general settings. We improve the analysis of SAGA to support non-Euclidean norms.
  arXiv  Detail & Related papers  (2022-04-28T09:43:07Z)
• Scalable Deep-Learning-Accelerated Topology Optimization for Additively Manufactured Materials [4.221095652322005]
  Topology optimization (TO) is a popular and powerful computational approach for designing novel structures, materials, and devices. To address these issues, we propose a general scalable deep-learning (DL) based TO framework, referred to as SDL-TO. Our framework accelerates TO by learning the iterative history data and simultaneously training on the mapping between the given design and its gradient.
  arXiv  Detail & Related papers  (2020-11-28T17:38:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.