To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm...
To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
Conventional wisdom for minimizing the average flow completion time (AFCT) in the datacenter network (DCN), where flow sizes are highly variable, would suggest scheduling every individual flow. However, we show that considering scheduling delay (including scheduler's computational and communication delays), serving most of the flows without any sch...
Alternative Titles
Full title
To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2344449968
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2344449968
Other Identifiers
E-ISSN
2331-8422
