Journal ArticleDOI
Design and performance analysis of the practical fat tree network using a butterfly network
Reads0
Chats0
TLDR
Although the PFN is a dynamic connection network, it shows low delay and high throughput for the applications that have locality, and the proposed performance model effectively highlights this locality factor.About:
This article is published in Journal of Systems Architecture.The article was published on 1997-03-15. It has received 7 citations till now. The article focuses on the topics: Fat tree & Hypertree network.read more
Citations
More filters
Proceedings ArticleDOI
On the influence of selection function on the performance of fat-trees under hot-spot traffic
TL;DR: This paper proposes a new selection function SAOP, which is based on the stage and the source node address and argues that the SAOP is more suitable for hot-spot traffic than other selection functions.
Journal ArticleDOI
Global Round Robin: Efficient Routing With Cut-Through Switching in Fat-Tree Data Center Networks
TL;DR: In this paper, a novel framework for designing per-packet load-balanced routing algorithms in fat tree called global round robin (GRR) is proposed and it is proved that both GRR and IGRR can guarantee 100% throughput under a wide class of traffic.
Proceedings ArticleDOI
An Efficient Routing Algorithm in Fat-Tree Data Center Networks
TL;DR: The simulation results show that GRR provides the best delay/throughput performance among the existing routing algorithms for data center networks.
Proceedings ArticleDOI
A Parallel FFT Scheme Based on Multi-Machines Environment
TL;DR: A parallel FFT course and its scheduling scheme in multi-machines environment were introduced and how to do further optimization on this scheme for the optimal accelerating rate was discussed.
Proceedings ArticleDOI
A Methodology for Easing the Congestion in Fat-trees Using Traffic Pattern Detection
TL;DR: A management mechanism for fat-trees for selecting a certain selection function for certain traffic pattern that is proved to give better performance under the detected traffic pattern is proposed and used to decrease congestion in the network.
References
More filters
Journal ArticleDOI
A Proof for the Queuing Formula: L = λW
TL;DR: In this paper, it was shown that if the three means are finite and the corresponding stochastic processes strictly stationary, and if the arrival process is metrically transitive with nonzero mean, then L = λW.
Book
Fat-trees: universal networks for hardware-efficient supercomputing
TL;DR: In this article, the authors presented a new class of universal routing networks, called fat-trees, which might be used to interconnect the processors of a general-purpose parallel supercomputer, and proved that a fat-tree of a given size is nearly the best routing network of that size.
Journal ArticleDOI
Fat-trees: Universal networks for hardware-efficient supercomputing
TL;DR: In this article, the authors presented a new class of universal routing networks, called fat-trees, which might be used to interconnect the processors of a general-purpose parallel supercomputer, and proved that a fat-tree of a given size is nearly the best routing network of that size.
Journal ArticleDOI
The Network Architecture of the Connection Machine CM-5
Charles E. Leiserson,Zahi S. Abuhamdeh,David C. Douglas,Carl R. Feynman,Mahesh N. Ganmukhi,Jeffrey V. Hill,W. Daniel Hillis,Bradley C. Kuszmaul,Margaret A. St. Pierre,David S. Wells,Monica C. Wong-Chan,Shaw-Wen Yang,Robert C. Zak +12 more
TL;DR: The Connection Machine Model CM-5 supercomputer as discussed by the authors is a massively parallel computer system designed to offer performance in the range of 1 teraflops (1012 floating point operations per second).