Abstract
Real-time performance is very important to a real-time operating system (RTOS). It is also very important to determine schedulability of thread scheduler before we use the RTOS in our products. There are a lot of methods to value thread schedulability in practical application. Rate_Monotonic Scheduling Algorithm is an optimal static-priority processor scheduling algorithm; it is widely used in RTOS. We discuss the RM algorithm used in Windows CE , and give some useful conclusion.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Krishna, C.M.: Real-time Systems. Tsinghua University Press, Beijing (2001)
Berger, A.: Embedded System Design. Publishing House of Electronics Industry, Beijing (2002)
Liu, J.-X., Wang, Y.-J.: An Improved Rate Monotonic Schedulability Test Algorithm. Journal of Software 15, 799–814 (2004)
Luolei: Real-time embedded operating system and application. Beihang Press, Beijing (2005)
Microsoft Windows CE5.0 Documents
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, X., Sun, H. (2011). Thread Schedulability in Windows CE. In: Zeng, D. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23220-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-23220-6_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23219-0
Online ISBN: 978-3-642-23220-6
eBook Packages: Computer ScienceComputer Science (R0)