Optimal algorithms for total exchange without buffering on the hypercube

DOI10.1007/BF01994840zbMath0757.68062MaRDI QIDQ1195935

Kris Coolsaet, H. E. De Meyer, Veerle Fack

Publication date: 26 January 1993

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

hypercubetotal exchange algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Related Items (3)

Methods and problems of communication in usual networks ⋮ Optimal algorithms for total exchange without buffering on the hypercube ⋮ Optimal data exchange algorithms on star graphs

Cites Work

• Total exchange algorithms on 'sandwich graphs'
• Optimal algorithms for total exchange without buffering on the hypercube
• Data communication in parallel architectures
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal algorithms for total exchange without buffering on the hypercube