Sciweavers

13 search results - page 2 / 3
» ecrts 2002
Sort
View
ECRTS
2002
IEEE
13 years 9 months ago
Integrating Aperiodic and Recurrent Tasks on Fair-Scheduled Multiprocessors
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...
Anand Srinivasan, Philip Holman, James H. Anderson
ECRTS
2002
IEEE
13 years 9 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
ECRTS
2002
IEEE
13 years 9 months ago
Weakly Hard Real-time Constraints on Controller Area Network
For priority based buses such as CAN, worst case response time analysis is able to determine whether messages always meet their deadlines. This can include system models with boun...
Ian Broster, Guillem Bernat, Alan Burns
ECRTS
2002
IEEE
13 years 9 months ago
Object Sharing in Pfair-scheduled Multiprocessor Systems
We consider various techniques for implementing shared objects and for accounting for objectsharing overheads in Pfair-scheduled multiprocessor systems. We primarily focus on the ...
Philip Holman, James H. Anderson
ECRTS
2002
IEEE
13 years 9 months ago
The FTT-Ethernet Protocol: Merging Flexibility, Timeliness and Efficiency
Despite having been designed to interconnect office equipment such as computers and printers, since its early days Ethernet has also been considered for use in the industrial doma...
Paulo Pedreiras, Luís Almeida, Paolo Gai