Optimal distribution assignment placement

DOI10.1007/BFB0002758MaRDI QIDQ4536958zbMATH OpenFDO

Authors Jens Knoop, E. Mehofer

Publication date 6 November 2002

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

Full work available at URL https://doi.org/10.1007/BFB0002758

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Recommendations

• Optimization of array redistribution for distributed memory multicomputers
• Data redistribution and concurrency
• A framework for efficient data redistribution on distributed memory multicomputers
• A divide-and-conquer algorithm for irregular redistribution in parallelizing compilers
• An efficient algorithm for irregular redistributions in parallelizing compilers

Cited in

(8)

• Optimal distribution strategies with cyclic demands
• Deriving array distributions by optimization techniques
• Acceptance and dispatching policies for a distribution problem
• scientific article; zbMATH DE number 2159141 (Why is no real title available?)
• scientific article; zbMATH DE number 2102050 (Why is no real title available?)
• Optimization of array redistribution for distributed memory multicomputers
• A pipeline technique for dynamic data transfer on a multiprocessor grid
• Data redistribution and concurrency

This page was built for publication: Optimal distribution assignment placement

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