research-article

A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems

Authors:

Nikhil Devanur,

Janardhan KulkarniAuthors Info & Claims

SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures

Pages 283 - 290

https://doi.org/10.1145/3210377.3210384

Published: 11 July 2018 Publication History

Abstract

The rise of cloud computing platforms has led to the study of many scheduling problems. Towards this, general algorithmic techniques that are applicable to a wide range of problems are highly valuable. We develop one such technique by a temporal generalization of the rounding algorithm of \citetShmoysT93 for the generalized assignment problem. Our algorithm gives a bi-criteria approximation algorithm for a problem we introduce, called the generalized interval scheduling problem, on unrelated machines. The problem allows for each job, a specification of a collection of intervals on each machine, with the constraint that the job must be completely processed in one of the given intervals on a single machine. The assignment costs and the processing lengths are interval dependent. Next we show how to get improved approximation factors for several classical scheduling problems, involving energy, $\ell_p$-norms of completion time, tardiness, and general delay costs by giving a reduction from these problems to the generalized interval scheduling problem with an appropriately defined assignment cost.

References

[1]

Susanne Albers. Algorithms for energy saving. In Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, pages 173--186, 2009. 10.1007/978--3--642-03456--5_12.

Digital Library

[2]

Susanne Albers and Hiroshi Fujiwara. Energy-efficient algorithms for flow time minimization. ACM Transactions on Algorithms, 3 (4), 2007.

Digital Library

[3]

S. Anand, Naveen Garg, and Amit Kumar. Resource augmentation for weighted flow-time explained by dual fitting. In SODA, pages 1228--1241, 2012.

Digital Library

[4]

Yossi Azar and Amir Epstein. Convex programming for scheduling unrelated parallel machines. In Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 331--337. ACM, 2005.

Digital Library

[5]

Nikhil Bansal and Janardhan Kulkarni. Minimizing flow-time on unrelated machines. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14--17, 2015, pages 851--860, 2015. 10.1145/2746539.2746601. URL

Digital Library

[6]

Nikhil Bansal and Kirk Pruhs. The geometry of scheduling. In IEEE Symposium on the Foundations of Computer Science, pages 407--414, 2010.

Digital Library

[7]

Nikhil Bansal, Tracy Kimbrel, and Kirk Pruhs. Speed scaling to manage energy and temperature. J. ACM, 54 (1): 3:1--3:39, 2007.

Digital Library

[8]

Nikhil Bansal, Aravind Srinivasan, and Ola Svensson. Lift-and-round to improve weighted completion time on unrelated machines. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18--21, 2016, pages 156--167, 2016. 10.1145/2897518.2897572.

Digital Library

[9]

Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, and Joseph Naor. Machine minimization for scheduling jobs with interval constraints. In 45th Symposium on Foundations of Computer Science (FOCS 2004), 17--19 October 2004, Rome, Italy, Proceedings, pages 81--90, 2004. 10.1109/FOCS.2004.38.

Digital Library

[10]

Yefim Dinitz, Naveen Garg, and Michel X. Goemans. On the single-source unsplittable flow problem. Combinatorica, 19 (1): 17--41, 1999. 10.1007/s004930050043.

[11]

Leslie A. Hall, David B. Shmoys, and Joel Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28--30 January 1996, Atlanta, Georgia., pages 142--151, 1996.

Digital Library

[12]

Sungjin Im and Benjamin Moseley. An online scalable algorithm for minimizing $ell_k$-norms of weighted flow time on unrelated machines. In ACM-SIAM Symposium on Discrete Algorithms, 2011.

Digital Library

[13]

Sungjin Im and Benjamin Moseley. Fair scheduling via iterative quasi-uniform sampling. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16--19, pages 2601--2615, 2017. 10.1137/1.9781611974782.171.

Digital Library

[14]

Sungjin Im, Shi Li, Benjamin Moseley, and Eric Torng. A dynamic programming framework for non-preemptive scheduling problems on multiple machines {extended abstract}. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4--6, 2015, pages 1070--1086, 2015. 10.1137/1.9781611973730.72.

Digital Library

[15]

VS Kumar, Madhav V Marathe, Srinivasan Parthasarathy, and Aravind Srinivasan. A unified approach to scheduling on unrelated parallel machines. Journal of the ACM (JACM), 56 (5): 28, 2009.

Digital Library

[16]

Jan K. Lenstra, David B. Shmoys, and Éva Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Program., 46: 259--271, 1990. 10.1007/BF01585745.

Digital Library

[17]

Shi Li. Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations. Accepted for publication in FOCS 2017, 2017.

[18]

and Plummer(2009)}lovasz2009matchingLászló Lovász and Michael D Plummer. Matching theory, volume 367. American Mathematical Soc., 2009.

[19]

Konstantin Makarychev and Maxim Sviridenko. Solving optimization problems with diseconomies of scale via decoupling. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18--21, 2014, pages 571--580, 2014.

Digital Library

[20]

Kirk Pruhs. Green computing algorithmics. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22--25, 2011, pages 3--4, 2011. 10.1109/FOCS.2011.44.

Digital Library

[21]

Prabhakar Raghavan and Clark D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7 (4): 365--374, 1987. 10.1007/BF02579324.

Digital Library

[22]

Andreas S. Schulz and Martin Skutella. Random-based scheduling: New approximations and lp lower bounds. In RANDOM, pages 119--133, 1997.

Digital Library

[23]

David Shmoys and Eva Tardos. An approximation algorithm for the generalized assignment problem. Math. Program., 62: 461--474, 1993.

[24]

Martin Skutella. Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM, 48 (2): 206--242, 2001. 10.1145/375827.375840.

Digital Library

[25]

F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced cpu energy. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS '95, pages 374--, Washington, DC, USA, 1995. IEEE Computer Society. ISBN 0--8186--7183--1. URL http://dl.acm.org/citation.cfm?id=795662.796264.

Digital Library

Cited By

Xu ZFu YXia QLi H(2023)Enabling Age-Aware Big Data Analytics in Serverless Edge CloudsIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228905(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228905
Eberle FMegow NSchewior K(2022)Online Throughput Maximization on Unrelated Machines: Commitment is No BurdenACM Transactions on Algorithms10.1145/356958219:1(1-25)Online publication date: 14-Dec-2022
https://dl.acm.org/doi/10.1145/3569582

Index Terms

A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Scheduling Unrelated Machines by Randomized Rounding

We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea is to assign jobs randomly to machines with probabilities derived from an ...
Preemptive and non-preemptive scheduling on two unrelated parallel machines
Abstract
In this paper, for the problem of minimizing the makespan on two unrelated parallel machines we compare the quality of preemptive and non-preemptive schedules. It is known that there exists an optimal preemptive schedule with at most two ...
Bounded parallel-batch scheduling on unrelated parallel machines
AAIM'10: Proceedings of the 6th international conference on Algorithmic aspects in information and management

In this paper, we consider the bounded parallel-batch scheduling problem on unrelated parallel machines. Problems R_m|B|F are NP-hard for any objective function F. For this reason, we discuss the special case with p_ij = p_i for i = 1, 2, ..., m, j = 1, 2, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures

July 2018

437 pages

ISBN:9781450357999

DOI:10.1145/3210377

General Chair:
Christian Scheideler
University of Paderborn, Germany
,
Program Chair:
Jeremy Fineman
Georgetown University, USA

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
EATCS: European Association for Theoretical Computer Science

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 July 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

SPAA '18

Sponsor:

SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures

July 16 - 18, 2018

Vienna, Austria

Acceptance Rates

SPAA '18 Paper Acceptance Rate 36 of 120 submissions, 30%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
215
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Xu ZFu YXia QLi H(2023)Enabling Age-Aware Big Data Analytics in Serverless Edge CloudsIEEE INFOCOM 2023 - IEEE Conference on Computer Communications10.1109/INFOCOM53939.2023.10228905(1-10)Online publication date: 17-May-2023
https://doi.org/10.1109/INFOCOM53939.2023.10228905
Eberle FMegow NSchewior K(2022)Online Throughput Maximization on Unrelated Machines: Commitment is No BurdenACM Transactions on Algorithms10.1145/356958219:1(1-25)Online publication date: 14-Dec-2022
https://dl.acm.org/doi/10.1145/3569582

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten