An efficient heuristic scheme for dynamic remapping of parallel computations

DOI10.1016/0167-8191(93)90011-9MaRDI QIDQ1802665zbMATH OpenOpenAlexFDO

Authors Alok Choudhary, Bhagirath Narahari, Ramesh Krishnamurti

Publication date 31 October 1994

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(93)90011-9

zbMATH Keywords

computation loaddistributed memory systemdynamic remapping schemeexperimental resultsIntel iPSCmapping algorithmparallel computation

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Mathematical problems of computer architecture (68M07) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal periodic remapping of dynamic bulk synchronous computations
• scientific article; zbMATH DE number 1737492
• A method for the on-line use of off-line derived remappings of iterative automatic target recognition tasks onto a particular class of heterogeneous parallel platforms
• scientific article; zbMATH DE number 1196829
• scientific article; zbMATH DE number 2153019

Cited in

(4)

• A method for the on-line use of off-line derived remappings of iterative automatic target recognition tasks onto a particular class of heterogeneous parallel platforms
• Optimal periodic remapping of dynamic bulk synchronous computations
• scientific article; zbMATH DE number 1737492 (Why is no real title available?)
• scientific article; zbMATH DE number 1760099 (Why is no real title available?)

This page was built for publication: An efficient heuristic scheme for dynamic remapping of parallel computations

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