Sciweavers

116 search results - page 14 / 24
» Procrastination scheduling in fixed priority real-time syste...
Sort
View
RTSS
2000
IEEE
13 years 12 months ago
Enhanced Fixed-Priority Scheduling with (m, k)-Firm Guarantee
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
Gang Quan, Xiaobo Sharon Hu
RTSS
2005
IEEE
14 years 1 months ago
Optimal Task Rate Selection in Fixed Priority Systems
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
Enrico Bini, Marco Di Natale
PODS
1990
ACM
150views Database» more  PODS 1990»
13 years 11 months ago
On Being Optimistic about Real-Time Constraints
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...
Jayant R. Haritsa, Michael J. Carey, Miron Livny
ADAEUROPE
2003
Springer
14 years 22 days ago
A Round Robin Scheduling Policy for Ada
Abstract. Although Ada defines a number of mechanisms for specifying scheduling policies, only one, Fifo Within Priorities is guaranteed to be supported by all implementations of ...
Alan Burns, Michael González Harbour, Andy ...
RTCSA
1998
IEEE
13 years 11 months ago
Wait-Free Snapshots in Real-Time Systems: Algorithms and Performance
Snap-shot mechanisms are used to read a globally consistent set of variable values. Such a mechanism can be used to solve a variety of communication and synchronization problems, ...
Andreas Ermedahl, Hans Hansson, Marina Papatrianta...