Declarative, SAT-solver-based Scheduling for an Embedded Architecture with a Flexible Datapath

Much like VLIW, statically scheduled architectures that expose all control signals to the compiler offer much potential for highly parallel, energy-efficient performance. Bau is a novel compilation infrastructure that leverages the LLVM compilation tools and the MiniSAT solver to generate efficient code for one such exposed architecture. We first build a compiler construction library that allows scheduling and resource constraints to be expressed declaratively in a domain specific language, and then use this library to implement a compiler that generates programs that are 1.2–1.5 times more compact than either a baseline MIPS R2K compiler or a basic-block-based, sequentially phased scheduler

Declarative, SAT-solver-based Scheduling for an Embedded Architecture with a Flexible Datapath

Abstract-Much like VLIW, statically scheduled architectures that expose all control signals to the compiler offer much potential for highly parallel, energy-efficient performance. Bau is a novel compilation infrastructure that leverages the LLVM compilation tools and the MiniSAT solver to generate efficient code for one such exposed architecture. We first build a compiler construction library that allows scheduling and resource constraints to be expressed declaratively in a domainspecific language, and then use this library to implement a compiler that generates programs that are 1.2-1.5 times more compact than either a baseline MIPS R2K compiler or a basic-block-based, sequentially phased scheduler