Sciweavers

4797 search results - page 43 / 960
» The complexity of partition tasks
Sort
View
WCET
2008
13 years 10 months ago
On Composable System Timing, Task Timing, and WCET Analysis
The complexity of hardware and software architectures used in today's embedded systems make a hierarchical, composable timing analysis impossible. This paper describes the so...
Peter P. Puschner, Martin Schoeberl
ADC
2005
Springer
104views Database» more  ADC 2005»
14 years 2 months ago
Dynamic Restructuring of Recovery Nets
A Self-Adaptive Recovery Net (SARN) is an extended Petri net model for specifying exceptional behavior in workflow systems. SARN caters for high-level recovery policies that are ...
Rachid Hamadi, Boualem Benatallah
RTCSA
2008
IEEE
14 years 3 months ago
Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems
Cache partitioning techniques have been proposed in the past as a solution for the cache interference problem. Due to qualitative differences with general purpose platforms, real-...
Bach Duy Bui, Marco Caccamo, Lui Sha, Joseph Marti...
PRDC
2006
IEEE
14 years 2 months ago
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault-tolerant multiprocessor systems. Both static and dynam...
Hakem Beitollahi, Geert Deconinck
DAM
2006
81views more  DAM 2006»
13 years 8 months ago
The satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten