Sciweavers

4081 search results - page 99 / 817
» Scheduling in polling systems
Sort
View
RTS
2006
84views more  RTS 2006»
13 years 10 months ago
Finite-horizon scheduling of radar dwells with online template construction
Timing constraints for radar tasks are usually specified in terms of the minimum and maximum temporal distance between successive radar dwells. We utilize the idea of feasible int...
Sathish Gopalakrishnan, Marco Caccamo, Chi-Sheng S...
ANOR
2010
130views more  ANOR 2010»
13 years 7 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
RTS
2011
123views more  RTS 2011»
13 years 5 months ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
HPCA
2011
IEEE
13 years 1 months ago
Bloom Filter Guided Transaction Scheduling
Contention management is an important design component to a transactional memory system. Without effective contention management to ensure forward progress, a transactional memory...
Geoffrey Blake, Ronald G. Dreslinski, Trevor N. Mu...
ICS
2005
Tsinghua U.
14 years 3 months ago
Power-aware resource allocation in high-end systems via online simulation
Traditionally, scheduling in high-end parallel systems focuses on how to minimize the average job waiting time and on how to maximize the overall system utilization. Despite the d...
Barry Lawson, Evgenia Smirni