A Scalable Method for Signalling Dynamic Reconfiguration Events with OpenSM

Guay, Wei Lin; Reinemo, Sven-Arne

doi:10.1109/ccgrid.2011.48

Cited by 2 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fig. 1 summarises the optimisation feedback cycle that consists of the SM, the PM and our modified host stack with the host side dynamic reconfiguration capability [12,11]. In a subnet, the SM periodically sweeps the subnet to discover changes and maintain a fully connected subnet.…”

Section: Overviewmentioning

confidence: 99%

dFtree

Guay

Reinemo

Lysne

et al. 2011

Proceedings of the First International Workshop on Network-Aware Data Management

Self Cite

View full text Add to dashboard Cite

End-point hotspots can cause major slowdowns in interconnection networks due to head-of-line blocking and congestion. Therefore, avoiding congestion is important to ensure high performance for the network traffic. It is especially important in situations where permanent congestion, which results in permanent slowdown, can occur. Permanent congestion occurs when traffic has been moved away from a failed link, when multiple jobs run on the same system, and compete for network resources, or when a system is not balanced for the application that runs on it.In this paper we suggest a mechanism for dynamic allocation of virtual lanes and live optimization of the distribution of flows between the allocated virtual lanes. The purpose is to alleviate the negative effect of permanent congestion by separating network flows into slow lane and fast lane traffic. Flows destined for a end-point hot-spot is placed in the slow lane and all other flows are placed in the fast lane. Consequently, the flows in the fast lane are unaffected by the head-of-line blocking created by the hot-spot traffic.We demonstrate the feasibility of this approach using a modified version of OFED and OpenSM with fat-tree routing on a small InfiniBand cluster. Our experiments show an increase in throughput ranging from 150% to 468% compared to the conventional fat-tree algorithm in OFED.

show abstract

Section: Overviewmentioning

confidence: 99%