Sciweavers

5 search results - page 1 / 1
» Feasibility analysis of recurring branching tasks
Sort
View
IPPS
2006
IEEE
13 years 11 months ago
Schedulability analysis of non-preemptive recurring real-time tasks
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
Sanjoy K. Baruah, Samarjit Chakraborty
DATE
2005
IEEE
167views Hardware» more  DATE 2005»
13 years 11 months ago
A New Task Model for Streaming Applications and Its Schedulability Analysis
In this paper we introduce a new task model that is specifically targeted towards representing stream processing applications. Examples of such applications are those involved in...
Samarjit Chakraborty, Lothar Thiele
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 9 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
ICSOC
2007
Springer
13 years 11 months ago
Architectural Decisions and Patterns for Transactional Workflows in SOA
Abstract. An important architectural style for constructing enterprise applications is to use transactional workflows in SOA. In this setting, workflow activities invoke distribute...
Olaf Zimmermann, Jonas Grundler, Stefan Tai, Frank...