A carregar...
Publicação
Hard real-time multiprocessor scheduling resilient to core failures
| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 378.36 KB | Adobe PDF |
Orientador(es)
Resumo(s)
Most multiprocessor scheduling theory overlooks the possibility of hardware failures that entirely nullify the computation carried out by a task instance, and potentially also make the respective processor henceforth unusable. Yet, such failures may occur, causing the system to fail. Motivated by this reality, we introduce a new concept of hard real-time schedulability guarantees for critical multiprocessor systems and analysis for their derivation. Namely, all deadlines must be met, even in the event of a core failure. A scheduling approach, based on global fixed priorities, and accompanying analysis, for achieving such guarantees are then formulated.
Descrição
Presented at 21st IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2015). 19 to 21, Aug, 2015, pp 122-131. Hong Kong, China.
Palavras-chave
Failure analysis Multiprocessing systems Processor scheduling
Contexto Educativo
Citação
Editora
IEEE