Communication in parallel systems : Models, algorithms and implementations

MaRDI QIDQ2763056zbMATH OpenFDO

Authors Ingo Rieping

Publication date 14 January 2002

zbMATH Keywords

parallel systems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• Communication primitives for BSP computers
• The bulk-synchronous parallel random access machine
• scientific article; zbMATH DE number 1728439
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• scientific article; zbMATH DE number 2102734

Cited in

(12)

• On interprocess communication. II: Algorithms
• Communication relations: A paradigm for parallel program design
• Symbolic communication set generation for irregular parallel applications
• Optimal broadcast on parallel locality models
• Meta model of concurrent computation. II: Symmetric communication
• scientific article; zbMATH DE number 3938553 (Why is no real title available?)
• Collective communication operations: experimental results vs. theory
• scientific article; zbMATH DE number 2087779 (Why is no real title available?)
• scientific article; zbMATH DE number 2102734 (Why is no real title available?)
• COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM
• Communication efficient BSP algorithm for all nearest smaller values problem
• Communication primitives for BSP computers

This page was built for publication: Communication in parallel systems : Models, algorithms and implementations

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