Chronos: Meeting coflow deadlines in data center networks
Bibliographic record
Abstract
Guaranteed performance for data-parallel applications is important for both service providers and cloud data centers that host such services. A job of data-parallel applications involves communication among multiple machines to transmit intermediate results. Such communication comprises a collection of parallel flows, which is abstracted as a coflow in recent proposals. In this paper, we study the problem of meeting deadlines for coflows in data center networks. Existing flow-level scheduling schemes are insufficient to guarantee the coflow-level performance, since a coflow can meet its deadline only when all its constituent flows finish on time. Due to the scarce bandwidth on the network bottleneck, it is vital to coordinate concurrent coflows to meet as many deadlines as possible. We present Chronos, a scheduling framework that captures the correlation of flows belonging to a coflow, and handles the resource allocation among multiple concurrent coflows. Chronos is work-conserving and starvation-free without integrating complicated admission control mechanisms. We show via extensive simulations on ns3 that Chronos can make 1.6× more coflows meet their deadlines compared to flow-level schemes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".