English

Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems

Data Structures and Algorithms 2018-11-29 v1
Authors: Alexander Kononov , Yulia Kovalenko
View on arXiv ↗ PDF ↗

Abstract

We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new constant factor approximation algorithms for the non-migratory cases when all jobs have a common release time and/or a common deadline.

Keywords

parallel job scheduling speed scaling energy minimization non-migratory approximation algorithms

Cite

@article{arxiv.1811.11595,
  title  = {Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems},
  author = {Alexander Kononov and Yulia Kovalenko},
  journal= {arXiv preprint arXiv:1811.11595},
  year   = {2018}
}

Comments

10 pages, Siberian Electronic Mathematical Reports (on review)

Related papers

View all related →
Optimization and Control · Mathematics
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint
Alexander Kononov, Yulia Kovalenko
2021-07-22
Data Structures and Algorithms · Computer Science
Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem
Evripidis Bampis, Giorgio Lucarelli, Ioannis Nemparis
2012-11-26
Data Structures and Algorithms · Computer Science
Speed Scaling on Parallel Processors with Migration
Eric Angel, Evripidis Bampis, Fadi Kacem, Dimitrios Letsios
2011-07-13
Data Structures and Algorithms · Computer Science
Parallel Machine Scheduling to Minimize Energy Consumption
Antonios Antoniadis, Naveen Garg, Gunjan Kumar, Nikhil Kumar
2019-10-01
Distributed, Parallel, and Cluster Computing · Computer Science
Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
Mehrnoosh Shafiee, Javad Ghaderi
2020-04-03
Data Structures and Algorithms · Computer Science
Scheduling on (Un-)Related Machines with Setup Times
Klaus Jansen, Marten Maack, Alexander Mäcker
2018-09-28
Operating Systems · Computer Science
Integrating Job Parallelism in Real-Time Scheduling Theory
S. Collette, L. Cucu, J. Goossens
2008-05-22
Distributed, Parallel, and Cluster Computing · Computer Science
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors
Dimitrios Fotakis, Ioannis Milis, Emmanouil Zampetakis, Georgios Zois
2014-06-25
Operating Systems · Computer Science
Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms
François Dorin, Patrick Meumeu Yomsi, Joël Goossens, Pascal Richard
2010-06-15
Data Structures and Algorithms · Computer Science
Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
Shuguang Li
2017-08-22
Data Structures and Algorithms · Computer Science
Approximation algorithms for energy, reliability and makespan optimization problems
Guillaume Aupy, Anne Benoit
2012-10-18
Data Structures and Algorithms · Computer Science
Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms [Full Version]
Riley Murray, Samir Khuller, Megan Chao
2016-10-31
Discrete Mathematics · Computer Science
Assigning and Scheduling Generalized Malleable Jobs under Subadditive or Submodular Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2022-03-29
Discrete Mathematics · Computer Science
A Constant-Factor Approximation for Generalized Malleable Scheduling under $M^\natural$-Concave Processing Speeds
Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos
2021-11-22
Data Structures and Algorithms · Computer Science
Scheduling for Multi-Phase Parallelizable Jobs
Rahul Vaze
2022-05-03
Data Structures and Algorithms · Computer Science
Speed scaling with power down scheduling for agreeable deadlines
Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis
2012-10-23
Discrete Mathematics · Computer Science
Parallel Machine Scheduling with a Single Resource per Job
T. Janssen, C. Swennenhuis, A. Bitar, T. Bosman +4
2018-11-19
Data Structures and Algorithms · Computer Science
Power-aware scheduling for makespan and flow
David P. Bunde
2007-05-23
Data Structures and Algorithms · Computer Science
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
Philippe Baptiste, Marek Chrobak, Christoph Durr, Francis Sourd
2007-05-23
Data Structures and Algorithms · Computer Science
Maximising the total weight of on-time jobs on parallel machines subject to a conflict graph
Yakov Zinder, Joanna Berlińska, Charlie Peter
2021-06-15
Distributed, Parallel, and Cluster Computing · Computer Science
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
Christophe Cérin, Jean-Christophe Dubacq, Jean-Louis Roch, the SafeScale Collaboration
2016-08-16
Data Structures and Algorithms · Computer Science
Energy-Efficient Scheduling with Time and Processors Eligibility Restrictions
Xibo Jin, Fa Zhang, Ying Song, Liya Fan +1
2013-09-17
Data Structures and Algorithms · Computer Science
Energy Efficient Scheduling and Routing via Randomized Rounding
Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli +1
2014-03-21
Distributed, Parallel, and Cluster Computing · Computer Science
Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors
Xu Jiang, Nan Guan, Xiang Long, Wang Yi
2017-05-10
Operating Systems · Computer Science
Parallel and sequential reclaiming in multicore real-time global scheduling
Luca Abeni, Giuseppe Lipari, Andrea Parri, Youcheng Sun
2016-03-11