An architecture-independent graphical tool for automatic contention-free process-to-processor mapping

DOI10.1023/A:1008171232465MaRDI QIDQ5934282zbMATH OpenOpenAlexFDO

Authors Hong Shen, Sam Lor, Piyush Maheshwari

Publication date 7 November 2001

Published in The Journal of Supercomputing (Search for Journal in Brave)

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

zbMATH Keywords

parallel processingscheduling

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 279005
• scientific article; zbMATH DE number 1760017
• Efficient algorithms for mapping and partitioning a class of parallel computations
• Mapping parallel programs to multiprocessors: A dynamic approach
• ON THE COMPLEXITY OF THE MAPPING PROBLEM FOR MASSIVELY PARALLEL ARCHITECTURES

Cited in

(5)

• Mapping parallel programs to multiprocessors: A dynamic approach
• scientific article; zbMATH DE number 1760017 (Why is no real title available?)
• scientific article; zbMATH DE number 1844538 (Why is no real title available?)
• scientific article; zbMATH DE number 1844562 (Why is no real title available?)
• scientific article; zbMATH DE number 2090590 (Why is no real title available?)

This page was built for publication: An architecture-independent graphical tool for automatic contention-free process-to-processor mapping

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