A method for parallelizing algorithms by vector scheduling functions

DOI10.1023/A:1010966620131MaRDI QIDQ1403183zbMATH OpenOpenAlexFDO

Authors S. V. Bakhanovich, N. A. Likhoded

Publication date 1 September 2003

Published in Programming and Computer Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1010966620131

zbMATH Keywords

multidimensional algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1535432
• Construction of generalized parallelizing functions
• Scheduling functions for spatiotemporal mapping of \(d\)-dimensional algorithms with homogeneous dependences on (\(d\)-2)-dimensional parallel architectures
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time
• Some efficient solutions to the affine scheduling problem. I: One- dimensional time

Cited in

(5)

• Scheduling functions for spatiotemporal mapping of \(d\)-dimensional algorithms with homogeneous dependences on (\(d\)-2)-dimensional parallel architectures
• A consistent generation of pipeline parallelism and distribution of operations and data among processors
• Piece-wise affine scheduling function
• Parallelizing of algorithms on the basis of splitting of macro-operations
• Construction of generalized parallelizing functions

This page was built for publication: A method for parallelizing algorithms by vector scheduling functions

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