Sciweavers

13 search results - page 1 / 3
» Tightening the bounds on feasible preemptions
Sort
View
RTSS
2006
IEEE
14 years 4 months ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller
TECS
2010
62views more  TECS 2010»
13 years 5 months ago
Tightening the bounds on feasible preemptions
Harini Ramaprasad, Frank Mueller
LCTRTS
2010
Springer
14 years 24 days ago
Resilience analysis: tightening the CRPD bound for set-associative caches
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...
Sebastian Altmeyer, Claire Maiza, Jan Reineke
COCOA
2010
Springer
13 years 8 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
COLOGNETWENTE
2010
13 years 9 months ago
On the Convergence of Feasibility based Bounds Tightening
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...