scientific article; zbMATH DE number 5353986

zbMATH Open1153.65131MaRDI QIDQ3530320FDOQ3530320

Authors: F. A. Torkey, Afaf A. Sala, Nahed M. El Desouky, Sahar A. Gomaa 

Publication date: 20 October 2008

Title of this publication is not available (Why is that?)

Recommendations

• Parallelization of divide-and-conquer by translation to nested loops
• Partitioning and mapping nested loops on multicomputers
• Computational Science and Its Applications – ICCSA 2004
• Fine-grain parallelization of imperfectly nested loops

zbMATH Keywords

distance matrixparallel computationparallelismloop transformationsunimodular transformationaffine partitioning

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Parallel algorithms in computer science (68W10)

Cited In (4)

• Unimodular transformations of non-perfectly nested loops
• Communication-free hyperplane partitioning of nested loops
• ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
• On loop transformations of nested loops with affine dependencies

This page was built for publication:

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