4081 search results - page 129 / 817 » Scheduling in polling systems |
129
click to vote
ICAC
2009
IEEE
15 years 11 months ago
2009
IEEE
We apply the concept of “games with a purpose” to NPcomplete mapping and scheduling problems in distributed systems and report our experiences. The particular context is a sch...
140
click to vote
ECRTS
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper deals with specific issues related to the design of distributed embedded systems implemented with mixed, event-triggered and time-triggered task sets, which communicate...
116
click to vote
PRDC
2006
IEEE
15 years 10 months ago
2006
IEEE
The general approach to fault tolerance in uniprocessor systems is to use time redundancy in the schedule so that any task instance can be re-executed in presence of faults during...
172
click to vote
DATE
1997
IEEE
15 years 8 months ago
1997
IEEE
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
158
Voted
RTAS
2008
IEEE
15 years 11 months ago
2008
IEEE
Message Sequence Charts (MSCs) are widely used for describing interaction scenarios between the components of a distributed system. Consequently, worst-case response time estimati...