skip to main content
extended-abstract

Optimally Scheduling Jobs with Multiple Tasks

Published:11 October 2017Publication History
Skip Abstract Section

Abstract

We consider optimal job scheduling where each job consists of multiple tasks, each of unknown duration, with precedence constraints between tasks. A job is not considered complete until all of its tasks are complete. Traditional heuristics, such as favoring the job of shortest expected remaining processing time, are suboptimal in this setting. Furthermore, even if we know which job to run, it is not obvious which task within that job to serve. In this paper, we characterize the optimal policy for a class of such scheduling problems and show that the policy is simple to compute.

References

  1. S. Aalto, U. Ayesta, and R. Righter. On the Gittins index in the M/G/1 queue. Queueing Systems, 63(1):437--458, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. Dragoni et al. Microservices: yesterday, today, and tomorrow. 2016. arXiv:1606.04036.Google ScholarGoogle Scholar
  3. J. Gittins, K. Glazebrook, and R. Weber. Multi-armed bandit allocation indices. John Wiley & Sons, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. C. Gittins and D. M. Jones. A dynamic allocation index for the sequential design of experiments. In J. Gani, editor, Progress in Statistics, pages 241--266. North-Holland, Amsterdam, NL, 1974.Google ScholarGoogle Scholar
  5. A. Toumi et al. Design and optimization of a large scale biopharmaceutical facility using process simulation and scheduling tools. Pharmaceutical Engineering, 30(2):1--9, 2010.Google ScholarGoogle Scholar
  6. J. D. Ullman. NP-complete scheduling problems. Journal of Computer and System Sciences, 10(3):384--393, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. Whittle. Multi-armed bandits and the Gittins index. Journal of the Royal Statistical Society. Series B (Methodological), pages 143--149, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  8. M. Zaharia et al. Resilient distributed datasets: A faulttolerant abstraction for in-memory cluster computing. In NSDI '12. USENIX Association, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Optimally Scheduling Jobs with Multiple Tasks
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGMETRICS Performance Evaluation Review
          ACM SIGMETRICS Performance Evaluation Review  Volume 45, Issue 2
          Setember 2017
          131 pages
          ISSN:0163-5999
          DOI:10.1145/3152042
          Issue’s Table of Contents

          Copyright © 2017 Authors

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 11 October 2017

          Check for updates

          Qualifiers

          • extended-abstract

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader