| Summary: | 碩士 === 國立臺灣大學 === 電機工程學系 === 85 === In this thesis, a real-time kernel is constructed to help
thedevelopment of real-time applications. Six scheduling
algorithms, cyclic, rate-monotonic, deadline-monotonic, earliest
deadline first, mixed, and sporadic server, are provided in this
kernel. Besides,system services that allow an application
developer to employ theperiod transformation method easily are
also included in the kernel.Hard deadline periodic tasks, soft
deadline aperiodic tasks, and sporadictasks can all be scheduled
in our kernel. The process model adopted in the kernel is the
lightweight processmodel. Semaphores are provided to control the
mutual-exclusive access ofthe shared resources; mailboxes and
message queues are supported for intertask communication. For
avoiding deadlock and indefinite priorityinversions, the stack
resource policy is used to manage the access of theshared
resources. A simple example is provided in this Thesis to show
howto use our kernel.
|
|---|
