IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v19y2016i6d10.1007_s10951-015-0445-x.html
   My bibliography  Save this article

Co-scheduling algorithms for high-throughput workload execution

Author

Listed:
  • Guillaume Aupy

    (LIP, ENS Lyon)

  • Manu Shantharam

    (San Diego Supercomputer Center)

  • Anne Benoit

    (LIP, ENS Lyon)

  • Yves Robert

    (LIP, ENS Lyon
    University of Tennessee)

  • Padma Raghavan

    (Pennsylvania State University)

Abstract

This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective is to determine a partition into packs, and an assignment of processors to applications, that minimize the sum of the execution times of the packs. We thoroughly study the complexity of this optimization problem, and propose several heuristics that exhibit very good performance on a variety of workloads, whose application execution times model profiles of parallel scientific codes. We show that co-scheduling leads to faster workload completion time (40 % improvement on average over traditional scheduling) and to faster response times (50 % improvement). Hence, co-scheduling increases system throughput and saves energy, leading to significant benefits from both the user and system perspectives.

Suggested Citation

  • Guillaume Aupy & Manu Shantharam & Anne Benoit & Yves Robert & Padma Raghavan, 2016. "Co-scheduling algorithms for high-throughput workload execution," Journal of Scheduling, Springer, vol. 19(6), pages 627-640, December.
    • Handle: RePEc:spr:jsched:v:19:y:2016:i:6:d:10.1007_s10951-015-0445-x
    DOI: 10.1007/s10951-015-0445-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-015-0445-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-015-0445-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    2. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    3. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    2. Chakhlevitch, Konstantin & Glass, Celia A. & Kellerer, Hans, 2011. "Batch machine production with perishability time windows and limited batch size," European Journal of Operational Research, Elsevier, vol. 210(1), pages 39-47, April.
    3. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    4. Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu, 2020. "Mixed batch scheduling on identical machines," Journal of Scheduling, Springer, vol. 23(4), pages 487-496, August.
    5. Bo Chen & Xiaotie Deng & Wenan Zang, 2004. "On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 85-95, March.
    6. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    7. Tang, Lixin & Zhao, Yufang, 2008. "Scheduling a single semi-continuous batching machine," Omega, Elsevier, vol. 36(6), pages 992-1004, December.
    8. Malapert, Arnaud & Guéret, Christelle & Rousseau, Louis-Martin, 2012. "A constraint programming approach for a batch processing problem with non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 221(3), pages 533-545.
    9. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    10. Ozturk, Onur & Begen, Mehmet A. & Zaric, Gregory S., 2014. "A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services," European Journal of Operational Research, Elsevier, vol. 239(1), pages 214-226.
    11. Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
    12. Li, Kai & Jia, Zhao-hong & Leung, Joseph Y.-T., 2015. "Integrated production and delivery on parallel batching machines," European Journal of Operational Research, Elsevier, vol. 247(3), pages 755-763.
    13. Ridouard, Frédéric & Richard, Pascal & Martineau, Patrick, 2008. "On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1327-1342, September.
    14. Damodaran, Purushothaman & Kumar Manjeshwar, Praveen & Srihari, Krishnaswami, 2006. "Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 103(2), pages 882-891, October.
    15. Li, Xueping & Zhang, Kaike, 2018. "Single batch processing machine scheduling with two-dimensional bin packing constraints," International Journal of Production Economics, Elsevier, vol. 196(C), pages 113-121.
    16. Wang, Jun-Qiang & Fan, Guo-Qiang & Zhang, Yingqian & Zhang, Cheng-Wu & Leung, Joseph Y.-T., 2017. "Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes," European Journal of Operational Research, Elsevier, vol. 258(2), pages 478-490.
    17. Geert Bekaert & Robert J. Hodrick, 2001. "Expectations Hypotheses Tests," Journal of Finance, American Finance Association, vol. 56(4), pages 1357-1394, August.
    18. Nakashima, Kiyotaka & Ogawa, Toshiaki, 2020. "The Impacts of Strengthening Regulatory Surveillance on Bank Behavior: A Dynamic Analysis from Incomplete to Complete Enforcement of Capital Regulation in Microprudential Policy," MPRA Paper 99938, University Library of Munich, Germany.
    19. Król, Michał, 2012. "Product differentiation decisions under ambiguous consumer demand and pessimistic expectations," International Journal of Industrial Organization, Elsevier, vol. 30(6), pages 593-604.
    20. G. Sujatha, 2018. "‘Is It Family or Politics?’ Reflections on Gender and the Modern Tamil Subjectivity Constitution in the Discourse of C. N. Annadurai," Studies in Indian Politics, , vol. 6(2), pages 267-281, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:19:y:2016:i:6:d:10.1007_s10951-015-0445-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.