Contention-free communication scheduling for array redistribution

DOI10.1016/S0167-8191(00)00027-2MaRDI QIDQ1575628zbMATH OpenOpenAlexFDO

Authors N. Delaunay

Publication date 21 August 2000

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(00)00027-2

zbMATH Keywords

distributed memory machinesHPFparallelizing compilerscommunication schedulingarray redistribution

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of compilers and interpreters (68N20)

Recommendations

• Improving communication scheduling for array redistribution
• Efficient communication contention aware scheduling in heterogeneous system
• Conflict-free allocation of arrays during parallel computations
• scientific article; zbMATH DE number 2090583
• A message combining approach for efficient array redistribution in non-all-to-all communication networks

Cited in

(4)

• A message combining approach for efficient array redistribution in non-all-to-all communication networks
• scientific article; zbMATH DE number 2080127 (Why is no real title available?)
• Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products
• Improving communication scheduling for array redistribution

This page was built for publication: Contention-free communication scheduling for array redistribution

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