Cited By
View all- Fomin AGoldengorin B(2022)An exact algorithm for the preemptive single machine scheduling of equal-length jobsComputers and Operations Research10.1016/j.cor.2022.105742142:COnline publication date: 16-May-2022
Scheduling Mutual Exclusion Accesses in Equal-Length Jobs
Article No.: 8, Pages 1 - 26
Abstract
A fundamental problem in parallel and distributed processing is the partial serialization that is imposed due to the need for mutually exclusive access to common resources. In this article, we investigate the problem of optimally scheduling (in terms of makespan) a set of jobs, where each job consists of the same number L of unit-duration tasks, and each task either accesses exclusively one resource from a given set of resources or accesses a fully shareable resource. We develop and establish the optimality of a fast polynomial-time algorithm to find a schedule with the shortest makespan for any number of jobs and for any number of resources for the case of L = 2. In the notation commonly used for job-shop scheduling problems, this result means that the problem J |dij=1, nj =2|Cmax is polynomially solvable, adding to the polynomial solutions known for the problems J2 | nj ≤ 2 | Cmax and J2 | dij = 1 | Cmax (whereas other closely related versions such as J2 | nj ≤ 3 | Cmax, J2 | dij ∈ { 1,2} | Cmax, J3 | nj ≤ 2 | Cmax, J3 | dij=1 | Cmax, and J |dij=1, nj ≤ 3| Cmax are all known to be NP-complete). For the general case L > 2 (i.e., for the job-shop problem J |dij=1, nj =L> 2| Cmax), we present a competitive heuristic and provide experimental comparisons with other heuristic versions and, when possible, with the ideal integer linear programming formulation.
References
[1]
K. Agrawal, C. Gill, J. Li, M. Mahadevan, D. Ferry, and C. Lu. 2013. A realtime scheduling service for parallel tasks. In Proceedings of the 2013 IEEE Real-Time and Embedded Technology and Applications Symposium. 1--11.
[2]
M. Berkelaar, K. Eikland, and P. Notebaert. 2004. Package “Lpsolve.” Retrieved July 16, 2019 from https://cran.r-project.org/web/packages/lpSolve/index.html.
[3]
J. Blazewicz, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1983. Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics 5 (1983), 11--24.
[4]
B. G. Chandran and D. S. Hochbaum. 2009. A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem. Operations Research 57, 2 (2009), 358--376.
[5]
M. Chen, Y. Bao, X. Fu, G. Pu, and T. Wei. 2017. Efficient resource constrained scheduling using parallel two-phase branch-and-bound heuristics. IEEE Transactions on Parallel and Distributed Systems 28, 5 (2017), 1299--1314.
[6]
T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. 2001. Introduction to Algorithms. McGraw-Hill.
[7]
A. Easwaran and B. Andersson. 2009. Scheduling sporadic tasks on multiprocessors with mutual exclusion constraints. In Proceedings of the 2009 International Conference on Parallel Processing. 50--57.
[8]
S. Even. 1979. Graph Algorithms. Computer Science Press.
[9]
L. R. Ford and D. R. Fulkerson. 1956. Maximal flow through a network. Canadian Journal of Mathematics 8 (1956), 399--404.
[10]
M. R. Garey and D. S. Johnson. 1975. Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing 4, 4 (1975), 397--411.
[11]
T. Gonzalez and S. Sahni. 1978. Flowshop and jobshop schedules: Complexity and approximation. Operations Research 26 (1978), 36--52.
[12]
T. Gonzalez. 1982. Unit execution time shop problems. Mathematics of Operations Research 7, 1 (1982), 57--66.
[13]
R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979), 287--326.
[14]
L. He, H. Zhu, and S. A. Jarvis. 2016. Developing graph-based co-scheduling algorithms on multicore computers. IEEE Transactions on Parallel and Distributed Systems 27, 6 (2016), 1617--1632.
[15]
N. Hefetz and I. Adiri. 1982. An efficient optimal algorithm for the two-machines unit-time jobshop schedule-length problem. Mathematics of Operations Research 7, 3 (1982), 354--360.
[16]
J. Hoogeveen, S. L. van de Velde, and B. Veltman. 1994. Complexity of scheduling multiprocessor tasks with prespecified processors allocation. Discrete Applied Mathematics 55 (1994), 259--272.
[17]
J. R. Jackson. 1956. An extension of Johnson’s results on job lot scheduling. Naval Research Logistics Quarterly 3 (1956), 201--203.
[18]
J. E. Hopcroft and R. M. Karp. 1973. An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2, 4 (1973), 225--231.
[19]
W. Huang, M. Yang, and J. Chen. 2016. Resource-oriented partitioned scheduling in multiprocessor systems: How to partition and how to share? In Proceedings of the 2016 IEEE Real-Time Systems Symposium. 111--122.
[20]
E. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. 1993. Sequencing and scheduling: Algorithms and complexity. In Handbooks in Operations Research and Management Science, S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin (Eds.). Vol. 4. Elsevier, 455--522.
[21]
J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. 1977. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, (1977), 343--362.
[22]
J. K. Lenstra and A. H. G. Rinnooy Kan. 1979. Computational complexity of discrete optimization problems. Annals of Discrete Mathematics 4 (1979), 121--140.
[23]
P. Li, H. Wu, B. Ravindran, E. D. Jensen. 2006. A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints. IEEE Transactions on Computers, 55, 4 (2006), 454--469.
[24]
R. V. Lopes and D. Menasce. 2016. A taxonomy of job scheduling on distributed computing systems. IEEE Transactions on Parallel and Distributed Systems 27, 12 (2016), 3412--3428.
[25]
R. G. Parker. 1996. Deterministic Scheduling Theory. Chapman 8 Hall.
[26]
P. Radojkovic, P. M. Carpenter, M. Moreto, V. Cakarevic, J. Verdu, A. Pajuelo, F. J. Cazorla, M. Nemirovsky, and M. Valero. 2016. Thread assignment of multithreaded network applications in multicore/multithreaded processors. IEEE Transactions on Parallel and Distributed Systems 24, 12 (2016), 2513--2525.
[27]
M. Middendorf and V. G. Timkovsky. 2002. On scheduling cycle shops: Classification, complexity and approximation. Journal of Scheduling 5 (2002), 135--169.
[28]
V. G. Timkovsky. 2004. Cycle shop scheduling. In Handbook of Scheduling—Algorithms, Models, and Performance Analysis, J. Y.-T. Leung (Ed.). Chapman 8 Hall, 7.1--7.22.
[29]
J. D. Ullman. 1976. Complexity of sequencing problems. In Computer and Job Shop Scheduling Theory, E. G. Coffman (Ed.). Wiley, 139--164.
[30]
D. P. Williamson, L. A. Hall, J. A. Hoogeveen, C. A. J. Hurkens, J. K. Lenstra, S. V. Sevastjanov, and D. B. Shmoys. 1997. Short shop schedules. Operations Research 45, 2 (1997), 288--294.
[31]
S. Zhuravlev, J. Saez, S. Blagodurov, A. Fedorova, and M. Prieto. 2012. Survey of scheduling techniques for addressing shared resources in multicore processors. ACM Computing Surveys 45, 1 (2012), 1--28.
Index Terms
- Scheduling Mutual Exclusion Accesses in Equal-Length Jobs
Recommendations
Online nonpreemptive scheduling of equal-length jobs on two identical machines
We consider the nonpreemptive scheduling of two identical machines for jobs with equal processing times yet arbitrary release dates and deadlines. Our objective is to maximize the number of jobs completed by their deadlines. Using standard nomenclature, ...
Parallel batch scheduling of equal-length jobs with release and due dates
In this paper we study parallel batch scheduling problems with bounded batch capacity and equal-length jobs in a single and parallel machine environment. It is shown that the feasibility problem 1|p-batch, b < n , r j , p j = p , C j ...
On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
We consider the problem of scheduling n unit-time jobs with multiple release time/deadline intervals, which are intervals of time in which the job can be scheduled. A feasible schedule is one in which each job is run in its entirety within one of its ...
Comments
Information & Contributors
Information
Published In
June 2019
109 pages
Copyright © 2019 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]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 August 2019
Accepted: 01 June 2019
Revised: 01 July 2018
Received: 01 August 2017
Published in TOPC Volume 6, Issue 2
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 145Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
Cited By
View all- Fomin AGoldengorin B(2022)An exact algorithm for the preemptive single machine scheduling of equal-length jobsComputers and Operations Research10.1016/j.cor.2022.105742142:COnline publication date: 16-May-2022
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format