Exact partitioning of affine dependence algorithms

DOI10.1007/3-540-45874-3_8MaRDI QIDQ4471688zbMATH OpenFDO

Authors Jürgen Teich, Lothar Thiele

Publication date 30 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2268/22680135.htm

Mathematics Subject Classification ID

Numerical algorithms for specific classes of architectures (65Y10) Mathematical problems of computer architecture (68M07) Computing methodologies and applications (68U99)

Recommendations

• Partitioning of processor arrays: a piecewise regular approach
• Maximizing parallelism and minimizing synchronization with affine partitions
• Mapping of affine loop nests onto independent processors
• On uniformization of affine dependence algorithms
• Distribution of operations and data arrays over processors

Cited in

(10)

• Maximizing parallelism and minimizing synchronization with affine partitions
• Partitioning processor arrays under resource constraints
• Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep compu\-ta\-tions.
• Mapping of affine loop nests onto independent processors
• Partitioning of processor arrays: a piecewise regular approach
• scientific article; zbMATH DE number 1190794 (Why is no real title available?)
• scientific article; zbMATH DE number 1192974 (Why is no real title available?)
• scientific article; zbMATH DE number 125141 (Why is no real title available?)
• On uniformization of affine dependence algorithms
• Parametrized tiling: accurate approximations and analysis of global dependences

This page was built for publication: Exact partitioning of affine dependence algorithms

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