혼합 임계 사이버 물리 시스템을 위한 실시간성 지원 연구 조사

  • Published : 2013.12.30

Abstract

Keywords

References

  1. S. Vestal. Preemptive scheduling of multi-criticality systems with varying degrees of execution time assurance. In Real-Time Systems Symposium (RTSS), 2007.
  2. S. Baruah, A. Burns, and R. Davis. Response-time analysis for mixed criticality systems. In Real-Time Systems Symposium (RTSS), 2011.
  3. S. Baruah, H. Li, and L. Stougie. Towards the design of certifiable mixed-criticality systems. In Real-Time and Embedded Technology and Applications Symposium (RTAS), 2010.
  4. N. Guan, P. Ekberg, M. Stigge, and W. Yi. Effective and efficient scheduling of certifiable mixed-criticality sporadic task systems. In Real-Time Systems Symposium (RTSS), 2011.
  5. H. Li and S. Baruah. An algorithm for scheduling certifiable mixed-criticality sporadic task systems. In Real- Time Systems Symposium (RTSS), 2010.
  6. S. K. Baruah, V. Bonifaci, G. D'Angelo, A. Marchetti- Spaccamela, S. Van Der Ster, and L. Stougie. Mixedcriticality scheduling of sporadic task systems. In European Symposium on Algorithms (ESA), 2011.
  7. S. Baruah, V. Bonifaci, G. D"Angelo, H. Li, A. Marchetti- Spaccamela, S. Van der Ster, and L. Stougie. The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems. In Euromicro Conference on Real Time Systems (ECRTS), 2012.
  8. P. Ekberg and W. Yi. Bounding and shaping the demand of mixed-criticality sporadic tasks. In Euromicro Conference on Real Time Systems (ECRTS), 2012.
  9. R. Pathan. Schedulability analysis of mixed-criticality systems on multiprocessors. In Euromicro Conference on Real Time Systems (ECRTS), 2012.
  10. H. Li and S. Baruah. Global mixed-criticality scheduling on multiprocessors. In Euromicro Conference on Real Time Systems (ECRTS), 2012.
  11. S. Baruah, B. Chattopadhyay, H. Li, and I. Shin. Mixedcriticality scheduling on multiprocessors. Real-Time Systems, 2013.
  12. D. Johnson, A. Demers, J. Ullman, M. Garey, and R. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 1974.
  13. S. K. Dhall and C. L. Liu. On a real-time scheduling problem. Operations Research, 1978.
  14. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 2000.
  15. A. Bastoni, B. B. Brandenburg, and J. H. Anderson. Cache-related preemption and migration delays: Empirical approximation and impact on schedulability. In Workshop on Operating Systems Platforms for Embedded Real-Time applications (OSPERT), 2010.