Repository logo
 
Loading...
Thumbnail Image
Publication

Hard real-time multiprocessor scheduling resilient to core failures

Use this identifier to reference this record.
Name:Description:Size:Format: 
COM_CISTER_2015.pdf378.36 KBAdobe PDF Download

Advisor(s)

Abstract(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.

Description

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.

Keywords

Failure analysis Multiprocessing systems Processor scheduling

Citation

Research Projects

Organizational Units

Journal Issue