Sciweavers

31 search results - page 3 / 7
» On the Complexity of Scheduling Conditional Real-Time Code
Sort
View
CORR
2010
Springer
195views Education» more  CORR 2010»
13 years 5 months ago
Dynamic management of transactions in distributed real-time processing system
Managing the transactions in real time distributed computing system is not easy, as it has heterogeneously networked computers to solve a single problem. If a transaction runs acr...
Y. Jayanta Singh, Yumnam Somananda Singh, Ashok Ga...
DATE
2003
IEEE
137views Hardware» more  DATE 2003»
13 years 11 months ago
Dynamic Conditional Branch Balancing during the High-Level Synthesis of Control-Intensive Designs
We present two novel strategies to increase the scope for application of speculative code motions: (1) Adding scheduling steps dynamically during scheduling to conditional branche...
Sumit Gupta, Nikil D. Dutt, Rajesh K. Gupta, Alexa...
CODES
2007
IEEE
13 years 12 months ago
Improved response time analysis of tasks scheduled under preemptive Round-Robin
Round-Robin scheduling is the most popular time triggered scheduling policy, and has been widely used in communication networks for the last decades. It is an efficient schedulin...
Razvan Racu, Li Li, Rafik Henia, Arne Hamann, Rolf...
WCET
2008
13 years 7 months ago
Applying WCET Analysis at Architectural Level
Real-Time embedded systems must enforce strict timing constraints. In this context, achieving precise Worst Case Execution Time is a prerequisite to apply scheduling analysis and ...
Olivier Gilles, Jérôme Hugues
FMSD
2007
133views more  FMSD 2007»
13 years 5 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