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

Access Full Text

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

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

A guaranteed dynamic priority assignment scheme for multiple real-time 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.

Inspec keywords: real-time systems; scheduling; quality of service

Other keywords: multiple realtime streams; firm deadlines; dynamic priority assignment scheme; quality of service

Subjects: Operating systems; Distributed systems software

References

    1. 1)
      • Bernat, G., Cayssials, R.: `Guaranteed on-line weakly–hard real-time systems', IEEE Real-Time System Symp., 2001.
    2. 2)
      • Wu, T., Jin, S.: `Weakly hard real-time scheduling algorithm for multimedia embedded system on multiprocessor platform', IEEE Int. Conf. on Ubi-Media Computing, 2008.
    3. 3)
      • C.L. Liu , J.W. Layland . Scheduling algorithms for multiprogramming in a hard-real-time environment. J. Assoc. Comput. Mach. , 1
    4. 4)
      • M. Hamdaoui , P. Ramanathan . A dynamic priority assignment technique for streams with (m,k)-firm deadlines. IEEE Trans. Comput. , 12 , 1443 - 1451
    5. 5)
      • Flavia, F., Ning, J., Simonot-Lion, F., YeQiong, S.: `Optimal on-line (m,k)-firm constraint assignment for real-time control tasks based on plant state information', IEEE Int. Conf. on Emerging Technologies and Factory Automation, 2008, p. 908–915.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2010.2497
Loading

Related content

content/journals/10.1049/el.2010.2497
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading