3934 search results - page 52 / 787 » Approximate Schedulability Analysis |
115
click to vote
ENTCS
2007
15 years 5 months ago
2007
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
145
click to vote
SIGCOMM
2006
ACM
15 years 11 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
181
Voted
ECRTS
2009
IEEE
15 years 2 months ago
2009
IEEE
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
172
Voted
ICTCS
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
156
Voted
WAOA
2004
Springer
15 years 10 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...