Affiliation:
1. Vienna University of Technology, Vienna, Austria
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.
Funder
Österreichische Forschungsförderungsgesellschaft
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference24 articles.
1. Nested parallelism in transactional memory
2. M.
Anlauff
.
XASM- An Extensible Component-Based Abstract State Machines Language. In Y. Gurevich P. Kutter M. Odersky and L. Thiele editors Abstract State Machines - Theory and Applications volume
1912
of
Lecture Notes in Computer Science pages
69
--
90
.Springer Berlin Heidelberg 2000
.
ISBN
978--3--540--67959--2. M. Anlauff. XASM- An Extensible Component-Based Abstract State Machines Language. In Y. Gurevich P. Kutter M. Odersky and L. Thiele editors Abstract State Machines - Theory and Applications volume 1912 of Lecture Notes in Computer Science pages 69--90.Springer Berlin Heidelberg 2000. ISBN 978--3--540--67959--2.
3. Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献