1243 search results - page 123 / 249 » FPZL Schedulability Analysis |
93
Voted
MST
2000
15 years 15 days ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
122
click to vote
COR
2007
15 years 9 days ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
143
Voted
CORR
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
114
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
104
Voted
RTAS
2006
IEEE
15 years 6 months ago
2006
IEEE
The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume...