Fine-grain parallelization of imperfectly nested loops

MaRDI QIDQ5930901zbMATH OpenFDO

Authors Kichang Kim

Publication date 26 April 2001

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

zbMATH Keywords

fine-grain parallelism

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• On the parallel complexity of loops
• scientific article; zbMATH DE number 618313
• On the problem of optimizing parallel programs for complex memory hierarchies
• scientific article; zbMATH DE number 2089182
• On loop transformations of nested loops with affine dependencies

Cited in

(11)

• The static parallelization of loops and recursions
• On the parallel complexity of loops
• On serial and parallel implementations of the Erlang fixed-point iteration scheme
• scientific article; zbMATH DE number 5353986 (Why is no real title available?)
• Extracting synchronization-free slices of operations in perfectly-nested loops
• Efficient support for fine-grain parallelism on shared-memory machines
• ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
• scientific article; zbMATH DE number 1844663 (Why is no real title available?)
• scientific article; zbMATH DE number 2090596 (Why is no real title available?)
• Languages and Compilers for Parallel Computing
• Exploiting parallelism on a fine-grained MIMD architecture based upon channel queues

This page was built for publication: Fine-grain parallelization of imperfectly nested loops

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