Talks and Poster Presentations (with Proceedings-Entry):
R Lezuo, P. Paulweber, A. Krall:
"CASM - Optimized Compilation of Abstract State Machines";
Talk: LCTES '14: 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems,
Edinburgh, UK;
06-12-2014
- 06-13-2014; in: "LCTES '14 Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems",
(2014),
ISBN: 978-1-4503-2877-7;
13
- 22.
English abstract:
In this paper we present CASM, a language based on Abstract State Machines (ASM), and its optimizing compiler. ASM is a well-defined (formal) method based on algebraic concepts. A distinct feature of ASM is its combination of parallel and sequential execution semantics. This makes it an excellent choice to formally specify and verify micro-architectures. We present a compilation scheme and an implementation of a runtime system supporting efficient execution of ASM.
After introducing novel analysis techniques we present optimizations allowing us to eliminate many costly operations.
Benchmark results show that our baseline compiler is 2-3 magnitudes faster than other ASM implementations. The optimizations further increase the performance of the compiled programs up to 264%. The achieved performance allows our ASM implementation to be used with industry-size applications.
Keywords:
ASM, compilation, optimization, redundancy elimination, parallelism
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1145/2597809.2597813
Created from the Publication Database of the Vienna University of Technology.