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

Pages

313-348

DOI

10.1007/bf01407835

DOI registrant

Springer Nature

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:a18f2c9a6f20 · see in the full table