Introduction to Dynamic Code Generation an Experiment with Matrix Multiplication for the STHORM Platform

International audienceSince the early beginning of computer history, one has needed programming languages as an intermediate representation between algorithms description and machine-readable instructions. In broad outline, running an algorithm on a computer requires the following steps: (1-software development, implementation) the developer transcribes the algorithm into a source file containing programming language instructions, (2-compilation) a compiler translates these programming language instructions into machine code and performs adaptations to the original code for optimized fit to the target execution support, and (3-execution) the processor reads and executes the machine instructions, loads the input data and produces the data results