Guaranteed dynamic priority assignment scheme for streams with (m, k)-firm deadlines

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

0

초록

A guaranteed dynamic priority assignment scheme for multiple realtime streams with (m, k)-firm deadlines is presented. Analytical and experimental studies show that the proposed scheme provides assurance of timeliness performance and relatively high quality of service compared to existing schemes.

제목
Guaranteed dynamic priority assignment scheme for streams with (m, k)-firm deadlines
저자
Cho, H.Chung, Y.Park, D.
DOI
10.1049/el.2010.2497
발행일
2010-04-01
유형
Article
저널명
Electronics Letters
46
7
페이지
500 ~ 501