An efficient multi- priority scheduler for the transputer
Authors: Shea, K. M., Cheung, M. H., Lau, Francis C. M.
Multi-priority scheduling is essential in a spectrum of applications especially those involving real time. We have extended the hardware scheduler in the transputer to support multi-priority scheduling. We did it by implementing a layer of provably safe and efficient queue manipulation primitives and a "plug-in" data structure for process queueing on top of the original scheduler. For optimal performance, different data structures for queueing may be plugged into our scheduler to suit different application domains. We tested our scheduler with different process loads (up to 200 processes) and the performance is excellent: overhead due to the scheduler accounts for less than 1% of a timeslice on a T8.
Proceedings of WoTUG-15: Transputer Systems - ongoing Research, Alastair R. Allen, 1992, pp 139 - 153 published by IOS Press, Amsterdam
This record in other formats:Web page: BibTEX, Refer
Plain text: BibTEX, Refer
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.
Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org