Stanfords Flamel System

The Flamel system was Trickey s thesis work at Stanford University. Flamel includes transformations, scheduling, and data path synthesis. 

A subset of Pascal (1) limiteii to a single, parameterless, non-recursive procedure, (2) supporting only single-dimensional arrays, and (3) not allowing multiplication and division except by constants that are powers of 2. 

Uses a dataflow / controlflow gr Q)h, called a dacon. The initial description is represented using a block graph to show the transfers between basic blocks, and with I rected Acyclic Oiraphs (DAGs) to represent the data flow within each basic block. Control edges can be added to each DAG to represent execution order constraints. 

Automatically applies block-level transformations to produce the dacon with the fastest implementation. Transformations supported merge adjacent bloi s, combine a block followed by two or more conditionally executed blocks into a single block, unroll loops, and move the test at the top of a loop to the bottom of the loop. 

algebraic transformations are used to reduce the height of the dacon. 

---