Sciweavers

1719 search results - page 33 / 344
» Scheduling with soft constraints
Sort
View
TCAD
2002
73views more  TCAD 2002»
13 years 9 months ago
System-on-a-chip test scheduling with precedence relationships, preemption, and power constraints
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource c...
Vikram Iyengar, Krishnendu Chakrabarty
IS
2002
13 years 9 months ago
Evaluation of concurrency control strategies for mixed soft real-time database systems
Previous research in real-time concurrency control mainly focuses on the schedulability guarantee of hard real-time transactions and the reducing of the miss rate of soft real-tim...
Kam-yiu Lam, Tei-Wei Kuo, Ben Kao, Tony S. H. Lee,...
ECRTS
2008
IEEE
14 years 4 months ago
A Hierarchical Multiprocessor Bandwidth Reservation Scheme with Timing Guarantees
A multiprocessor scheduling scheme is presented for supporting hierarchical containers that encapsulate sporadic soft and hard real-time tasks. In this scheme, each container is a...
Hennadiy Leontyev, James H. Anderson
RTCSA
2008
IEEE
14 years 4 months ago
Schedulability Analysis for Non-Preemptive Tasks under Strict Periodicity Constraints
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
Omar Kermia, Yves Sorel
ISQED
2006
IEEE
116views Hardware» more  ISQED 2006»
14 years 3 months ago
Probabilistic Delay Budgeting for Soft Realtime Applications
Unlike their hard realtime counterparts, soft realtime applications are only expected to guarantee their ”expected delay” over input data space. This paradigm shift calls for ...
Soheil Ghiasi, Po-Kuan Huang