A PSO-Based Hierarchical Resource Scheduling Strategy on Cloud Computing

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

Abstract

Cloud computing environments facilitate applications by providing virtualized resources that can be provisioned dynamically. Computing resources are delivered by Virtual Machines (VMs). In such a scenario, resource scheduling algorithms play an important role where the aim is to schedule applications effectively so as to reduce the turn-around time and improve resource utilization. In this paper, we present a Particle Swarm Optimization (PSO) based strategy schedules applications to cloud resource taking into account both transmission cost and current load. In addition, a novel inertia weight was introduced in order to get the global search and local search effectively and avoid plunging into the local optimum. Finally, we experiment with application workflows by varying its performance and convergence analysis. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Zhang, H., Li, P., Zhou, Z., & Yu, X. (2013). A PSO-Based Hierarchical Resource Scheduling Strategy on Cloud Computing. In Communications in Computer and Information Science (Vol. 320, pp. 325–332). Springer Verlag. https://doi.org/10.1007/978-3-642-35795-4_41

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