Document Open Access Logo

Stochastic Scheduling of Heavy-tailed Jobs

Authors Sungjin Im, Benjamin Moseley, Kirk Pruhs



PDF
Thumbnail PDF

File

LIPIcs.STACS.2015.474.pdf
  • Filesize: 0.65 MB
  • 13 pages

Document Identifiers

Author Details

Sungjin Im
Benjamin Moseley
Kirk Pruhs

Cite AsGet BibTex

Sungjin Im, Benjamin Moseley, and Kirk Pruhs. Stochastic Scheduling of Heavy-tailed Jobs. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 474-486, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.STACS.2015.474

Abstract

We revisit the classical stochastic scheduling problem of nonpreemptively scheduling n jobs so as to minimize total completion time on m identical machines, P \mid \mid \mathbb{E} \sum C_j in the standard 3-field scheduling notation. Previously it was only known how to obtain reasonable approximation if jobs sizes have low variability. However, distributions commonly arising in practice have high variability, and the upper bounds on the approximation ratio for the previous algorithms for such distributions can be even inverse-polynomial in the maximum possible job size. We start by showing that the natural list scheduling algorithm Shortest Expected Processing Time (SEPT) has a bad approximation ratio for high variability jobs. We observe that a simple randomized rounding of a natural linear programming relaxation is a (1+\epsilon)-machine O(1)-approximation assuming the number of machines is at least logarithmic in the number of jobs. Turning to the case of a modest number of machines, we develop a list scheduling algorithm that is O(\log^2 n + m \log n)-approximate. Our results together imply a (1+\epsilon)-machine O(\log^2 n )-approximation for an arbitrary number of machines. Intuitively our list scheduling algorithm finds an ordering that not only takes the expected size of a job into account, but also takes into account the probability that job will be big.
Keywords
  • stochastic scheduling
  • completion time
  • approximation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. L. A. Adamic and B. A. Huberman. Zipf’s law and the internet. Glottometrics, 3:143-150, 2002. Google Scholar
  2. Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, and Maxim Sviridenko. Approximation schemes for minimizing average weighted completion time with release dates. In FOCS, pages 32-44, 1999. Google Scholar
  3. David Easley and Jon Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, New York, NY, USA, 2010. Google Scholar
  4. W. Horn. Minimizing average flowtime with parallel machines. Operations Research, 21:846- 847, 2006. Google Scholar
  5. Blachander Krishnamurthy and Jennifer Wexford. Web Protocols and Practice: HTTP/1.1, Networking Protocols, Caching, and Traffic Measurement. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2001. Google Scholar
  6. Colin McDiarmid. Concentration. In Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, and Bruce Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, volume 16 of Algorithms and Combinatorics, pages 195-248. Springer Berlin Heidelberg, 1998. Google Scholar
  7. N. Megow, M. Uetz, and T. Vredeveld. Models and algorithms for stochastic online scheduling. Mathematics of Operations Research, 31(3):513-525, 2006. Google Scholar
  8. R. H. Möhring, A. S. Schulz, and M. Uetz. Approximation in stochastic scheduling: The power of LP-based priority policies. Journal of the ACM, 46:924-942, 1999. Google Scholar
  9. Michael Pinedo. Scheduling Theory, Algorithms, and Systems. Springer, 2008. Google Scholar
  10. M. H. Rothkopf. Scheduling with random service times. Management Science, 12:703-713, 1966. Google Scholar
  11. A. S. Schulz. Stochastic online scheduling revisited. In B. Yang, D.-Z. Du, and C. Wang, editors, Combinatorial Optimization and Applications, volume 5165 of Lecture Notes in Computer Science, pages 448-457. Springer, 2008. Google Scholar
  12. M. Skutella and M. Uetz. Stochastic machine scheduling with precedence constraints. SIAM Journal on Computing, 34:788-802, 2005. Google Scholar
  13. Martin Skutella, Maxim Sviridenko, and Marc Uetz. Stochastic scheduling on unrelated machines. In STACS, pages 639-650, 2014. Google Scholar
  14. Gideon Weiss. Approximation results in parallel machines stochastic scheduling. Annals of Operations Research, 26:195-242, 1990. Google Scholar
  15. Gideon Weiss. Turnpike optimality of Smith’s rule in parallel machines stochastic scheduling. Mathematics of Operations Research, 17:255-270, 1992. Google Scholar
  16. David P. Williamson and David B. Shmoys. The Design of Approximation Algorithms. Cambridge University Press, 2011. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail