http://iet.metastore.ingenta.com
1887

Utility accrual real-time scheduling for (m,k)-firm deadline-constrained streams on multiprocessors

Utility accrual real-time scheduling for (m,k)-firm deadline-constrained streams on multiprocessors

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

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

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.

Considering video conferencing applications, presented is the first utility accrual (or UA) real-time scheduling algorithm for multiple (m, k)-firm deadline-constrained streams running on multiprocessors, called the global multiprocessor utility accrual scheduling algorithm for (m, k)-firm deadline-constraint multimedia streams (or gMUA-MK). Analytical and experimental studies show that gMUA-MK achieves timeliness performance and relatively high quality of multimedia services compared to existing schemes including gMUA.

References

    1. 1)
    2. 2)
      • Bernat, G., Cayssials, R.: `Guaranteed on-line weakly-hard real-time systems', IEEE Real-Time System Symp., 2001, London, UK.
    3. 3)
    4. 4)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2010.7980
Loading

Related content

content/journals/10.1049/el.2010.7980
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address