Non-preemptive scheduling for critical and hard real-time applications on embedded platforms

dc.contributor.author	MICEA, Mihai V.
dc.date.accessioned	2019-10-28T14:28:20Z
dc.date.available	2019-10-28T14:28:20Z
dc.date.issued	2005
dc.identifier.citation	MICEA, Mihai V. Non-preemptive scheduling for critical and hard real-time applications on embedded platforms. In: Microelectronics and Computer Science: proc. of the 4th intern. conf., September 15-17, 2005. Chişinău, 2005, vol. 2, pp. 53-56. ISBN 9975-66-038-X.	en_US
dc.identifier.isbn	9975-66-038-X
dc.identifier.uri	http://repository.utm.md/handle/5014/5508
dc.description.abstract	The problem of providing high predictability when scheduling critical and hard realtime applications on embedded and DSP-based platforms is studied in this paper. A model of hard real-time tasks, the ModX (executable module), is presented and a set of non-preemptive scheduling techniques are discussed, based on this model. Extensive evaluation tests have been performed to simulate and analyze the proposed scheduling algorithms and their comparative performance. The main evaluation results are also discussed in this work.	en_US
dc.language.iso	en	en_US
dc.publisher	Technical University of Moldova	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	applications	en_US
dc.subject	embedded platforms	en_US
dc.title	Non-preemptive scheduling for critical and hard real-time applications on embedded platforms	en_US
dc.type	Article	en_US