Sciweavers

936 search results - page 92 / 188
» Task Graph Scheduling Using Timed Automata
Sort
View
JSA
1998
72views more  JSA 1998»
15 years 1 months ago
Network conscious design of distributed real-time systems
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...
Jung Woo Park, Young Shin Kim, Seongsoo Hong, Mana...
RTSS
2005
IEEE
15 years 7 months ago
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
Monitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies li...
Prasad Calyam, Chang-Gun Lee, Phani Kumar Arava, D...
105
Voted
ICS
2010
Tsinghua U.
15 years 6 months ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
DAC
2008
ACM
16 years 2 months ago
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts
End-to-end latency of messages is an important design parameter that needs to be within specified bounds for the correct functioning of distributed real-time control systems. In t...
Swarup Mohalik, A. C. Rajeev, Manoj G. Dixit, S. R...
IPPS
1998
IEEE
15 years 5 months ago
An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
Sylvain Lauzac, Rami G. Melhem, Daniel Mossé...