Piece-wise affine scheduling function

MaRDI QIDQ5869314zbMATH OpenFDO

Authors E. V. Adutskevich, N. A. Likhoded

Publication date 28 September 2022

Full work available at URL http://mathnet.ru/eng/timb107

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Construction of generalized parallelizing functions
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time
• Obtaining affine transformations to improve locality of loop nests
• A method for parallelizing algorithms by vector scheduling functions
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time

Cites work

• scientific article; zbMATH DE number 5646042 (Why is no real title available?)
• scientific article; zbMATH DE number 1304271 (Why is no real title available?)
• scientific article; zbMATH DE number 1882444 (Why is no real title available?)
• Maximizing parallelism and minimizing synchronization with affine partitions
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time

Cited in

(2)

• Construction of generalized parallelizing functions
• scientific article; zbMATH DE number 7593728 (Why is no real title available?)

This page was built for publication: Piece-wise affine scheduling function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869314)