A Markovian sensibility analysis for parallel processing scheduling on GNU/Linux

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © Springer-Verlag 2006.

Cite

CITATION STYLE

APA

Kawasaki, R. Y., Guedes, L. A., Cardoso, D. L., Francés, C. R. L., Carvalho, G. H. S., Carvalho, S. V., … Silva, M. S. (2006). A Markovian sensibility analysis for parallel processing scheduling on GNU/Linux. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4331 LNCS, pp. 269–278). https://doi.org/10.1007/11942634_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free