Contention-free communication scheduling for array redistribution

DOI10.1016/S0167-8191(00)00027-2zbMath0945.68016OpenAlexW2045626685MaRDI QIDQ1575628

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

parallelizing compilersarray redistributioncommunication schedulingdistributed memory machinesHPF

Mathematics Subject Classification ID

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

Related Items (1)

Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products

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