Application Compilation

Technique

A constraint-programming-based compilation technique that maps applications onto custom processor extensions defined as computational patterns, enabling joint extension selection, scheduling, binding, and routing on architectures composed of a host processor tightly coupled with runtime reconfigurable cells.

First seen 6/9/2026

Last seen 6/9/2026

Evidence 1 chunks

Wiki v1

WIKI

Overview

Application Compilation is a compilation technique tailored for architectures that pair a general-purpose processor with runtime reconfigurable cells implementing custom instructions as processor extensions. In this setting, the compiler must not only translate the application but also identify, select, and map the application's computational patterns onto the available extensions, while scheduling and binding operations efficiently.

The technique was articulated as a constraint programming (CP) formulation in the design framework IFPEC (Integrated Framework for Processor Extension Compilation), in which custom instructions and applications are both modeled as graphs and matched using subgraph isomorphism and connected-component constraints.

READ FULL ARTICLE →

NEIGHBORHOOD

2 nodes · 1 edges

graph · Application Compilation · depth=1

RELATIONSHIPS

1 connections

IFPEC ← uses 100% 1e

IFPEC supports efficient application compilation for generated processor extensions.

LINKED ENTITIES

1 links

IFPEC USES Extracted graph relationship

CITATIONS

5 sources

5 citations — click to expand

[1] Application Compilation is formulated as a constraint programming problem that jointly handles extension identification, selection, application scheduling, binding, and routing on architectures with runtime reconfigurable cells tightly connected to a host processor. Constraint Programming Approach to Reconfigurable Processor Extension Generation and Application Compilation

[2] Custom instructions and applications are represented as graphs, and matched using subgraph isomorphism and connected component constraints. Constraint Programming Approach to Reconfigurable Processor Extension Generation and Application Compilation

[3] The flexibility and expressiveness of the CP framework allows heterogeneous constraints to be combined, enabling simultaneous solution of extension selection, application scheduling, and binding to improve result quality. Constraint Programming Approach to Reconfigurable Processor Extension Generation and Application Compilation

[4] HLS compilation of memory-bound applications for FPGAs is dominated by place-and-route, which can take minutes to days per bitstream, even though the RTL pipeline and memory organization are known within seconds. Analytical Model of Memory-Bound Applications Compiled with High Level Synthesis

[5] WebAssembly-compiled Unix applications run on average 45% (Firefox) to 55% (Chrome) slower than native code across the SPEC CPU suite, with peak slowdowns up to 2.5x. Not So Fast: Analyzing the Performance of WebAssembly vs. Native Code