Scheduling Flows on a Switch to Optimize Response Times

@article{Jahanjou2020SchedulingFO,
  title={Scheduling Flows on a Switch to Optimize Response Times},
  author={Hamidreza Jahanjou and R. Rajaraman and David Stalfa},
  journal={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures},
  year={2020}
}
  • Hamidreza Jahanjou, R. Rajaraman, David Stalfa
  • Published 2020
  • Computer Science, Mathematics
  • Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
  • We study the scheduling of flows on a switch with the goal of optimizing metrics related to the response time of the flows. The input is a sequence of flow requests on a switch, where the switch is represented by a bipartite graph with a capacity on each vertex (port), and a flow request is an edge with associated demand. In each round, a subset of edges can be scheduled under the constraint that the total demand of the scheduled edges incident on any vertex is at most the capacity of the… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-4 OF 4 REFERENCES

    Minimizing Mean Flow Time with Release Time Constraint

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    Minimizing Flow-Time on Unrelated Machines

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Better Algorithms for Minimizing Average Flow-Time on Related Machines

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Tres observaciones sobre el algebra lineal

    • D. Birkhoff
    • Universidad Nacional de Tucuman Revista , Serie A, 5:147–151
    • 1946
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL