accelerating apl programs with sac
The paper investigates, how S AC , a purely functional language based on C syntax, relates to A PL in terms of expressiveness and run-time behavior. To do so, three different excerpts of real world A PL programs are examined. It is shown that after defining the required A PL primitives in S AC , the example programs can be re-written in S AC with an almost one-to-one correspondence. Run-time comparisons between interpreting A PL programs and compiled S AC programs show that speedups due to compilation vary between 2 and 500 for three representative benchmark programs.
sac compilation language comparison runtime performance