On polynomial Code Generation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

On polynomial Code Generation

Paul Feautrier
Albert Cohen
Alain Darte


In static analysis, one often has to deal with polynomials in the program control variables, either native to the source code or created by enabling analyses. We have explained elsewhere how to compute dependences in such situations and use them for building polynomial schedules. It remains to explain how to generate polynomial code. The present proposal is to target new parallel programming languages of the async/finish family, like X10 or Habanero, which are "polynomial friendly" and for which efficient compilers exists. Both these languages have barrier-like constructs-clocks for X10 and phasers for Habanero-which may be used to synchronize activities. To understand the behaviour of a clocked program, one has to count the number of clock advance operations since the creation of each activity. Advances with equal counts are synchronized , and these counts may be polynomials. The trick is therefore to insure that before executing an operation, its activity has executed as many advances as the current value of its schedule. This can be obtained by inserting auxilliary loops for executing the necessary advances. This scheme fails if the schedule is not monotone increasing with respect to the execution order in each activity. This problem may be solved by reordering the activities-which is possible since the real execution order is given by the schedule-or in extreme cases by index set splitting.
Fichier principal
Vignette du fichier
polyGen_author.pdf (219.02 Ko) Télécharger le fichier

Dates and versions

hal-01958096 , version 1 (18-12-2018)




  • HAL Id : hal-01958096 , version 1


Paul Feautrier, Albert Cohen, Alain Darte. On polynomial Code Generation. IMPACT 2018, Jan 2018, Manchester, United Kingdom. ⟨hal-01958096⟩
110 View
146 Download


Gmail Facebook X LinkedIn More