3934 search results - page 57 / 787 » Approximate Schedulability Analysis |
127
click to vote
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
160
click to vote
EMSOFT
2005
Springer
15 years 10 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
159
click to vote
TACAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
136
click to vote
CCGRID
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper presents a performance analysis of marketbased batch schedulers for clusters of workstations. In contrast to previous work, we use user-centric performance metrics as t...
166
click to vote
INFOCOM
1996
IEEE
15 years 9 months ago
1996
IEEE
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...