In this paper we present a scheduling coprocessor device for uniprocessor computer systems running a real-time operating system (RTOS). The coprocessor shortens the scheduling time of the operating system by performing dynamic priority computation for all tasks in parallel and making a task selection according to these priorities at a higher speed than a software solution would do. This paper starts with a survey of related work and gives a motivation for the development of the proposed coprocessor architecture. We describe the architecture of our deterministic scheduling coprocessor and an efficient FPGA implementation and give a performance evaluation.
CITATION STYLE
Hildebrandt, J., & Timmermann, D. (2000). An FPGA based scheduling coprocessor for dynamic priority scheduling in hard real-time systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1896, pp. 777–780). Springer Verlag. https://doi.org/10.1007/3-540-44614-1_83
Mendeley helps you to discover research relevant for your work.