Pregled bibliografske jedinice broj: 35118
Scheduling Algorithms for the Aperiodic Tasks in Embedded Real-Time Computing Systems
Scheduling Algorithms for the Aperiodic Tasks in Embedded Real-Time Computing Systems // Computers in Technical Systems / Budin, Leo (ur.).
Rijeka: Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 1999. str. 21-24 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 35118 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Scheduling Algorithms for the Aperiodic Tasks in Embedded Real-Time Computing Systems
Autori
Martinović, Goran ; Hocenski, Željko ; Budin, Leo
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Computers in Technical Systems
/ Budin, Leo - Rijeka : Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 1999, 21-24
Skup
Mipro'99
Mjesto i datum
Opatija, Hrvatska, 17.05.1999. - 21.05.1999
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
task scheduling; real-time; aperiodic task scheduling; server
Sažetak
The paper deals with the problem of task scheduling in embedded real-time computing systems, specially aperiodic tasks scheduling with soft deadlines. Algorithms for aperiodic tasks scheduling must satisfy hard deadlines of aperiodic tasks and anticipate good average response times of aperiodic tasks with soft deadlines. There are two basic approaches to servicing aperiodic requests with soft deadlines - background processing and polling tasks, the characteristics of which are improved by algorithms of a priority exchange server and a deferrable server. Better results in scheduling are obtained by using the sporadic server algorithm. Basic principles are given, applicabillity of procedures and improvements is evaluated through graphic presentation of scheduling.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika, Računarstvo
