Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 669295

Sufficient Condition for Real-Time Non-preemptive Scheduling of Interactive Multimedia Tasks


Lenac, Kristijan; Mumolo, Enzo; Nolich, Massimiliano
Sufficient Condition for Real-Time Non-preemptive Scheduling of Interactive Multimedia Tasks // Proc of 8th International Symposium on Image and Signal Processing and Analysis (ISPA 2013)
Trst, Italija, 2013. (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 669295 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Sufficient Condition for Real-Time Non-preemptive Scheduling of Interactive Multimedia Tasks

Autori
Lenac, Kristijan ; Mumolo, Enzo ; Nolich, Massimiliano

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proc of 8th International Symposium on Image and Signal Processing and Analysis (ISPA 2013) / - , 2013

Skup
8th International Symposium on Image and Signal Processing and Analysis (ISPA 2013)

Mjesto i datum
Trst, Italija, 04.09.2013. - 06.09.2013

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
real-time scheduling; multimedia tasks; task schedulability

Sažetak
In many fields, non-preemptive real-time scheduling of a set of periodic tasks with different release times is very important if not even necessary. The number and characteristics of tasks may vary during time, thus imposing to re- evaluate the task schedulability over time. In this paper we propose an efficient sufficient schedulability condition, and we analytically show that if this bound is satisfied, the tasks are real-time schedulable under the non-preemptive Earliest Deadline First and Rate Monotonic policies. We experimentally analyse, by simulation, the bound and show that in practical cases occurring in Multimedia processing its validity remains significant for a very large range of CPU utilisation factors. In the same way we show by simulation that the gap of the proposed condition to the sufficient and necessary condition is negligible if the difference between the periods of periodic tasks is small. Finally, we give a graphical interpretation of the proposed bound and some application examples.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Ustanove:
Tehnički fakultet, Rijeka

Profili:

Avatar Url Kristijan Lenac (autor)


Citiraj ovu publikaciju:

Lenac, Kristijan; Mumolo, Enzo; Nolich, Massimiliano
Sufficient Condition for Real-Time Non-preemptive Scheduling of Interactive Multimedia Tasks // Proc of 8th International Symposium on Image and Signal Processing and Analysis (ISPA 2013)
Trst, Italija, 2013. (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Lenac, K., Mumolo, E. & Nolich, M. (2013) Sufficient Condition for Real-Time Non-preemptive Scheduling of Interactive Multimedia Tasks. U: Proc of 8th International Symposium on Image and Signal Processing and Analysis (ISPA 2013).
@article{article, author = {Lenac, Kristijan and Mumolo, Enzo and Nolich, Massimiliano}, year = {2013}, keywords = {real-time scheduling, multimedia tasks, task schedulability}, title = {Sufficient Condition for Real-Time Non-preemptive Scheduling of Interactive Multimedia Tasks}, keyword = {real-time scheduling, multimedia tasks, task schedulability}, publisherplace = {Trst, Italija} }
@article{article, author = {Lenac, Kristijan and Mumolo, Enzo and Nolich, Massimiliano}, year = {2013}, keywords = {real-time scheduling, multimedia tasks, task schedulability}, title = {Sufficient Condition for Real-Time Non-preemptive Scheduling of Interactive Multimedia Tasks}, keyword = {real-time scheduling, multimedia tasks, task schedulability}, publisherplace = {Trst, Italija} }




Contrast
Increase Font
Decrease Font
Dyslexic Font