Rescheduling Enhanced Min-Min (REMM) Algorithm for Meta-task Scheduling in Cloud Computing

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

Abstract

Cloud computing is a service based and internet-oriented way of providing IT services on request. It contains all the computing resources from hardware infrastructure to software platform with software applications in distributed environment. To process a task with remote resources, Scheduling is a primary process. It comes under NP-Complete problem. A perfect task scheduling strategy handles the scheduling issues like makespan, cost, load balancing, resources utilization, fault tolerant and energy efficiency. This paper proposes a new REMM algorithm. This strategy decides the allocation of tasks in Meta task set based on speed of resources in cloud environment.

Cite

CITATION STYLE

APA

George Amalarethinam, D. I., & Kavitha, S. (2019). Rescheduling Enhanced Min-Min (REMM) Algorithm for Meta-task Scheduling in Cloud Computing. In Lecture Notes on Data Engineering and Communications Technologies (Vol. 26, pp. 895–902). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-03146-6_102

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