Coflow scheduling in input-queued switches: Optimal delay scaling and algorithms
A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing coflow-level delay, i.e., the time to complete all the flows in a coflow, in the...
Main Authors: | Liang, Qingkai (Contributor), Modiano, Eytan H (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2018-04-06T23:19:53Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
An algorithm for improved delay-scaling in input-queued switches
by: Weng, Wentao, et al.
Published: (2022) -
Scheduling flows and coflows in networks
Published: () -
Optimal scaling of average queue sizes in an input-queued switch: an open problem
by: Shah, Devavrat, et al.
Published: (2012) -
Emulation of an Output Queued Switch with a Combined Input Output Queued Switch
by: Jyh-Chiun Huang, et al.
Published: (1999) -
Highest Rank First: A New Class of Single-Iteration Scheduling Algorithms for Input-Queued Switches
by: Bing Hu, et al.
Published: (2018-01-01)