Performance modeling and analysis for centralized resource scheduling in metropolitan-area grids

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

Abstract

Metropolitan-Area Grid (MAG) normally deals with a more limited computation and data-intensive problems on geographically distributed and smaller range resources. Therefore, in a MAG, resource scheduling is distinguished from other Grid. Current research on performance evaluation of resource scheduling in MAG is based on simulation techniques, which can only consider a limited range of scenarios. In this paper, we propose a centralized resource scheduling model in a MAG and give a formal framework via Stochastic Process Algebras (SPA) to deal with this problem. Within this framework, we model and analyze the performance of resource scheduling, allowing for a wide variety of job and data scheduling algorithms. Moreover, we can evaluate the combined effectiveness of job and data scheduling algorithms, rather than study them separately. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Wang, G., Lin, C., & Liu, X. (2006). Performance modeling and analysis for centralized resource scheduling in metropolitan-area grids. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3842 LNCS, pp. 583–589). Springer Verlag. https://doi.org/10.1007/11610496_76

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