Name
Abstract | ||
|---|---|---|
The coflow scheduling problem is considered: given an input/output switch with each port having a fixed capacity, find a scheduling algorithm that minimizes the weighted sum of the coflow completion times respecting the port capacities, where each flow of a coflow has a demand per input/output port, and coflow completion time is the finishing time of the last flow of the coflow. The objective of this paper is to present theoretical guarantees on approximating the sum of coflow completion time in the non-clairvoyant setting, where on a coflow arrival, only the number of flows, and their input-output port is revealed, while the critical demand volumes for each flow on the respective input-output port is unknown. The main result of this paper is to show that the proposed BlindFlow algorithm is 8p-approximate, where p is the largest number of input-output port pairs that a coflow uses. This result holds even in the online case, where coflows arrive over time and the scheduler has to use only causal information. Simulations reveal that the experimental performance of BlindFlow is far better than the theoretical guarantee. |
Year | Venue | Keywords |
|---|---|---|
2020 | 2020 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT) | nonclairvoyant scheduling,coflow scheduling problem,scheduling algorithm,coflow completion time,port capacities,finishing time,nonclairvoyant setting,coflow arrival,input-output port pairs,input-output switch,BlindFlow algorithm,8p-approximate,causal information |
DocType | ISBN | Citations |
Conference | 978-1-7281-9389-2 | 0 |
PageRank | References | Authors |
0.34 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bhimaraju Akhil | 1 | 0 | 0.34 |
| Nayak Debanuj | 2 | 0 | 0.34 |
| Rahul Vaze | 3 | 463 | 45.64 |