Half-Draining Round Robin Matching for High Performance Input Queued Switches

2019 ◽  
Author(s):  
Shutao Sun ◽  
Xiaoqing Li
Keyword(s):  
High Performance ◽  
Round Robin

Hipernetch: High-Performance FPGA Network Switch

2022 ◽  
Vol 15 (1) ◽  
pp. 1-31
Author(s):  
Philippos Papaphilippou ◽  
Jiuxi Meng ◽  
Nadeen Gebara ◽  
Wayne Luk
Keyword(s):  
High Frequency ◽  
High Performance ◽  
Data Centers ◽  
Round Robin ◽  
Switching Performance ◽  
Wide Range ◽  
Crossbar Switches ◽  
High Bandwidth ◽  
Network Switch ◽  
Network Switches

We present Hipernetch, a novel FPGA-based design for performing high-bandwidth network switching. FPGAs have recently become more popular in data centers due to their promising capabilities for a wide range of applications. With the recent surge in transceiver bandwidth, they could further benefit the implementation and refinement of network switches used in data centers. Hipernetch replaces the crossbar with a “combined parallel round-robin arbiter”. Unlike a crossbar, the combined parallel round-robin arbiter is easy to pipeline, and does not require centralised iterative scheduling algorithms that try to fit too many steps in a single or a few FPGA cycles. The result is a network switch implementation on FPGAs operating at a high frequency and with a low port-to-port latency. Our proposed Hipernetch architecture additionally provides a competitive switching performance approaching output-queued crossbar switches. Our implemented Hipernetch designs exhibit a throughput that exceeds 100 Gbps per port for switches of up to 16 ports, reaching an aggregate throughput of around 1.7 Tbps.

scholarly journals An Adaptive Beamforming Time with Round-Robin MAC Algorithm for Reducing Energy Consumption in MANET

2018 ◽  
Vol 7 (4) ◽  
pp. 50 ◽  
Author(s):  
Vincenzo Inzillo ◽  
Floriano Rango ◽  
Alfonso Quintana ◽  
Amilcare Santamaria
Keyword(s):  
Energy Consumption ◽  
High Performance ◽  
Network Performance ◽  
Ad Hoc ◽  
Smart Antenna ◽  
Adaptive Beamforming ◽  
Round Robin ◽  
Medium Access Control Protocols ◽  
Medium Access ◽  
Hoc Networks

The use of smart antenna systems (SASs) in mobile ad hoc networks (MANETs) has been promoted as the best choice to improve spatial division multiple access (SDMA) and throughput. Although directional communications are expected to provide great advantages in terms of network performance, directional MAC (medium access control) protocols introduce several issues. One of the most known problems in this context is represented by the fact that, when attempting to solve or at least mitigate the problems introduced by these kinds of antennas especially at MAC layer, a large amount of energy consumption is achieved; for example, due to excessive retransmissions introduced by very frequently issue such as deafness and handoff. The expedients proposed in order to reduce these drawbacks attempting to limit beamforming time of nodes in cooperation with a round-robin scheduling can grant high performance in terms of fairness and throughput. However, the overall energy distribution in the network is not efficient due to static approach. In view of this, we propose adaptive beamforming time with round-robin MAC providing a dynamic assignment of the beamforming time with the aim to limit the waste of energy of nodes. The proposed approach provides benefits in terms of energy consumption distribution among nodes in sectorized antennas environments and, simultaneously, improves MAC packet performance.

scholarly journals Experimental Setup for Investigating the Efficient Load Balancing Algorithms on Virtual Cloud

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7342
Author(s):  
Bhavya Alankar ◽  
Gaurav Sharma ◽  
Harleen Kaur ◽  
Raul Valverde ◽  
Victor Chang
Keyword(s):  
Load Balancing ◽  
High Performance ◽  
Round Robin ◽  
Experimental Setup ◽  
Cloud Infrastructure ◽  
Use Of Resources ◽  
Virtualization Technology ◽  
Distribution Of Resources ◽  
Load Balancer ◽  
Performance Computing

Cloud computing has emerged as the primary choice for developers in developing applications that require high-performance computing. Virtualization technology has helped in the distribution of resources to multiple users. Increased use of cloud infrastructure has led to the challenge of developing a load balancing mechanism to provide optimized use of resources and better performance. Round robin and least connections load balancing algorithms have been developed to allocate user requests across a cluster of servers in the cloud in a time-bound manner. In this paper, we have applied the round robin and least connections approach of load balancing to HAProxy, virtual machine clusters and web servers. The experimental results are visualized and summarized using Apache Jmeter and a further comparative study of round robin and least connections is also depicted. Experimental setup and results show that the round robin algorithm performs better as compared to the least connections algorithm in all measuring parameters of load balancer in this paper.

P2R2: Parallel Pseudo-Round-Robin arbiter for high performance NoCs

Integration ◽  
2015 ◽  
Vol 50 ◽  
pp. 173-182 ◽  
Author(s):  
Ramin Bashizade ◽  
Hamid Sarbazi-Azad
Keyword(s):  
High Performance ◽  
Round Robin

A High-Performance Scheduling Algorithm for Buffered Crossbar Switch

2011 ◽  
Vol 268-270 ◽  
pp. 2101-2107
Author(s):  
Mei Yue Yang ◽  
Peng Wang ◽  
Xiang Tao Li ◽  
Sheng Ping Zhu
Keyword(s):  
Theoretical Analysis ◽  
High Performance ◽  
Scheduling Algorithm ◽  
Main Idea ◽  
Round Robin ◽  
Cross Point ◽  
Scheduling Policies ◽  
Time Performance ◽  
Simulation Results ◽  
Burst Performance

The limitations in complexity and scalability of current combined input and cross-point queuing switching scheduling policies are first analyzed. To overcome the deficiencies in supporting fair and QOS scheduling, we propose a fair and simple high-performance scheduling algorithm for Combined Input-Cross-point-Queued Switches, which is called Fair Service and Group Smoothed Round Robin (FGSR). The main idea of FGSR is that it first groups flows according to their weight, then decides which group to be scheduled by SRR and finally decides which flow from the selected group to be scheduled. FGSR is based on round robin mechanism, whose complexity is only O(1). FGSR groups and schedules flows according to the weight of flows, thus it has good fairness and can adapt to the need of real-time performance. Theoretical analysis and simulation results show that FGSR exhibits good delay, throughput and anti-burst performance.

Bandwidth Guaranteed Multicast Scheduling for Buffered Crossbar

2011 ◽  
Vol 474-476 ◽  
pp. 1819-1824
Author(s):  
Peng Wang ◽  
Shu Qiao Chen ◽  
Hong Chao Hu
Keyword(s):  
Real Time ◽  
High Performance ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Cross Point ◽  
Scheduling Policies ◽  
Time Performance ◽  
Simulation Results ◽  
Multicast Scheduling ◽  
Burst Performance

The limitations in complexities and extensibilities of current scheduling policies based on combined input and cross-point queuing switch (CICQ) are first analyzed. To overcome the deficiencies in supporting fair and QOS scheduling, we propose a fair and simple high-performance multicast scheduling algorithm for Combined Input Crosspoint Queued Switches, which is called multicast Fair Service and Group Smoothed Round Robin (mFGSR). The complexity of the algorithm is onlyO(1).mFGSR groups and schedules flows according to the weight of flows, thus it has good fairness and can adapt to the need of real-time performance. Theorotical analysis and simulation results show that mFGSR exhibits good delay, throughput and anti-burst performance.

Sign in / Sign up

Export Citation Format

Share Document