Advertisement

Journal of Scheduling

, Volume 22, Issue 2, pp 195–209 | Cite as

ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors

  • Sanjoy K. Baruah
  • Vincenzo BonifaciEmail author
  • Renato Bruni
  • Alberto Marchetti-Spaccamela
Article

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.

Keywords

Task partitioning Sporadic tasks Unrelated machines Speedup bound ILP rounding 

Notes

Acknowledgements

Work supported by NSF Grants CNS 1115284, CNS 1218693, CNS 1409175, and CPS 1446631, AFOSR Grant FA9550-14-1-0161, ARO Grant W911NF-14-1-0499, and a Grant from General Motors Corp. This work has also been partially supported by the research project “Designing Human-Agent Collectives for Sustainable Future Societies” (C26A15TXCF) of Sapienza University of Rome, by MIUR PRIN Grant 2012JXB3YF_003, and by the National Group of Computing Science (GNCS-INDAM).

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.CrossRefGoogle Scholar
  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). IEEEGoogle Scholar
  4. Andersson, B., & Raravi, G. (2016). Scheduling constrained-deadline parallel tasks on two-type heterogeneous multiprocessors. In Proceedings of 24th International Conference on Real-Time Networks, (pp. 247–256). ACMGoogle Scholar
  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 Google Scholar
  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). IEEEGoogle Scholar
  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.CrossRefGoogle Scholar
  8. Bini, E., & Buttazzo, G. C. (2005). Measuring the performance of schedulability tests. Real-Time Systems, 30(1–2), 129–154.CrossRefGoogle Scholar
  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.Google Scholar
  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.CrossRefGoogle Scholar
  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, IEEEGoogle Scholar
  12. Dertouzos, M. (1974). Control robotics: The procedural control of physical processors. In Proceedings of the IFIP Congress, (pp. 807–813)Google Scholar
  13. Frank, A., & Tardos, É. (1987). An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica, 7(1), 49–65.CrossRefGoogle Scholar
  14. Freuder, E. C. (1985). A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(4), 755–761.CrossRefGoogle Scholar
  15. Kamath, S. (2011). Unrelated parallel machine scheduling–perspectives and progress. OPSEARCH, 48(4), 318–334.CrossRefGoogle Scholar
  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.CrossRefGoogle Scholar
  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.CrossRefGoogle Scholar
  18. Lau, L. C., Ravi, R., & Singh, M. (2011). Iterative methods in combinatorial optimization. Cambridge: Cambridge University Press.Google Scholar
  19. Lenstra, J. K., Shmoys, D. B., & Tardos, É. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46, 259–271.CrossRefGoogle Scholar
  20. Liu, C., & Layland, J. (1973). Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1), 46–61.CrossRefGoogle Scholar
  21. Marchetti-Spaccamela, A., Rutten, C., van der Ster, S., & Wiese, A. (2014). Assigning sporadic tasks to unrelated machines. Mathematical Programming, 152, 1–28.Google Scholar
  22. Raravi, G. (2014). Real-Time Scheduling on Heterogeneous Multiprocessors. PhD thesis, Technical Institute of Porto (Portugal)Google Scholar
  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.CrossRefGoogle Scholar
  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.CrossRefGoogle Scholar
  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. IEEEGoogle Scholar
  26. Shmoys, D. B., & Tardos, É. (1993). An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62, 461–474.CrossRefGoogle Scholar
  27. Wiese, A., Bonifaci, V., & Baruah, S. (2013). Partitioned EDF scheduling on a few types of unrelated multiprocessors. Real-Time Systems, 49(2), 219–238.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.University of North Carolina at Chapel HillChapel HillUSA
  2. 2.Istituto di Analisi dei Sistemi ed InformaticaCNRRomaItaly
  3. 3.DIAGUniversità di Roma “Sapienza”RomaItaly

Personalised recommendations