Parallel-algorithm communication operations generated by uniform dependences

MaRDI QIDQ2837508zbMATH OpenFDO

Authors N. A. Likhoded, P. I. Sobolevskij, A. A. Tolstikov

Publication date 10 July 2013

Published in Doklady Natsional'noĭ Akademii Nauk Belarusi (Search for Journal in Brave)

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Communication networks in operations research (90B18)

Recommendations

• Distribution of operations and data arrays over processors
• scientific article; zbMATH DE number 2107027
• On uniformization of affine dependence algorithms
• Sufficient conditions for the determination and use of data in the same granular parallel computation process
• scientific article; zbMATH DE number 4064461

Cited in

(10)

• Randomized parallel communications on an extension of the omega network
• Symbolic communication set generation for irregular parallel applications
• Parallel Repetition of Computationally Sound Protocols Revisited
• Communication-efficient parallel algorithms for distributed random-access machines
• Parallel communicating limited and uniformly limited 0L systems
• Method of ranking tiles size parameters of a parallel algorithm
• COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM
• Sufficient conditions for the determination and use of data in the same granular parallel computation process
• scientific article; zbMATH DE number 3936481 (Why is no real title available?)
• Communication relations: A paradigm for parallel program design

This page was built for publication: Parallel-algorithm communication operations generated by uniform dependences

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