9842 search results - page 347 / 1969 » Compositional timing analysis |
139
click to vote
EOR
2008
15 years 4 months ago
2008
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...
144
click to vote
SIGMETRICS
2002
ACM
15 years 4 months ago
2002
ACM
This paper analyzes various algorithms for scheduling low priority disk drive tasks. The derived closed form solution is applicable to class of greedy algorithms that include a va...
TIME
1999
IEEE
15 years 9 months ago
1999
IEEE
In the recent literature on time representation, an effort has been made to characterize the notion of time granularity and the relationships between granularities, in order to ha...
160
click to vote
FORMATS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
115
Voted
BDIM
2007
IEEE
15 years 11 months ago
2007
IEEE
— Design of Service Level Agreements (SLAs) emerges as an increasingly important discipline in business-oriented IT management. In this work, we study utility maximization of con...