Coflow Scheduling with Performance Guarantees for Data Center Applications
| Autor: | Holger Karl, Asif Hasnain |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Optimization algorithm
Computer science business.industry Distributed computing 05 social sciences 050801 communication & media studies 020206 networking & telecommunications 02 engineering and technology Scheduling (computing) 0508 media and communications Server 0202 electrical engineering electronic engineering information engineering Network performance Data center business |
| Zdroj: | CCGRID |
| DOI: | 10.1109/ccgrid49817.2020.00010 |
| Popis: | Data-parallel applications run on cluster of servers in a datacenter and their communication triggers correlated resource demand on multiple links that can be abstracted as coflow. They often desire predictable network performance, which can be passed to network via coflow abstraction for application-aware network scheduling. In this paper, we propose a heuristic and an optimization algorithm for predictable network performance such that they guarantee coflows completion within their deadlines. The algorithms also ensure high network utilization, i.e., it’s work-conserving, and avoids starvation of coflows. We evaluate both algorithms via trace-driven simulation and show that they admit 1.1× more coflows than the Varys scheme while meeting their deadlines. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|