Abstract
Condensed graphs are proposed as an intermediate representation for functional and imperative languages. This representation may be executed on a variety of architectures, implementing a multilevel Condensed Graphs abstract machine. This machine incorporates characteristics and feedback information of its underlying architecture and guides dynamic topological transformations of the representation so as to optimize execution. These transformations can add or remove parallelism and change evaluation orders. Simulated executions of the intermediate representation, utilizing varying evaluation orders, on the abstract machine are presented. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Morrison, J. P., & Dalton, N. J. (1999). Condensed graphs: A multi-level, parallel, intermediate representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 866–876). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_122
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
