Paper Details

%T Implementation of real\-time scheduling algorithms in a transputer environment
%A Ole Caprani, Jens E. Kristensen, Claus Mørk, Henrik Bo Pedersen, Finn R. Rasmussen
%E Hussein S. M. Zedan
%B OUG\-13: Real\-Time Systems with Transputers
%X 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.

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.