• Xu H, Liu Y and Lau W. Optimal Job Scheduling With Resource Packing for Heterogeneous Servers. IEEE/ACM Transactions on Networking. 10.1109/TNET.2021.3068201. 29:4. (1553-1566).

    https://ieeexplore.ieee.org/document/9393492/

  • Xu H, de Veciana G, Lau W and Zhou K. (2019). Online Job Scheduling with Redundancy and Opportunistic Checkpointing. IEEE Transactions on Parallel and Distributed Systems. 30:4. (897-909). Online publication date: 1-Apr-2019.

    https://doi.org/10.1109/TPDS.2018.2871135

  • Liu Y, Xu H and Lau W. (2019). Online Job Scheduling with Resource Packing on a Cluster of Heterogeneous Servers IEEE INFOCOM 2019 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2019.8737465. 978-1-7281-0515-4. (1441-1449).

    https://ieeexplore.ieee.org/document/8737465/

  • Xu H, Wu H and Lau W. (2019). Revisiting SRPT for Job Scheduling in Computing Clusters. Queueing Theory and Network Applications. 10.1007/978-3-030-27181-7_17. (276-291).

    http://link.springer.com/10.1007/978-3-030-27181-7_17

  • Ebrahimi R, Mccauley S and Moseley B. (2018). Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. Theory of Computing Systems. 62:2. (304-318). Online publication date: 1-Feb-2018.

    https://doi.org/10.1007/s00224-016-9722-0

  • Xu H, Lau W, Yang Z, de Veciana G and Hou H. Mitigating Service Variability in MapReduce Clusters via Task Cloning: A Competitive Analysis. IEEE Transactions on Parallel and Distributed Systems. 10.1109/TPDS.2017.2689767. 28:10. (2866-2880).

    http://ieeexplore.ieee.org/document/7890998/

  • Xu Q and Zheng R. (2017). When data acquisition meets data analytics: A distributed active learning framework for optimal budgeted mobile crowdsensing IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2017.8057034. 978-1-5090-5336-0. (1-9).

    http://ieeexplore.ieee.org/document/8057034/

  • Xu H, Huang H, Chen S and Zhao G. (2017). Scalable software-defined networking through hybrid switching IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2017.8057001. 978-1-5090-5336-0. (1-9).

    http://ieeexplore.ieee.org/document/8057001/

  • Xu H, de Veciana G and Lau W. (2017). Addressing job processing variability through redundant execution and opportunistic checkpointing: A competitive analysis IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. 10.1109/INFOCOM.2017.8056972. 978-1-5090-5336-0. (1-9).

    http://ieeexplore.ieee.org/document/8056972/

  • Agrawal K, Li J, Lu K and Moseley B. Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time. Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures. (195-205).

    https://doi.org/10.1145/2935764.2935782

  • Xu H and Lau W. (2015). Task-Cloning Algorithms in a MapReduce Cluster with Competitive Performance Bounds 2015 IEEE 35th International Conference on Distributed Computing Systems (ICDCS). 10.1109/ICDCS.2015.42. 978-1-4673-7214-5. (339-348).

    http://ieeexplore.ieee.org/document/7164920/

  • Ebrahimi R, McCauley S and Moseley B. (2015). Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. Approximation and Online Algorithms. 10.1007/978-3-319-28684-6_16. (183-195).

    http://link.springer.com/10.1007/978-3-319-28684-6_16