On generalized fat trees

Öhring, Sabine R.; Ibel, Maximilian; Das, Sajal K.; Kumar, Mohan

doi:10.1109/ipps.1995.395911

Cited by 94 publications

(86 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Fat-Tree is a scalable hierarchical network topology [98,101], that is easy to build using commodity switches placed on different levels of the hierarchy [102]. The main idea behind the Fat-Trees is to employ fatter links between nodes, with more available bandwidth, towards the roots of the topology.…”

Section: The Fat-tree Topologymentioning

confidence: 99%

“…The fatter links help to avoid congestion in the upper-level switches of the topology, and the bisection bandwidth is maintained 8 . Different variations of Fat-Trees are presented in the literature, including k -ary-n-trees [101], Extended Generalized Fat-Trees (XGFTs) [98], Parallel Ports Generalized Fat-Trees (PGFTs) and Real Life Fat-Trees (RLFTs) [104].…”

Section: The Fat-tree Topologymentioning

confidence: 99%

See 1 more Smart Citation

A Novel Query Caching Scheme for Dynamic InfiniBand Subnets

Tasoulas

Gran

Johnsen³

et al. 2015

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing

View full text Add to dashboard Cite

The advent of the Internet of Things, sensor and social networks, to mention just a few examples, all contribute towards the solid establishment of the Big Data era. High Performance Computing (HPC) becomes necessary for the efficient processing of the massive amounts of data our society generates, and cloud computing is a critical component to deliver this processing power to a broader audience that cannot afford to acquire and maintain such complex computing systems themselves. However, HPC specific technology and performance is not yet apt to be delivered efficiently over highly flexible and dynamic environments, as typically are the virtualized cloud infrastructures.In this thesis, we address challenges that arise in high performance dynamic cloud environments, that are equipped with HPC specific technology, in the context of networking and virtualization. We use InfiniBand, a high performance lossless interconnection network as the basis of our research, and first show that lossless networks pose prime challenges when the nature of the infrastructure is very dynamic, i.e. exhibits continuous changes. Then we propose a network I/O virtualization architecture, the InfiniBand vSwitch architecture, that can make lossless network technologies more favorable in the cloud. Moreover, we propose different network reconfiguration methods to enable performance-driven reconfigurations in very large network topologies that are commonly found in data centers. Performance-driven reconfigurations are frequently needed to adapt to unpredictable workload changes resulting from the shared and on-demand nature of a cloud platform, or when cloud providers employ live migration of virtual machines to optimize the resource usage of their infrastructure. Last but not least, we propose a new Quality-of-Service metric, called delay, to capture the directly observable service degradation in consolidated cloud environments. We suggest that the delay can be used as a direct service level agreement metric between cloud providers and cloud tenants. AcknowledgementsFirst, I would like to express my gratitude to my three supervisors; Ernst Gunnar Gran, Tor Skeie and Kyrre Begnum. Without their positiveness, supervision, suggestions and encouragement, my PhD journey would not have been so fruitful and enjoyable during both the good and hard times. Then I would like to thank Bjørn Dag Johnsen from Oracle Norway, our closest collaborate in the ERAC project, the project that mainly funded this thesis, for his enthusiastic attitude and participation in the important discussions that shaped the direction of my work and introduced industrial relevance. My appreciation goes as well to Feroz Zahid for being the most easygoing colleague whom I could imagine sharing office with, and a brilliant and ambitious associate, and Sven-Arne Reinemo for his supervision during my early days.A special thank you must be directed to Hårek Haugerud, Anis Yazidi, Hugo Lewi Hammer, Laurence Marie Anna Habib and the whole NETSYS group at the Oslo and Akershus...

show abstract

Section: The Fat-tree Topologymentioning

confidence: 99%

Section: The Fat-tree Topologymentioning

confidence: 99%

A Novel Query Caching Scheme for Dynamic InfiniBand Subnets

Tasoulas

Gran

Johnsen³

et al. 2015

2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing

View full text Add to dashboard Cite

show abstract

“…Existing deterministic single-path routing algorithms for ( + , ) are either the Source-mod-k routing (S-m-k) [6], [8], [9] or the Destination-mod-k routing (D-m-k) [3], [9], [12]. A good summary of routing in generalized fat-trees can be found in [9].…”

Section: A Worst-case Permutation Load Of Existing Routing Algorithmsmentioning

confidence: 99%

“…Figure 1 (a) illustrates the 2-level generalized fat-tree topology, which belongs to a family of extended generalized fat-trees [8]. This topology consists of two levels of switches and one layer of leaf nodes (processing nodes).…”

Section: Introductionmentioning

confidence: 99%

“…In this routing scheme, one path is used to carry all traffics from a source to a destination. Existing single-path deterministic routing for generalized fat trees include Sourcemod-k routing [6], [8], [9] and Destination-mod-k routing [3], [9], [12]. As will be shown later, all of these existing routing schemes are not ideal for many common communication patterns.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improving Performance of Deterministic Single-Path Routing on 2-Level Generalized Fat-Trees

Nienaber

Mahapatra

Yuan

2011

2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PHD Forum

View full text Add to dashboard Cite

Abstract-This paper focuses on deterministic single-path routing schemes on 2-level generalized fat-trees. We develop a routing algorithm that is optimal in terms of worst-case permutation performance. In comparison to existing routing schemes for such topologies, our algorithm also improves the average performance of common communication patterns including bisect patterns, full permutation patterns, and dissemination (Bruck) patterns on various 2-level generalized fat-trees as demonstrated in our evaluation results.

show abstract

An Overview of Topology Mapping Algorithms and Techniques in High‐Performance Computing

Hoefler

Jeannot

Mercier³

et al. 2014

High‐Performance Computing on Complex Environments

View full text Add to dashboard Cite

Due to the advent of modern hardware architectures of high-performance computers, the way the parallel applications are laid out is of paramount importance for performance. This chapter surveys several techniques and algorithms that efficiently address this issue: the mapping of the application's virtualtopology(forinstanceits communication pattern) onto the physical topology. Using such strategy enables to improve the application overall execution time significantly. The chapter concludes by listing a series of open issues and problems.

show abstract

On generalized fat trees

Cited by 94 publications

References 12 publications

A Novel Query Caching Scheme for Dynamic InfiniBand Subnets

A Novel Query Caching Scheme for Dynamic InfiniBand Subnets

Improving Performance of Deterministic Single-Path Routing on 2-Level Generalized Fat-Trees

An Overview of Topology Mapping Algorithms and Techniques in High‐Performance Computing

Contact Info

Product

Resources

About