Sciweavers

3934 search results - page 12 / 787
» Approximate Schedulability Analysis
Sort
View
EOR
2008
106views more  EOR 2008»
13 years 8 months ago
Analysis of a discrete-time preemptive resume priority buffer
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preempt...
Joris Walraevens, Bart Steyaert, Herwig Bruneel
CISS
2008
IEEE
14 years 2 months ago
Appropriate control of wireless networks with flow level dynamics
Abstract— We consider the network control problem for wireless networks with flow level dynamics under the general k-hop interference model. In particular, we investigate the co...
Long Le, Ravi R. Mazumdar
LCTRTS
2000
Springer
13 years 12 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
SIGADA
2007
Springer
14 years 2 months ago
AADL modeling and analysis of hierarchical schedulers
A system based on a hierarchical scheduler is a system in which the processor is shared between several collaborative schedulers. Such schedulers exist since 1960 and they are bec...
Frank Singhoff, Alain Plantec
FSTTCS
1999
Springer
14 years 20 days ago
A Randomized Algorithm for Flow Shop Scheduling
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
Naveen Garg, Sachin Jain, Chaitanya Swamy