Priority algorithm for near-data scheduling: Throughput and heavy-traffic optimality

@article{Xie2015PriorityAF,
  title={Priority algorithm for near-data scheduling: Throughput and heavy-traffic optimality},
  author={Qiaomin Xie and Yi Lu},
  journal={2015 IEEE Conference on Computer Communications (INFOCOM)},
  year={2015},
  pages={963-972}
}
The prevalence of data-parallel applications has made near-data scheduling an important problem. An example is the map task scheduling in the map-reduce framework. Wang et. al. [13] was the first to identify its capacity region and proposed a throughput-optimal algorithm based on MaxWeight. However, the study of the algorithm's delay performance revealed that it is only heavy-traffic optimal for a very special traffic scenario, where all traffic concentrates on a subset of servers. We propose a… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 29 CITATIONS

LAS: Logical-Block Affinity Scheduling in Big Data Analytics Systems

  • IEEE INFOCOM 2018 - IEEE Conference on Computer Communications
  • 2018
VIEW 8 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Scheduling for data centers with multi-level data locality

  • 2017 Iranian Conference on Electrical Engineering (ICEE)
  • 2017
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Scheduling with multi-level data locality: Throughput and heavy-traffic optimality

  • IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications
  • 2016
VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND

GB-PANDAS: : Throughput and heavy-traffic optimality analysis for affinity scheduling

  • SIGMETRICS Performance Evaluation Review
  • 2017
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Near Data Scheduling for Data Centers with Multi Levels of Data Locality

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Data locality in MapReduce: A network perspective

  • 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2014
VIEW 19 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Beyond Load Balancing: Package-Aware Scheduling for Serverless Platforms

  • 2019 19th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)
  • 2019
VIEW 1 EXCERPT
CITES METHODS

References

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

Priority algorithm for near-data scheduling: Throughput and heavy-traffic optimality

Q. Xie, Y. Lu
  • Techical Report,
  • 2014
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

DARE: Adaptive Data Replication for Efficient Cluster Scheduling

  • 2011 IEEE International Conference on Cluster Computing
  • 2011
VIEW 1 EXCERPT

Threshold-based priority policies for parallel-server systems with affinity scheduling

  • Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148)
  • 2001
VIEW 2 EXCERPTS