TY - GEN
T1 - Best-effort scheduling (m, k)-firm real-time tasks based on the (m, k) -firm constraint meeting probability
AU - Kim, Kyong Hoon
AU - Kim, Jong
AU - Hong, Sung Je
PY - 2004
Y1 - 2004
N2 - Recent research in real-time systems has focused on firm real-time systems which are hard but permit occasional misses of deadlines. One of general firm task models is the (m, k)-firm task model. A task of (m, k)-firm constraint must meet at least m deadlines for any consecutive k periods. The previous best-effort scheduling algorithms for the (m, k)-firm tasks are based on either distance to failure state or loss rate. However, those schemes do not meet the (m, k)-firm constraint to a full extent, so that they have a limitation in performance. In this paper, we introduce a new probability of a task to meet its (m, k)-firm constraint, which reflects the (m, k)-firm constraint more than previous schemes. We also propose several scheduling algorithms based on the (m, k)-firm constraint meeting probability. Through simulation results, the success ratios of suggested algorithms show a better performance.
AB - Recent research in real-time systems has focused on firm real-time systems which are hard but permit occasional misses of deadlines. One of general firm task models is the (m, k)-firm task model. A task of (m, k)-firm constraint must meet at least m deadlines for any consecutive k periods. The previous best-effort scheduling algorithms for the (m, k)-firm tasks are based on either distance to failure state or loss rate. However, those schemes do not meet the (m, k)-firm constraint to a full extent, so that they have a limitation in performance. In this paper, we introduce a new probability of a task to meet its (m, k)-firm constraint, which reflects the (m, k)-firm constraint more than previous schemes. We also propose several scheduling algorithms based on the (m, k)-firm constraint meeting probability. Through simulation results, the success ratios of suggested algorithms show a better performance.
KW - (m, k)-firm constraint meeting probability
KW - (m, k)-firm task
KW - Best-effort scheduling
KW - Real-time systems
UR - http://www.scopus.com/inward/record.url?scp=12744255444&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:12744255444
SN - 1932415416
SN - 9781932415414
T3 - Proceedings of the International Conference on Embedded Systems and Applications ESA'04 - Proceedings of the International Conference on VLSI, VLSI'04
SP - 240
EP - 246
BT - Proceedings of the International Conference on Embedded Systems and Applications ESA'04 - Proceedings of the INternational Conference on VLSI, VLSI'04
A2 - Arabnia, H.R.
A2 - Guo, M.
A2 - Yang, L.T.
T2 - Proceedings of the International Conference on Embedded Systems and Applications ESA'04 - Proceedings of the International Conference on VLSI, VLSI'04
Y2 - 21 June 2004 through 24 June 2004
ER -