3 search results - page 1 / 1 » A New Notion of Useful Cache Block to Improve the Bounds of ... |
ECRTS
2009
IEEE
13 years 2 months ago
2009
IEEE
LCTRTS
2010
Springer
13 years 6 months ago
2010
Springer
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...
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...