Dual Priority Scheduling Algorithm Used in the nMPRA Microcontrollers-Dynamic Scheduler

dc.contributor.author	Andrieș, Lucian
dc.contributor.author	Găitan, Vasile Gheorghiță
dc.date.accessioned	2018-08-01T13:18:46Z
dc.date.available	2018-08-01T13:18:46Z
dc.date.issued	2015
dc.identifier.uri	http://10.11.10.50/xmlui/handle/123456789/5216
dc.description	The Annals of "Dunarea de Jos" University of Galati Fascicle IX Metallurgy and Materials Science No. 2 - 2015, ISSN 1453 – 083X	ro_RO
dc.description.abstract	This paper is a follow up of an already published paper that described the static scheduler. It deals with a true dynamic scheduling algorithm that is meant to maximize the CPU utilization. The dual priority algorithm is composed of two different scheduling algorithms, earliest deadline first (EDF) and round robin (RR). We have chosen EDF, because it is a dynamic scheduling algorithm, used in real time operating systems, which can be easily implemented in hardware, by improving the nHSE architecture. The new dynamic scheduler algorithm provides a much better CPU utilization, very good switching time for tasks and events within 5 to 8 machine cycles and guarantees that no task will suffer from starvation.	ro_RO
dc.language.iso	en	ro_RO
dc.publisher	Universitatea "Dunărea de Jos" din Galați	ro_RO
dc.subject	real time system	ro_RO
dc.subject	dynamic hardware scheduler	ro_RO
dc.subject	microcontroller	ro_RO
dc.subject	pipeline processor	ro_RO
dc.title	Dual Priority Scheduling Algorithm Used in the nMPRA Microcontrollers-Dynamic Scheduler	ro_RO
dc.type	Article	ro_RO