Document Open Access Logo

Bag-Of-Tasks Scheduling on Related Machines

Authors Anupam Gupta, Amit Kumar, Sahil Singla

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2021.3.pdf
  • Filesize: 0.72 MB
  • 16 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
  • Theory of computation → Scheduling algorithms
Keywords
  • approximation algorithms
  • scheduling
  • bag-of-tasks
  • related machines

Metrics

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

Abstract

We consider online scheduling to minimize weighted completion time on related machines, where each job consists of several tasks that can be concurrently executed. A job gets completed when all its component tasks finish. We obtain an O(K³ log² K)-competitive algorithm in the non-clairvoyant setting, where K denotes the number of distinct machine speeds. The analysis is based on dual-fitting on a precedence-constrained LP relaxation that may be of independent interest.

Cite As Get BibTex

Anupam Gupta, Amit Kumar, and Sahil Singla. Bag-Of-Tasks Scheduling on Related Machines. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.3

Author Details

Anupam Gupta
  • Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA
Amit Kumar
  • Computer Science and Engineering Department, Indian Institute of Technology, Delhi, India
Sahil Singla
  • Department of Computer Science, Princeton University, NJ, USA

Funding

  • Gupta, Anupam: Supported in part by NSF awards CCF-1907820, CCF1955785, and CCF-2006953.

References

  1. Kunal Agrawal, Jing Li, Kefu Lu, and Benjamin Moseley. Scheduling parallel DAG jobs online to minimize average flow time. In Proceedings of SODA, pages 176-189, 2016. Google Scholar
  2. C. Anglano and M. Canonico. Scheduling algorithms for multiple bag-of-task applications on desktop grids: A knowledge-free approach. In 2008 IEEE International Symposium on Parallel and Distributed Processing, pages 1-8, 2008. Google Scholar
  3. Abbas Bazzi and Ashkan Norouzi-Fard. Towards tight lower bounds for scheduling problems. In Proceedings of ESA, pages 118-129, 2015. Google Scholar
  4. Anne Benoit, Loris Marchal, Jean-Francois Pineau, Yves Robert, and Frédéric Vivien. Scheduling concurrent bag-of-tasks applications on heterogeneous platforms. IEEE Trans. Computers, 59(2):202-217, 2010. Google Scholar
  5. Fabián A. Chudak and David B. Shmoys. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. J. Algorithms, 30(2):323-343, 1999. Google Scholar
  6. José R. Correa, Martin Skutella, and José Verschae. The power of preemption on unrelated machines and applications to scheduling orders. In Proceedings of APPROX/RANDOM, pages 84-97, 2009. Google Scholar
  7. Naveen Garg, Anupam Gupta, Amit Kumar, and Sahil Singla. Non-clairvoyant precedence constrained scheduling. In Proceedings of ICALP, pages 63:1-63:14, 2019. Google Scholar
  8. Leslie A. Hall, Andreas S. Schulz, David B. Shmoys, and Joel Wein. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math. Oper. Res., 22(3):513-544, 1997. Google Scholar
  9. Shi Li. Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations. In Proceedings of FOCS, pages 283-294. 2017. Google Scholar
  10. Ioannis A. Moschakis and Helen D. Karatza. Multi-criteria scheduling of bag-of-tasks applications on heterogeneous interlinked clouds with simulated annealing. J. Syst. Softw., 101:1-14, 2015. Google Scholar
  11. Alix Munier, Maurice Queyranne, and Andreas S. Schulz. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. In Proceedings of IPCO, volume 1412, pages 367-382. 1998. Google Scholar
  12. Maurice Queyranne and Maxim Sviridenko. A (2+epsilon)-approximation algorithm for generalized preemptive open shop problem with minsum objective. In Proceedings of IPCO, volume 2081, pages 361-369, 2001. Google Scholar
  13. Julien Robert and Nicolas Schabanel. Non-clairvoyant scheduling with precedence constraints. In Proceedings of SODA, pages 491-500, 2008. 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
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact