Parallel scheduling of recursively defined arrays
This paper describes a new method of automatic generation of concurrent programs which construct arrays defined by sets of recursive equations. We assume that the time of computation of an array element is a linear combination of its indices, and we use integer programming to seek a succession of hyperplanes along which array elements can be computed concurrently. The method can be used to schedule equations involving variable length dependency vectors and mutually recursive arrays. Portions of the work reported here have been implemented in the PS automatic program generation system.
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Scheduling Sequential Loops on Parallel Processors
- Parallel scheduling of recursively defined arrays: Revisited
- scientific article; zbMATH DE number 3995003
- Structured scheduling of recurrence equations: Theory and practice
- Can programming be liberated from the von Neumann style?
- Compilation of Nonprocedural Specifications into Computer Programs
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 3495856 (Why is no real title available?)
- Recursive functions of symbolic expressions and their computation by machine, Part I
- The parallel execution of DO loops
- Time and Parallel Processor Bounds for Fortran-Like Loops
This page was built for publication: Parallel scheduling of recursively defined arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106656)