Some Efficient Solutions to the Affine Scheduling Problem. Part I

Feautrier, P. (1992). Some Efficient Solutions to the Affine Scheduling Problem. Part I: One-Dimensional Time. International Journal of Parallel Programming, 313-348.

Type

Journal article

Intellectual base

Primary research

Year

1992

DOI

10.1007/bf01407835

Link

https://doi.org/10.1007/BF01407835

Cited by

1 citation across 1 artifact.

Domain-specific

• Polyhedral Model
  • A code generator scans the transformed integer sets and lowers them back into loops or compiler intermediate representation.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:a18f2c9a6f20 · see in the full table