Using the parallel complexity of programs to improve compaction

Author

Pouzet, Marc

Author_Institution

Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada

fYear

1996

fDate

35339

Firstpage

111

Lastpage

115

Abstract

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 superscalars. 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

Keywords

instruction sets; iterative methods; parallel machines; parallel programming; program control structures; VLIW; arbitrary programs; compaction; conditionals; fine-grain parallel machines; fold transformations; function calls; instruction move-up; iterative compaction method; loops; on the fly; parallel program complexity; schedules; superscalars; tail-recursive programs; terminal position; unfold transformations; Compaction; Computer architecture; Computer science; Convergence; Iterative algorithms; Iterative methods; Parallel machines; Processor scheduling; Runtime; VLIW;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures and Compilation Techniques, 1996., Proceedings of the 1996 Conference on

Conference_Location

Boston, MA

ISSN

1089-795X

Print_ISBN

0-8186-7633-7

Type

conf

DOI

10.1109/PACT.1996.554031

Filename

554031