1534 search results - page 101 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
179
click to vote
COR
2011
15 years 12 days ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
191
click to vote
JTRES
2010
ACM
15 years 6 months ago
2010
ACM
In order to guarantee that real-time systems meet their timing specification, static execution time bounds need to be calculated. Not considering execution time predictability led...
178
click to vote
QUESTA
2007
15 years 5 months ago
2007
Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to comp...
138
click to vote
DAC
2002
ACM
16 years 6 months ago
2002
ACM
In this paper, we evaluate an adaptive loop parallelization strategy (i.e., a strategy that allows each loop nest to execute using different number of processors if doing so is be...
151
click to vote
RTSS
2008
IEEE
16 years 9 days ago
2008
IEEE
Many embedded systems are subject to temporal constraints that require advance guarantees on meeting deadlines. Such systems rely on static analysis to safely bound worst-case exe...