Online vector scheduling and generalized load balancing

@article{Zhu2014OnlineVS,
  title={Online vector scheduling and generalized load balancing},
  author={Xiaojun Zhu and Q. Li and W. Mao and G. Chen},
  journal={J. Parallel Distributed Comput.},
  year={2014},
  volume={74},
  pages={2304-2309}
}
  • Xiaojun Zhu, Q. Li, +1 author G. Chen
  • Published 2014
  • Computer Science, Mathematics
  • J. Parallel Distributed Comput.
  • We give a polynomial time reduction from the vector scheduling problem (VS) to the generalized load balancing problem (GLB). This reduction gives the first non-trivial online algorithm for VS where vectors come in an online fashion. The online algorithm is very simple in that each vector only needs to minimize the L"l"n"("m"d") norm of the resulting load when it comes, where m is the number of partitions and d is the dimension of vectors. It has an approximation bound of elog(md), which is in O… CONTINUE READING
    Flight Path Optimization for UAVs to Provide Location Service to Ground Targets
    Congestion-Minimizing Network Update in Data Centers
    7
    Online and Semi-Online Vector Scheduling on A Single Machine with Rejection
    Randomized Algorithms for Online Vector Load Balancing
    5

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 11 REFERENCES
    Bacterial viability and culturability.
    346
    Synthetic genetic array analysis in Saccharomyces cerevisiae.
    485
    On Multidimensional Packing Problems
    118
    Designing a Practical Access Point Association Protocol
    73
    Algorithm design
    1265
    Online vector scheduling and generalized load balancing
    • 2013
    SmartAssoc: Decentralized Access Point Selection Algorithm to Improve Throughput
    38
    Better bounds for online load balancing on unrelated machines
    48
    Linear degree extractors and the inapproximability of max clique and chromatic number
    686