Abstract
Real-time scheduling on multiprocessor involves many complex issues. One of them is tie-breaking: the way how ties are broken among tasks with same priority. Unlike on uniprocessor, the feasibility of a task set on multiprocessor depends on a tie-breaking policy as well as on a scheduling algorithm. In this paper, we suggest and compare several tie-breaking policies for deadline-based schedule algorithms on multiprocessor. An effective tie-breaking policy for different scheduling algorithm is identified by simulation. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Park, M., Han, S., Kim, H., Cho, S., & Cho, Y. (2004). Comparison of tie-breaking policies for real-time scheduling on multiprocessor. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. https://doi.org/10.1007/978-3-540-30121-9_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
