The triangle scheduling problem

  • Christoph Dürr
  • Zdeněk Hanzálek
  • Christian Konrad
  • Yasmina Seddik
  • René Sitters
  • Óscar C. Vásquez
  • Gerhard Woeginger
Article
  • 85 Downloads

Abstract

This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the binary tree ratio. It is shown that the Greedy algorithm solves the problem to optimality when the binary tree ratio of the input instance is at most 2. We also show that the problem is unary NP-hard for instances with binary tree ratio strictly larger than 2 and provide a quasi-polynomial time approximation scheme. The approximation ratio of Greedy on general instances is shown to be between 1.5 and 1.05.

Keywords

Scheduling Mixed-criticality Packing 

References

  1. Baruah, S., Bonifaci, V., D’Angelo, G., Li, H., Marchetti-Spaccamela, A., Megow, N., et al. (2012). Scheduling real-time mixed-criticality jobs. IEEE Transactions on Computers, 61(8), 1140–1152.CrossRefGoogle Scholar
  2. Baruah, S., Li, H., & Stougie, L. (2010). Towards the design of certifiable mixed-criticality systems. In Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS ’10 (pp. 13–22). Washington, DC, USA: IEEE Computer Society.Google Scholar
  3. Briand, C., La, H. T., & Erschler, J. (2007). A robust approach for the single machine scheduling problem. Journal of Scheduling, 10(3), 209–221.CrossRefGoogle Scholar
  4. Burns, A., & Davis, R. (2015). Mixed criticality systems: A review. Technical Report, 7th edn, University of York.Google Scholar
  5. Chou, A. (2016). NP-hard triangle packing problems. In Research Science Institute Summer Program for Highschool Students, January 2016.Google Scholar
  6. Dvorak, J., & Hanzalek, Z. (2014). Multi-variant time constrained flexray static segment scheduling. In Factory Communication Systems (WFCS), 2014 10th IEEE Workshop on (pp. 1–8). IEEE.Google Scholar
  7. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: guide to NP-completeness. WH Freeman & Co.Google Scholar
  8. Gu, C., Guan, N., Deng, Q., & Yi, W. (2013). Improving OCBP-based scheduling for mixed-criticality sporadic task systems. In 2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications (pp. 247–256). Aug 2013.Google Scholar
  9. Hanzálek, Z., & Pácha, T. (1998). Use of the fieldbus systems in an academic setting. In Proceedings of the Third IEEE Real-Time Systems Education Workshop, RTEW ’98 (pp. 93–97). Washington, DC, USA: IEEE Computer Society.Google Scholar
  10. Hanzálek, Z., Tunys, T., & Šůcha, P. (2016). An analysis of the non-preemptive mixed-criticality match-up scheduling problem. Journal of Scheduling, 19(5), 601–607.CrossRefGoogle Scholar
  11. Honkomp, S. J., Mockus, L., & Reklaitis, G. V. (1997). Robust scheduling with processing time uncertainty. Computers & Chemical Engineering, 21, S1055–S1060.CrossRefGoogle Scholar
  12. Park, T., & Kim, S. (2011). Dynamic scheduling algorithm and its schedulability analysis for certifiable dual-criticality systems. In Proceedings of the Ninth ACM International Conference on Embedded Software, EMSOFT ’11 (pp. 253–262). New York, NY, USA: ACM.Google Scholar
  13. Socci, D., Poplavko, P., Bensalem, S., & Bozga, M. (2013). Mixed critical earliest deadline first. In 2013 25th Euromicro Conference on Real-Time Systems (pp. 93–102), July 2013.Google Scholar
  14. Stock, M. (2014). Canaerospace specification, technical document from Michael Stock Flight Systems.Google Scholar
  15. Vestal, S. (2007). Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Real-Time Systems Symposium, 2007. RTSS 2007. 28th IEEE International (pp. 239–243). IEEE.Google Scholar
  16. Wilson, M. (2016). Robust scheduling in an uncertain environment. Ph.D Thesis, TU Delft, Delft University of Technology.Google Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.UPMC Univ Paris 06, CNRS, LIP6Sorbonne UniversitésParisFrance
  2. 2.FEE and CIIRCCzech Technical University in PraguePragueCzechia
  3. 3.Department of Computer Science and DIMAPUniversity of WarwickCoventryUK
  4. 4.Department of Econometrics and Operations ResearchVrije UniversiteitAmsterdamThe Netherlands
  5. 5.Department of Industrial EngineeringUniversity of Santiago of ChileSantiagoChile
  6. 6.Department of Computer ScienceRWTH Aachen UniversityAachenGermany

Personalised recommendations