Tight Bounds for Online Vector Scheduling

@article{Im2015TightBF,
  title={Tight Bounds for Online Vector Scheduling},
  author={Sungjin Im and Nathaniel Kell and Janardhan Kulkarni and Debmalya Panigrahi},
  journal={2015 IEEE 56th Annual Symposium on Foundations of Computer Science},
  year={2015},
  pages={525-544}
}
  • Sungjin Im, Nathaniel Kell, +1 author Debmalya Panigrahi
  • Published in
    IEEE 56th Annual Symposium on…
    2015
  • Mathematics, Computer Science
  • Modern data centers face a key challenge of effectively serving user requests that arrive online. Such requests are inherently multi-dimensional and characterized by demand vectors over multiple resources such as processor cycles, storage space, and network bandwidth. Typically, different resources require different objectives to be optimized, and Lr norms of loads are among the most popular objectives considered. Furthermore, the server clusters are also often heterogeneous making the… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    2
    Twitter Mentions

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    Load Balancing on Related Machines

    VIEW 10 EXCERPTS
    CITES METHODS, BACKGROUND & RESULTS

    Makespan Minimization via Posted Prices

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Improved Approximation for Vector Bin Packing

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 47 REFERENCES

    Online m ultidimensional load balancing. In Approximation, Randomization, and Combinatorial Optimiz ation. Algorithms and Techniques - 16th International Workshop

    • Adam Meyerson, Alan Roytman, Brian Tagiku
    • APPROX 2013, and 17th Internation al Workshop,
    • 2013
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Tight bounds for online vector bin packing

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Load Balancing in the L P Norm

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Better bounds for online load balancing on unrelated machines

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    On multidimension al packing problems.SIAM

    • Chandra Chekuri, Sanjeev Khanna
    • J. Comput. ,
    • 2004
    VIEW 13 EXCERPTS
    HIGHLY INFLUENTIAL

    Bounds for certain multiprocessing anomalies

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    The Moser-Tardos Framework with Partial Resampling

    Convergence and approximation in potential

    • George Christodoulou, Vahab S. Mirrokni, Anastasi os Sidiropoulos
    • games. Theor. Comput
    • 2012
    VIEW 1 EXCERPT