A Guaranteed Real-time Scheduling Algorithm for (m,k)-firm Deadline-constrained Tasks on Multiprocessors

References

• M Hamdaoui, and P Ramanathan, “A dynamic priority assignment technique for streams with (m,k)-firm deadlines”, In IEEE Transactions on Computers, pp. 1443–51, 1995.
   Google Scholar
• G Bernat, and R Cayssials, “Guaranteed on-line weakly-hard real-time systems”, In IEEE Real-Time System Symposium, pp.25–35, Dec. 2001.
   Google Scholar
• P Ramanathan, “Overload management in real-time control applications using (m,k)-firm guarantee”, In IEEE Transactions on Parallel and Distributed Systems, pp. 549–59, Jun. 1999.
   Google Scholar
• H Cho, Y Chung, and D Park, “On Guaranteed Dynamic Priority Assignment Schemes for Real-Time Tasks with (m,k)-firm Deadlines”, ETRI Journal, Vol. 32, no. 3, pp.422–9, Jun. 2010.
   Google Scholar
• J Carpenter, S Funk, P Holman, A Srinivasan, J Anderson, and S Baruah, “A categorization of real-time multiprocessor scheduling problems and algorithms”, in Handbook on Scheduling Algorithms, Methods, and Models, Chapman Hall, CRC; 2004.
   Google Scholar
• S Baruah, N Cohen, C G Plaxton, and D Varvel, “Proportionate progress: A notion of fairness in resource allocation”, Algorithmica Vol. 15, pp. 600, 1996.
   Google Scholar
• S K Baruah, J Gehrke, and C G Plaxton, “Fast scheduling of periodic tasks on multiple resources,” Proceedings of the 9th International Symposium on Parallel Processing, pp. 280–8, Santa Barbara, Apr. 1995.
   Google Scholar
• J Anderson, and A Srinivasan, “Mixed pfair/erfair scheduling of asynchronous periodic tasks,” in Proceedings of the 13th Euromicro Conference on Real-Time Systems, pp. 76–85, 2001.
   Google Scholar
• D Zhu, D Mossxe, and R Melhem, “Multiple-resource periodic scheduling problem: How much fairness is necessary?”, Proceedings of the 24th IEEE Real-Time Systems Symposium, pp. 142–51, 2003.
   Google Scholar
• H Cho, B Ravindran, and E D Jensen, “An optimal real-time scheduling algorithm for multiprocessors,” Proceedings of the 27th IEEE International Real-Time Systems Symposium, pp.101–10, Rio de Janeiro, Dec. 2006.
   Google Scholar
• H Cho, B Ravindran, and E D Jensen, “T-N Plane-Based Real-Time Scheduling for Homogeneous Multiprocessors”, Journal of Parallel and Distributed Computing, Vol. 70, no. 3, pp.225–36, 2010.
   Google Scholar
• M Hamdaoui, and P Ramanathan, “Evaluating Dynamic Failure Probability for Streams with (m,k)-Firm Deadlines”, IEEE Transactions on Computers, Vol. 46, no. 12, pp.1325–1337, Dec. 1997.
   Google Scholar
• G Bernat, A Burns, and A Llamosi, “Weakly-hard real-time systems”, In IEEE Transactions on Computers, pp. 308–21, Apr. 2001.
   Google Scholar
• J Chen, Z Wang, Y Song, and Y Sun, “Scalability and QoS guarantee for streams with (m,k)-firm deadline”, Computer Standards and Interfaces, Vol. 28, no. 5, pp. 560–71, Jun. 2006.
   Google Scholar
• Z Wang, J M Chen, and Y X Sun, “An integrated DBP for streams with (m,k)-firm real-time guarantee”, Journal of Zhejiang University, Natural Sciences, pp. 816–26, 2004.
   Google Scholar
• E Poggi, Y Song, A Koubaa, and Z Wang, “Matrix-DBP For (m,k)-firm Real-Time Guarantee”, Proceedings of Real-Time and Embedded System, pp. 457–82, 2003.
   Google Scholar
• J Chen, Y Song, Z Wang, and Y Sun, “Equivalent matrix DBP for streams with (m,k)-firm deadline”, IEEE International Symposium on Industrial Electronics, Vol. 1, pp. 675–80, May. 2004.
   Google Scholar
• G Quan, and X Hu, “Enhanced Fixed-priority scheduling with (m,k)-firm guarantee”, In IEEE RTSS, pp. 79–88, 2000.
   Google Scholar
• G C Buttazzo, “Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications”, Kluwer Academic Publishers; 1997.
   Google Scholar
• J Lin, and A M K Cheng, “Maximizing guaranteed QoS in (m,k)-firm real-time systems”, In IEEE International Conference on Embedded and Real-Time computing, pp. 402–10, Sydney, Aug. 2006.
   Google Scholar
• T Wu, and S Jin, “Weakly hard real-time scheduling algorithm for multimedia embedded system on multiprocessor platform”, In IEEE International Conference on Ubi-Media Computing, pp.320–5, Lanzhou, Aug. 2008.
   Google Scholar
• P Holman, and J Anderson, “Adapting pfair scheduling for symmetric multiprocessors,” Journal of Embedded Computing, Vol. 1, no.4,2005, pp. 543–64, 2006.
   Google Scholar
• J Calandrino, H Leontyev, A Block, U Devi, and J Anderson, “LITMUSRT: A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers,” Proceedings of the 27th IEEE Real-Time Systems Symposium, pp. 111–23, Dec. 2006.
   Google Scholar