Comparing several scheduling algorithms for real-time systems
Abstract
Three scheduling algorithms are examined, static priority-driven scheduling, time sliced scheduling and deadline-driven sheduling. Their characteristics are compared for scheduling tasks in real time. New, more simple proof is offered to show that deadline-driven scheduling algorithm is capable to utilize all proocessor resource without transient overloads.References
Published
2003-06-01
How to Cite
Dashevsky,. (2003). Comparing several scheduling algorithms for real-time systems. SPIIRAS Proceedings, 3(1), 91-98. https://doi.org/10.15622/sp.1.10
Section
Articles
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
