The frame approach for representing knowledge (ie, collection of frames are linked together
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …

The linear scan algorithm for register allocation provides a good register assignment with a
low compilation overhead and is thus frequently used for just-in-time compilers. Although …

We show that register allocation can be viewed as solving a collection of puzzles. We model
the register file as a puzzle board and the program variables as puzzle pieces; pre-coloring …

The significance of systems configurations has been increased in many applied domains
(eg, software, hardware, manufacturing systems, communication systems, supply chain …

With increasing general purpose programming capability, GPUs have become the mainstay
for a wide variety of compute intensive tasks from cloud to edge computing. Because of its …

Attribute grammars are a powerful specification formalism for tree-based computation,
particularly for software language processing. Various extensions have been proposed to …

Abstract Iterated Register Coalescing (IRC) is a widely used heuristic for performing register
allocation via graph coloring. Many implementations in existing compilers follow (more or …

An important feature of modern GPU architectures is variable occupancy. Occupancy
measures the ratio between the actual number of threads actively running on a GPU and the …

Recent research shows that maintaining SSA form allows to split register allocation into
separate phases: spilling, register assignment and copy coalescing. After spilling, register …

Compilers such as gcc use static-single-assignment (SSA) form as an intermediate
representation and usually perform SSA elimination before register allocation. But the order …