Bandwidth and Latency Guarantees in Low-Cost, High-Performance Networks

Based on the lessons learned from the study of ALU-biasing arbitration, we present a novel, cost-effective queueing and scheduling algorithm, called Rotating Combined Queueing (RCQ), which can efficiently support a range of service guarantees including deterministic delay bounds and bandwidth guarantees in multicomputer networks. We evaluate the quality of service that RCQ networks can provide and compare it to those of existing algorithms. Hardware costs for their implementations are also compared. Our results show that the suggested scheme overcomes limitations of the ServerNet approach and provides comparable quality of services to existing complicated approaches at much lower runtime overhead and implementation complexity.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2015

Author dc:creator

• Kim, Jae H.

Contributors dc:contributor

• Andrew A. Chien

• Computer Science

Language dc:language

eng

Identifier

(MiAaPQ)AAI9812653

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/81211