1243 search results - page 69 / 249 » EDZL Scheduling Analysis |
114
click to vote
RTAS
2007
IEEE
15 years 7 months ago
2007
IEEE
Most of today’s real-time embedded systems consist of a heterogeneous mix of fully-programmable processors, fixed-function components or hardware accelerators, and partially-pr...
90
Voted
IPPS
2005
IEEE
15 years 6 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 ...
118
click to vote
EMSOFT
2005
Springer
15 years 6 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...
118
Voted
TACAS
2004
Springer
15 years 6 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...
95
Voted
CCGRID
2002
IEEE
15 years 5 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...