Layered shortest path (LASH) routing in irregular system area networks

Skeie, Tor; Lysne, Olav; Theiss, I.

doi:10.1109/ipdps.2002.1016559

Cited by 53 publications

(43 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Routing algorithms can be topology-aware [104,105], that are optimized and target a specific network topology; or topology-agnostic [41,107], that can route traffic even in irregular topologies or regular topologies that have been impacted by faults. A topology-aware routing algorithm will ordinarily be able to calculate the routing tables faster, and deliver higher performance for the given network topology, but on the contrary, the topology-agnostic routing algorithms can be fully fault tolerant and work for any given topology.…”

Section: Routingmentioning

confidence: 99%

“…Bermúdez et al [117] are concerned with the long time it takes to compute optimal routing tables in 10 VLs provide the means to support independent data streams on the same physical link by using independent buffers in the switches. VLs are typically used for QoS, as well as by routing algorithms to resolve routing loops, that may lead to deadlocks, and improve performance, by reducing the Head-of-Line Blocking (HoLB) [41,107]. HoLB is a common phenomenon that appears when the network is congested, and packets that could otherwise proceed towards their destination have to wait in the switch buffer queues behind packets that cannot proceed due to their contribution in the congestion.…”

Section: Network Reconfigurationmentioning

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: Routingmentioning

confidence: 99%

Section: Network Reconfigurationmentioning

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

“…Proof: The proof follows from the system of equations (16)- (18) and inequalities (15), (21), and (22). Subtracting (16) from (21) and substituting P 2 from (18), we get…”

Section: Application Of the Cb Algorithm To Graphs With Small Degree mentioning

confidence: 99%

“…In [17,22], authors implemented a layered shortest path routing algorithm, LASH, where a number of virtual paths were used to break cycles in their simulated NOW clusters. In their model, layers contain only unidirectional paths where path assignment is done in a way to prevent cycle formation.…”

Section: Introductionmentioning

confidence: 99%

A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph

Levitin¹,

Karpovsky²,

Mustafa³

et al. 2006

JGAA

View full text Add to dashboard Cite

We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in computer and communication networks, such as Networks of Workstations. The proposed Cycle Breaking algorithm, or CB algorithm, guarantees that the constructed set of prohibited turns is minimal and that the fraction of the prohibited turns does not exceed 1/3 for any graph. The computational complexity of the proposed algorithm is O(N 2 ∆), where N is the number of vertices, and ∆ is the maximum node degree. The memory complexity of the algorithm is O(N ∆).We provide lower bounds on the minimum size of cycle-breaking sets for connected graphs. Further, we construct minimal cycle-breaking sets and establish bounds on the minimum fraction of prohibited turns for two important classes of graphs, namely, t-partite graphs and graphs with small degrees. The upper bounds are tight and demonstrate the optimality of the CB algorithm for certain classes of graphs. Results of computer simulations illustrate the superiority of the proposed CB algorithm as compared to the well-known and the widely used Up/Down technique.

show abstract

“…Another limitation is the use of non-minimal paths that tends to increase average message latency. To overcome (or at least attenuate) both issues, there exists a collection of routing algorithms and solutions: In-Transit Buffers (ITB) [16], Layered Shortest Path (LASH) [61], Multiple UD (MUD) [30], Transition Oriented Routing (TOR) [54], and Descending Layers (DL) [26]. Most of these algorithms use virtual channels to allocate different paths that, on the contrary, would create cycles in the CDG, thus inducing deadlock situations.…”

Section: Routing Algorithmsmentioning

confidence: 99%

Cost Effective Routing Implementations for On-chip Networks

Mocholi¹

View full text Add to dashboard Cite

Layered shortest path (LASH) routing in irregular system area networks

Cited by 53 publications

References 11 publications

A Novel Query Caching Scheme for Dynamic InfiniBand Subnets

A Novel Query Caching Scheme for Dynamic InfiniBand Subnets

A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph

Cost Effective Routing Implementations for On-chip Networks

Contact Info

Product

Resources

About