Sciweavers

Share
12 search results - page 1 / 3
» Static-Priority Scheduling and Resource Hold Times
Sort
View
IPPS
2007
IEEE
12 years 4 months ago
Static-Priority Scheduling and Resource Hold Times
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...
Marko Bertogna, Nathan Fisher, Sanjoy K. Baruah
RTCSA
2008
IEEE
12 years 4 months ago
Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration
—The convergence of application domains in new systems-on-chip (SoC) results in systems with many applications with a mix of soft and hard real-time requirements. To reduce cost,...
Benny Akesson, Liesbeth Steffens, Eelke Strooisma,...
FMSD
2007
133views more  FMSD 2007»
11 years 9 months ago
Static priority scheduling of event-triggered real-time embedded systems
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
Cagkan Erbas, Andy D. Pimentel, Selin Cerav-Erbas
EMSOFT
2001
Springer
12 years 2 months ago
Rate-Based Resource Allocation Models for Embedded Systems
: Run-time executives and operating system kernels for embedded systems have long relied exclusively on static priority scheduling of tasks to ensure timing constraints and other c...
Kevin Jeffay, Steve Goddard
RTAS
2007
IEEE
12 years 4 months ago
Resource-Locking Durations in EDF-Scheduled Systems
The duration of time for which each application locks each shared resource is critically important in composing multiple independently-developed applications upon a shared “open...
Nathan Fisher, Marko Bertogna, Sanjoy K. Baruah
books