Sciweavers

75 search results - page 6 / 15
» An implementation of the earliest deadline first algorithm i...
Sort
View
INFOCOM
2003
IEEE
14 years 20 days ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...
RTSS
2000
IEEE
13 years 11 months ago
A framework for achieving inter-application isolation in multiprogrammed, hard real-time environments
A framework for scheduling a number of di erent real-time applications on a single shared preemptable processor is proposed. This framework enforces complete isolation among the d...
Giuseppe Lipari, John Carpenter, Sanjoy K. Baruah
CEE
2007
107views more  CEE 2007»
13 years 7 months ago
A non-preemptive scheduling algorithm for soft real-time systems
Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an i...
Wenming Li, Krishna M. Kavi, Robert Akl
CISIM
2008
IEEE
14 years 1 months ago
Scheduling in Multiprocessor System Using Genetic Algorithms
Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uniprocessor system would not be sufficient enough to execute all...
Keshav P. Dahal, M. Alamgir Hossain, Benny Varghes...
ESA
2008
Springer
153views Algorithms» more  ESA 2008»
13 years 9 months ago
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...