Diamond: Nesting the data center network with wireless rings in 3-d space

Y Cui, S **ao, X Wang, Z Yang, S Yan… - IEEE/ACM …, 2017 - ieeexplore.ieee.org
The introduction of wireless transmissions into the data center has shown to be promising in
improving cost effectiveness of data center networks (DCNs). For high transmission flexibility …

Scalable deadlock-free deterministic minimal-path routing engine for infiniband-based dragonfly networks

G Maglione-Mathey, P Yebenes… - … on Parallel and …, 2017 - ieeexplore.ieee.org
Dragonfly topologies are gathering great interest nowadays as one of the most promising
interconnect options for High-Performance Computing (HPC) systems. However …

Megafly: A topology for exascale systems

M Flajslik, E Borch, MA Parker - … 2018, Frankfurt, Germany, June 24-28 …, 2018 - Springer
In this paper we explore network topologies suitable for future exascale systems that need to
support over fifty thousand endpoints. With the increased necessity to use optics at higher …

Deadlock-free broadcast routing in dragonfly networks without virtual channels

D **ang, X Liu - IEEE Transactions on Parallel and Distributed …, 2015 - ieeexplore.ieee.org
A new deadlock-free unicast-based broadcast scheme is proposed based on a new routing
scheme called minus-first routing. Minus-first routing is a partially adaptive routing scheme in …

Barter-based cooperation in delay-tolerant personal wireless networks

L Buttyan, L Dora, M Felegyhazi… - 2007 IEEE International …, 2007 - ieeexplore.ieee.org
In this paper, we consider the application of delay-tolerant networks to personal wireless
communications. In these networks, selfish nodes can exploit the services provided by other …

Bundlefly: a low-diameter topology for multicore fiber

F Lei, D Dong, X Liao, J Duato - Proceedings of the 34th ACM …, 2020 - dl.acm.org
High-performance computing (HPC) systems keep increasing in size and bandwidth, thus
requiring larger and higher-bandwidth interconnection networks. The race to exascale just …

Connectivity and constructive algorithms of disjoint paths in dragonfly networks

S Wu, J Fan, B Cheng, J Yu, Y Wang - Theoretical Computer Science, 2022 - Elsevier
Dragonfly networks have been widely used in the current High Performance Computing
(HPC) computers due to lower global network diameter and other advantages of …

Contention-based nonminimal adaptive routing in high-radix networks

P Fuentes, E Vallejo, M García… - 2015 IEEE …, 2015 - ieeexplore.ieee.org
Adaptive routing is an efficient congestion avoidance mechanism for modern Data enter and
HPC networks. Congestion detection traditionally relies on the occupancy of the router …

Comparing global link arrangements for dragonfly networks

E Hastings, D Rincon-Cruz… - 2015 IEEE …, 2015 - ieeexplore.ieee.org
High-performance computing systems are shifting away from traditional interconnect
topologies to exploit new technologies and to reduce interconnect power consumption. The …

Opportunities and limitations of quality-of-service in message passing applications on adaptively routed dragonfly and fat tree networks

JJ Wilke, JP Kenny - 2020 IEEE International Conference on …, 2020 - ieeexplore.ieee.org
Avoiding communication bottlenecks remains a critical challenge in high-performance
computing (HPC) as systems grow to exascale. Numerous design possibilities exist for …