Scheduling Flows on a Switch to Optimize Response Times

SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures Virtual Event USA July, 2020, pp. 305-315, 2020.

Cited by: 0|Bibtex|Views22|DOI:https://doi.org/10.1145/3350755.3400218
EI
Other Links: arxiv.org|dl.acm.org|dblp.uni-trier.de|academic.microsoft.com

Abstract:

We study the scheduling of flows on a switch with the goal of optimizing metrics related to the response time of the flows. The input is a sequence of flow requests on a switch, where the switch is represented by a bipartite graph with a capacity on each vertex (port), and a flow request is an edge with associated demand. In each round, a...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments