Student: Suryamita Harindari
Advisors: Dr. Asterios Katsifodimos, Alexander Alexandrov, Prof. Dr. Volker Markl
The goal to translate the user program written in our DSL to the target code is achieved through the following three stages: (1) generate a control flow graph as an intermediate representation (IR) from Abstract Syntax Trees (AST) of the program, (2) perform data flow analysis to enrich the graph with data dependencies information, and (3) generate code or job scripts for the underlying system. This research develops the algorithm for each of three stages as well as the implementation of the first stage of the overall process. In the evaluation, we argue over the advantages of this DSL compared to related WMS work in terms of productivity and generality i.e. extensibility to other underlying platforms.