Open Access. Powered by Scholars. Published by Universities.®

Library and Information Science Commons

Open Access. Powered by Scholars. Published by Universities.®

Theses/Dissertations

Engineering

Publicly Accessible Penn Dissertations

Scheduling algorithm

Articles 1 - 1 of 1

Full-Text Articles in Library and Information Science

Resource-Efficient Scheduling Of Multiprocessor Mixed-Criticality Real-Time Systems, Jaewoo Lee Jan 2017

Resource-Efficient Scheduling Of Multiprocessor Mixed-Criticality Real-Time Systems, Jaewoo Lee

Publicly Accessible Penn Dissertations

Timing guarantee is critical to ensure the correctness of embedded software systems that

interact with the physical environment. As modern embedded real-time systems evolves,

they face three challenges: resource constraints, mixed-criticality, and multiprocessors. This

dissertation focuses on resource-efficient scheduling techniques for mixed-criticality systems

on multiprocessor platforms.

While Mixed-Criticality (MC) scheduling has been extensively studied on uniprocessor plat-

forms, the problem on multiprocessor platforms has been largely open. Multiprocessor al-

gorithms are broadly classified into two categories: global and partitioned. Global schedul-

ing approaches use a global run-queue and migrate tasks among processors for improved

schedulability. Partitioned scheduling approaches use per …