Sciweavers

321 search results - page 22 / 65
» Test scheduling for core-based systems
Sort
View
SODA
2010
ACM
219views Algorithms» more  SODA 2010»
15 years 8 months ago
Algorithms and Complexity for Periodic Real-Time Scheduling
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchett...
ECRTS
2006
IEEE
15 years 5 months ago
Real-Time Scheduling with Regenerative Energy
This paper investigates real-time scheduling in a system whose energy reservoir is replenished by an environmental power source. The execution of tasks is deemed primarily energy-...
Clemens Moser, Lothar Thiele, Luca Benini, Davide ...
AI
2005
Springer
14 years 11 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
ECRTS
2005
IEEE
15 years 4 months ago
Energy Aware Non-Preemptive Scheduling for Hard Real-Time Systems
Slowdown based on dynamic voltage scaling (DVS) provides the ability to perform an energy-delay tradeoff in the system. Non-preemptive scheduling becomes an integral part of syste...
Ravindra Jejurikar, Rajesh K. Gupta
ICSM
1999
IEEE
15 years 3 months ago
Test Case Prioritization: An Empirical Study
Test case prioritization techniques schedule test cases for execution in an order that attempts to maximize some objective function. A variety of objective functions are applicabl...
Gregg Rothermel, Roland H. Untch, Chengyun Chu, Ma...