Sciweavers

155 search results - page 20 / 31
» On Schedulability Bounds of Static Priority Schedulers
Sort
View
INFOCOM
2003
IEEE
15 years 2 months 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...
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 2 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
APLAS
2010
ACM
14 years 7 months ago
Live Heap Space Bounds for Real-Time Systems
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
Martin Kero, Pawel Pietrzak, Johan Nordlander
SIGMETRICS
2008
ACM
14 years 9 months ago
Scheduling despite inexact job-size information
Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of "favoring sm...
Adam Wierman, Misja Nuyens
TPDS
2008
169views more  TPDS 2008»
14 years 9 months ago
Dynamic Resource Management in Energy Constrained Heterogeneous Computing Systems Using Voltage Scaling
An ad hoc grid is a wireless heterogeneous computing environment without a fixed infrastructure. This study considers wireless devices that have different capabilities, have limite...
Jong-Kook Kim, Howard Jay Siegel, Anthony A. Macie...