5683 search results - page 41 / 1137 » Interactive Schedulability Analysis |
EMSOFT
2005
Springer
14 years 2 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...
TACAS
2004
Springer
14 years 1 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...
CCGRID
2002
IEEE
14 years 1 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...
INFOCOM
1996
IEEE
14 years 19 days 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...
JSAC
2007
13 years 8 months ago
2007
— Despite its low-complexity, the zero-forcing receiver is known to suffer from noise enhancement to restore the spatially multiplexed data in a single-user MIMO system. Neverthe...