Parallel Switching in Connection-Oriented Networks

Authors:
James Anderson;Sanjoy Baruah;Kevin Jeffay
Affiliations:
-;-;-
Venue:
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Year:
1999

Citing 0
Cited 6

Optimal rate-based scheduling on multiprocessors

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal rate-based scheduling on multiprocessors

Journal of Computer and System Sciences
Efficient scheduling of soft real-time applications on multiprocessors

Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm

Real-Time Systems
Static-priority periodic scheduling on muitiprocessors

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Scheduling periodic tasks on uniform multiprocessors

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An efficient packet-scheduling algorithm that guarantees a deterministic quality of service to connections with real-time constraints is proposed { this algorithm is a generalization of some recent multiprocessor scheduling algorithms, and offers real-time performance guarantees similar to those offered by earlier fair-scheduling strategies such as Weighted Fair Queuing and proportional-share schemes.