DSP Instruction Set Simulation

Brandner, Florian; Horspool, R. Nigel; Krall, Andreas

doi:10.1007/978-1-4614-6859-2_29

Cited by 2 publications

(1 citation statement)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…(On a side note: by using well-known compiled simulation techniques (e.g. [8]) the size of the basic blocks can be enlarged from which our compiler would profit immediately.) In figure 9 the overall speedup factors for the applications are shown along with absolute performance data.…”

Section: Resultsmentioning

confidence: 99%

Casm

Lezuo

Paulweber

Krall

2014

Proceedings of the 2014 SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems

Self Cite

View full text Add to dashboard Cite

In this paper we present CASM, a language based on Abstract State Machines (ASM), and its optimizing compiler. ASM is a welldefined (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.

show abstract

Section: Resultsmentioning

confidence: 99%

Casm

Lezuo

Paulweber

Krall

2014

Proceedings of the 2014 SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems

Self Cite

View full text Add to dashboard Cite

show abstract

Casm

2014

View full text Add to dashboard Cite

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.

show abstract

DSP Instruction Set Simulation

Cited by 2 publications

References 43 publications

Casm

Casm

Casm

Contact Info

Product

Resources

About