Thread Scheduling in Embedded Runtime Systems

This study explores the design space of thread scheduler on the resource-constrained embedded run-time system. The current state-of-art priority-based scheduler heavily relies on developers deliberate tuning of the programs to achieve good performance or even correct behavior. A simple mistake in setting the scheduler parameters can lead to processor resource starvation and high message latency. This thesis first provides the embedded system specific implementation and evaluation of various scheduling techniques widely-used in other systems. It then proposes a new approach to optimize processor share and mes-sage latency that is based on borrowed-virtual-time scheduling and message priority. In particular, threads inherit the priorities of the received messages and the scheduler always selects the thread with the least virtual time (actual execution time weighted by priority). Results show that this approach provides weighted fair share of the processor without any starvation and low message latency.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

Masters

Discipline thesis:degree_discipline

Engineering

Grantor

Rice University

Year dc:date.issued

2014

Author dc:creator

• Dai, Linge

Advisor dc:contributor.advisor

• Rixner, Scott

Committee members dc:contributor.committeemember

• Cox, Alan L.
• Cooper, Keith D.

• Thread scheduling
• Embedded runtime system
• Resource-constrained microcontroller
• Priority-based preemptive scheduling
• Virtual-runtime scheduling
• Message priority

Statement dc:rights

• Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.

Language dc:language.iso

eng

Handle dc:identifier.uri

https://hdl.handle.net/1911/76099

OAI identifier oai:identifier

oai:repository.rice.edu:1911/76099