3934 search results - page 42 / 787 » Approximate Schedulability Analysis |
105
Voted
JCSS
2007
15 years 28 days ago
2007
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
136
Voted
TC
2008
15 years 29 days ago
2008
The periodic update transaction model has been used to maintain the freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus of pa...
226
Voted
RTAS
2011
IEEE
14 years 4 months ago
2011
IEEE
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
113
Voted
AAAI
1997
15 years 2 months ago
1997
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
RTSS
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we present the first end-to-end fairness analysis of a network of fair servers. We argue that it is difficult to extend existing single-node fairness analysis to ...