article

ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors

Authors:

Sanjoy K. Baruah,

Vincenzo Bonifaci,

Alberto Marchetti-SpaccamelaAuthors Info & Claims

Journal of Scheduling, Volume 22, Issue 2

Pages 195 - 209

https://doi.org/10.1007/s10951-018-0593-x

Published: 01 April 2019 Publication History

Abstract

The problem of partitioning systems of independent constrained-deadline sporadic tasks upon heterogeneous multiprocessor platforms is considered. Several different integer linear program (ILP) formulations of this problem, offering different trade-offs between effectiveness (as quantified by speedup bound) and running time efficiency, are presented. One of the formulations is leveraged to improve the best speedup guarantee known for a polynomial-time partitioning algorithm, from 12.9 to 7.83. Extensive computational results on synthetically generated instances are also provided to establish the effectiveness of the ILP formulations.

References

[1]

Gurobi Optimizer. http://www.gurobi.com.

[2]

Achlioptas, D., Coja-Oghlan, A., & Ricci-Tersenghi, F. (2011). On the solution-space geometry of random constraint satisfaction problems. Random Structures & Algorithms, 38(3), 251-268.

Digital Library

[3]

Albers, K., & Slomka, F. (2004). An event stream driven approximation for the analysis of real-time systems. In Proceedings of 16th Euromicro Conference on Real-Time Systems, (pp. 187-195). IEEE.

Digital Library

[4]

Andersson, B., & Raravi, G. (2016). Scheduling constrained-deadline parallel tasks on two-type heterogeneous multiprocessors. In Proceedings of 24th International Conference on Real-TimeNetworks, (pp. 247-256). ACM.

Digital Library

[5]

Baruah, S., & Bini, E. (2008). Partitioned scheduling of sporadic task systems: An ILP-based approach. In Proceedings of 2008 Conference on Design and Architectures for Signal and Image Processing.

[6]

Baruah, S., Mok, A., & Rosier, L. (1990). Preemptively scheduling hard-real-time sporadic tasks on one processor. In Proceedings of 11th Real-Time Systems Symposium, (pp. 182-190). IEEE.

[7]

Baruah, S. K., & Fisher, N. (2006). The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Transactions on Computers, 55(7), 918-923.

Digital Library

[8]

Bini, E., & Buttazzo, G. C. (2005). Measuring the performance of schedulability tests. Real-Time Systems, 30(1-2), 129-154.

Digital Library

[9]

Bonifaci, V., D'Angelo, G., &Marchetti-Spaccamela, A. (2017). Algorithms for hierarchical and semi-partitioned machine scheduling. In To Appear in 31st International Parallel and Distributed Processing Symposium (IPDPS 2017), IEEE.

[10]

Chen, J., & Chakraborty, S. (2013). Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks. Real-Time Systems, 49(4), 475-516.

[11]

Chwa, H. S., Seo, J., Lee, J., & Shin, I. (2015). Optimal real-time scheduling on two-type heterogeneous multicore platforms. In Proceedings of Real-Time Systems Symposium, IEEE.

Digital Library

[12]

Dertouzos, M. (1974). Control robotics: The procedural control of physical processors. In Proceedings of the IFIP Congress, (pp. 807-813).

[13]

Frank, A., & Tardos, É. (1987). An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica, 7(1), 49-65.

Digital Library

[14]

Freuder, E. C. (1985). A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(4), 755-761.

Digital Library

[15]

Kamath, S. (2011). Unrelated parallel machine scheduling-perspectives and progress. OPSEARCH, 48(4), 318-334.

[16]

Karp, R. (1972). Reducibility among combinatorial problems. In R. Miller&J. Thatcher (Eds.), Complexity of computer computations (pp. 85-103). New York: Plenum Press.

[17]

Karp, R. M., Leighton, F. T., Rivest, R. L., Thompson, C. D., Vazirani, U. V., & Vazirani, V. V. (1987). Global wire routing in two-dimensional arrays. Algorithmica, 2, 113-129.

Digital Library

[18]

Lau, L. C., Ravi, R., & Singh, M. (2011). Iterative methods in combinatorial optimization. Cambridge: Cambridge University Press.

Digital Library

[19]

Lenstra, J. K., Shmoys, D. B., & Tardos, é. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46, 259-271.

Digital Library

[20]

Liu, C., & Layland, J. (1973). Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1), 46-61.

Digital Library

[21]

Marchetti-Spaccamela, A., Rutten, C., van der Ster, S., & Wiese, A. (2014). Assigning sporadic tasks to unrelated machines. Mathematical Programming, 152, 1-28.

Digital Library

[22]

Raravi, G. (2014). Real-Time Scheduling on Heterogeneous Multiprocessors. PhD thesis, Technical Institute of Porto (Portugal).

[23]

Raravi, G., Andersson, B., & Bletsas, K. (2013). Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors. Real-Time Systems, 49(1), 29-72.

Digital Library

[24]

Raravi, G., Andersson, B., Nélis, V., & Bletsas, K. (2013). Task assignment algorithms for two-type heterogeneous multiprocessors. Real-Time Systems, 50(1), 87-141.

Digital Library

[25]

Raravi, G., & Nélis, V. (2012). A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors. In Proceedings of 33rd Real-Time Systems Symposium, pp. 117-126. IEEE.

Digital Library

Cited By

Chang SBi RSun JLiu WYu QDeng QGu Z(2022)Toward Minimum WCRT Bound for DAG Tasks Under Prioritized List Scheduling AlgorithmsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.319753241:11(3874-3885)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1109/TCAD.2022.3197532
Casini DPazzaglia PBiondi ADi Natale M(2022)Optimized partitioning and priority assignment of real-time applications on heterogeneous platforms with hardware accelerationJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2022.102416124:COnline publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1016/j.sysarc.2022.102416
Ouyang XZhu Y(2022)Core-aware combiningJournal of Parallel and Distributed Computing10.1016/j.jpdc.2022.01.001162:C(27-43)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1016/j.jpdc.2022.01.001
Show More Cited By

ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Convex quadratic and semidefinite programming relaxations in scheduling

We consider the problem of scheduling unrelated parallel machines subject to release dates so as to minimize the total weighted completion time of jobs. The main contribution of this paper is a provably good convex quadratic programming relaxation of ...
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints

Consider n independent jobs and m identical machines in parallel. Job j has a processing time p_j and a deadline $\bar{d}_j$. It must complete its processing before or at its deadline. All jobs are available for processing at time t=0 and preemptions are ...
Interference-aware fixed-priority schedulability analysis on multiprocessors

This paper presents new schedulability tests for preemptive global fixed-priority (FP) scheduling of sporadic tasks on identical multiprocessor platform. One of the main challenges in deriving a schedulability test for global FP scheduling is ...

Comments

Information & Contributors

Information

Published In

cover image Journal of Scheduling

Journal of Scheduling Volume 22, Issue 2

April 2019

122 pages

ISSN:1094-6136

Issue’s Table of Contents

Copyright © Copyright © 2019 Springer Science+Business Media, LLC, part of Springer Nature.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 April 2019

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chang SBi RSun JLiu WYu QDeng QGu Z(2022)Toward Minimum WCRT Bound for DAG Tasks Under Prioritized List Scheduling AlgorithmsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.319753241:11(3874-3885)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1109/TCAD.2022.3197532
Casini DPazzaglia PBiondi ADi Natale M(2022)Optimized partitioning and priority assignment of real-time applications on heterogeneous platforms with hardware accelerationJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2022.102416124:COnline publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1016/j.sysarc.2022.102416
Ouyang XZhu Y(2022)Core-aware combiningJournal of Parallel and Distributed Computing10.1016/j.jpdc.2022.01.001162:C(27-43)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1016/j.jpdc.2022.01.001
Bertout AGoossens JGrolleau EJamil RPoczekajlo X(2022)Workload assignment for global real-time scheduling on unrelated clustered platformsReal-Time Systems10.1007/s11241-021-09369-058:1(4-35)Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1007/s11241-021-09369-0
dos Santos MTinini RJanuario TFigueiredo G(2022)Deep recurrent neural network for optical fronthaul dimensioning and proactive vBBU placement in CF-RANPhotonic Network Communications10.1007/s11107-022-00964-043:1(59-73)Online publication date: 1-Feb-2022
https://dl.acm.org/doi/10.1007/s11107-022-00964-0
Voudouris PStenström PPathan R(2021)Federated Scheduling of Sporadic DAGs on Unrelated MultiprocessorsACM Transactions on Embedded Computing Systems10.1145/347701820:5s(1-25)Online publication date: 22-Sep-2021
https://dl.acm.org/doi/10.1145/3477018
Mascitti ACucinotta TAbeni L(2021)Combining admission tests for heuristic partitioning of real-time tasks on ARM big.LITTLE multi-processor architecturesJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2021.102229119:COnline publication date: 1-Oct-2021
https://dl.acm.org/doi/10.1016/j.sysarc.2021.102229
Voudouris PStenström PPathan R(2021)Bounding the execution time of parallel applications on unrelated multiprocessorsReal-Time Systems10.1007/s11241-021-09375-258:2(189-232)Online publication date: 21-Oct-2021
https://dl.acm.org/doi/10.1007/s11241-021-09375-2
Bertout AGoossens JGrolleau EPoczekajlo XCucu-Grosjean LMedina RAltmeyer SScharbarg J(2020)Workload assignment for global real-time scheduling on unrelated multicore platformsProceedings of the 28th International Conference on Real-Time Networks and Systems10.1145/3394810.3394823(139-148)Online publication date: 9-Jun-2020
https://dl.acm.org/doi/10.1145/3394810.3394823

View Options

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.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents