Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (1996)
Oct. 20, 1996 to Oct. 23, 1996
Marc Pouzet , McGill University
This paper focuses on the compaction of tail-recursive programs --- arbitrary programs with conditionals, loops and function calls appearing in terminal position --- for fine-grain parallel machines like VLIW or super-scalars. An iterative compaction method based on instruction move-up and fold/unfold transformations is studied. In order to speed-up compaction and produce shorter schedules, we propose to use some information about the parallel complexity of expressions. This information is used on the fly during the compaction process to decide whether to unfold a function or not.
M. Pouzet, "Using the Parallel Complexity of Programs to Improve Compaction," Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques(PACT), Boston, MA, 1996, pp. 0111.