Paper Details

Implementation of real-time scheduling algorithms in a transputer environment

Authors: Caprani, Ole, Kristensen, Jens E., Mørk, Claus, Pedersen, Henrik Bo, Rasmussen, Finn R.

Abstract:

A variety of real-time scheduling algorithms is considered. Each algorithm is implemented on the transputer either in pure Occam or in Occam supplied with a few low level assembly procedures to manipulate the workspace queues. The algorithms used are non-preemptive non-priority scheduling, time-sliced non-priority scheduling, preemptive fixed priority scheduling (rate-monotonic scheduling) and preemptive dynamic priority scheduling (deadline scheduling). Furthermore, it is shown how access to shared data can be scheduled to meet time constraints. All the implemented scheduling algorithms have been assessed through experiments in order to estimate the overhead introduced.

Proceedings:

OUG-13: Real-Time Systems with Transputers, Hussein S. M. Zedan, 1990, pp 186 - 197 published by IOS Press, Amsterdam

This record in other formats: