A Markovian Sensibility Analysis for Parallel Processing Scheduling on GNU/Linux
Parallel Computing has become a powerful tool to overcome certain types of computational problems in many areas such as engineering, especially due to the increasing diversity of platforms for execution of this type of application. The use of parallel computing over LANs and WANs is an alternative in the universe of dedicated environments (parallel machines and clusters), but, in some cases, it needs to imply QoS (Quality of Service) parameters, so it can execute efficiently. In this scenario, the deployment of resource allocation scheme plays an important role in order to satisfy the QoS requirements for parallel applications. In this paper we propose and present Markovian models for resource allocation (CPU allocation) schemes in a GPOS (General Purpose Operating Systems), aiming at offering an optimization method which makes the efficient performance of parallel and interactive applications feasible.
KeywordsPriority Queue Parallel Application Blocking Probability Parallel Processing Schedule Active Array
Unable to display preview. Download preview PDF.
- 2.Hwang, K., Xu, Z.: Scalable Parallel Computing - Technology, Architecture and Programming. WCB/ McGraw-Hill (1998)Google Scholar
- 3.Niyato, D., Hossain, E.: Analysis of Fair Scheduler and Connection Admission Control in Differentiated Services Wireless Networks. IEEE International Conference on Communications 5, 3137–3141 (2005)Google Scholar
- 6.Chanin, R., Corrêa, M., Fernandes, P., Sales, A., Scheer, R., Zorzo, A.F.: Analytical Modeling for Operating System Schedulers on NUMA Systems. In: Proc. of the 2nd International Workshop on Practical Applications of Stochastic Modelling, PASM 2005, University of Newcastle upon Tyne, UK (July 2005)Google Scholar
- 7.Love, R.: Linux Kernel Development, 1st edn. SAMS (2003)Google Scholar
- 9.Rockwell Automatation (accessed in 02/15/2006), www.arenasimulation.com
- 10.Palisade (accessed in 02/18/2006), www.palisade.com/bestfit