Efficient Coflow Scheduling Without Prior Knowledge
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Inter-coflow scheduling improves application-level communication performance in data-parallel clusters. However, existing efficient schedulers require a priori coflow information and ignore cluster dynamics like pipelining, task failures, and speculative executions, which limit their applicability. Schedulers without prior knowledge compromise on performance to avoid head-of-line blocking. In this paper, we present Aalo that strikes a balance and efficiently schedules coflows without prior knowledge.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
An experimental time-sharing system
Corbató, F. J., Merwin-Daggett, M., & Daley, R. C. (1962) · Proceedings of the May 1-3, 1962, spring joint computer conference on - AIEE-IRE '62 (Spring) · doi:10.1145/1460833.1460871 · Cited by 234 · cited 2×
“proposed the multi-level feedback queue (MLFQ) algorithm [23], which was later analyzed by Coffman and Kleinrock [21].”
BackgroundMethodMotwani, R., Phillips, S., & Torng, E. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)90151-1 · Cited by 232
Cited by
AuTO: scaling deep reinforcement learning for datacenter-scale automatic traffic optimization
Chen, L., Lingys, J., Chen, K., & Liu, F. (2018) · Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3230543.3230551 · Cited by 282
Networking for Big Data: A Survey
Yu, S., Liu, M., Dou, W., Liu, X., & Zhou, S. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2610963 · Cited by 215
“59 times faster at the 95th percentile using Aalo in comparison to per-flow mechanisms [134].”
BackgroundMethodInfluential
Metadata
- Authors
- Chowdhury, M., & Stoica, I.
- Venue
- Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication
- Publisher
- ACM
- Published
- 2015-08-17
- Pages
- 393-406
- OpenAlex
- W2091520147
- Cited by
- 250
- References
- 3
- FWCI
- 33.03
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.