• Corpus ID: 215745119

Non-clairvoyant Scheduling of Coflows

@inproceedings{Bhimaraju2020NonclairvoyantSO,
  title={Non-clairvoyant Scheduling of Coflows},
  author={Akhil Bhimaraju and Debanuj Nayak and Rahul Vaze},
  booktitle={WiOpt},
  year={2020}
}
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… 

Figures from this paper

Coflow Scheduling With Unknown Prior Information in Data Center Networks

An effective coflow scheduling mechanism namely, Classification According to Ports Number (CAPN), where coflows are quickly classified according to the Few Ports Number Scheduling First (FPSF) algorithm, and then coflows with different priorities are scheduled and adjusted, which greatly reduce the average coflow completion time (CCT).

Joint Online Coflow Optimization Across Geo-Distributed Datacenters

Results from extensive simulations demonstrate that the proposed algorithms can significantly reduce the CCT of coflows and at the same time, have similar algorithm run time, compared with the state-of-the-art solutions.

Joint Coflow Optimization for Data Center Networks

This paper proposes a joint online scheduling framework, which first develops a 2-approximation algorithm to reduce the CCT of a single coflow, and then follows the Shortest Remaining Time First (SRTF) principle to schedule multiple coflows.

Scheduling to Minimize Age of Information with Multiple Sources

  • K. SauravR. Vaze
  • Computer Science
    2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)
  • 2022
A novel randomized scheduling algorithm is proposed and it is shown that its competitive ratio is at most 3 plus the maximum of the ratio of the variance and the mean of the inter-arrival time distribution of sources.

Minimizing Age of Information under Arbitrary Arrival Model with Arbitrary Packet Size

A causal policy called SRPT + is proposed that at each time, preempts the update under transmission if a new update arrives with a smaller size, and begins to transmit the update for which the ratio of the reduction in AoI upon complete transmission and the remaining size, is maximum.

References

SHOWING 1-10 OF 28 REFERENCES

Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines

It is proved that a randomized version of the Multilevel Feedback algorithm is competitive for single and parallel machine systems, in the opinion providing one theoretical validation of the goodness of an idea that has proven effective in practice along the last two decades.

Scheduling Cofiows of Multi-stage Jobs to Minimize the Total Weighted Job Completion Time

This is the first work that systematically studies: how to schedule dependent coflows of multi-stage jobs, so that the total weighted job completion time can be minimized, and it is proved that this problem is strongly NP-hard.

An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters

This paper considers the problem of efficiently scheduling coflows with release dates in a shared datacenter network so as to minimize the total weighted completion time of coflows and proposes a polynomial-time deterministic algorithm that improves the prior known results.

Near Optimal Coflow Scheduling in Networks

This work studies a slightly different model of coflow scheduling in general graphs and develops practical and efficient approximation algorithms for it, and develops a randomized 2 approximation algorithm for the single path and free path model.

Sincronia: near-optimal network design for coflows

Evaluation results suggest that Sincronia not only admits a practical, near-optimal design but also improves upon state-of-the-art network designs for coflows (sometimes by as much as 8X).

Minimizing flow time nonclairvoyantly

RMLF is a randomized nonclairvoyant algorithm that has competitive ratio /spl theta/(lognloglogn) against an adaptive adversary and is a slight variation of the multi level feedback (MLF) algorithm used by the Unix operating system, further justifying the adoption of this algorithm.

Non-clairvoyant Precedence Constrained Scheduling

This paper considers the online problem of scheduling jobs on identical machines, where jobs have precedence constraints, and gives a constant-competitive algorithm and virtual rates obtained by allocating time in a fair manner, using a Eisenberg-Gale-type convex program.

Information-agnostic coflow scheduling with optimal demotion thresholds

The valley-like shape of the function and design of the Down-hill searching (DHS) algorithm, which locates a set of optimal demotion thresholds which minimizes the average coflow delay in the system, are proved.

Scheduling to minimize average stretch without migration

The result shows that migration is not necessary to be competitive for minimizing average stretch; in contrast, it is proved that preemption is essential, even if randomization is allowed, and establishes a constant-factor lower bound on the competitive ratio of any online algorithm that minimizes average stretch without migration.

Efficient coflow scheduling with Varys

This paper presents Varys, a system that enables data-intensive frameworks to use coflows and the proposed algorithms while maintaining high network utilization and guaranteeing starvation freedom, and outperforms non-preemptive coflow schedulers by more than 5X.