Wednesday, September 30, 2020 Home   | Search
Viewing Abstract

Page: 345-355 ------------------------------> Last_modified :7/11/2017 12:10:00 PM

Title: Strategies for Solving the NP-Hard Workflow Scheduling Problems in Cloud Computing Environments
Authors: S.Balamurugan; P.Visalakshi; V.M.Prabhakaran; S.Charanyaa; .Sankaranarayanan
Aff: Anna University, IT Department, Kalaignar Karunanidhi Institute of Technology, Coimbatore-641004, India. Tel: +91 9952521935;
Author Email:
Keywords: Cloud Computing; Task Scheduling; Grid Computing; Workflow Management Systems; Aneka; Cloudsim
Abstract:Introduction: Cluster and cloud computing technologies have shown a steep rise during the recent few years. Cluster comprises of logically connected independent systems working in cohesion with each others. Hence cluster is termed to be a variant of parallel or distributed processing system. The most important problem area, that need to be focused in is devising algorithm to split the given application into tasks, and allocating the tasks to different processors, coordinating the communication between the tasks and so on. Objective: The objective of this paper is to provide a detailed investigation on solving np-hard problems like scheduling and task allocation. The paper also surveys various Workflow Management Systems available as exiting projects. Results: To simulate the user own programs the cloud must have minimum configurations of a basic system with a CloudSim package and the java toolkit 1.6 or any other enhanced version. Creation of scalable cloud is illustrated with a simulation Conclusion:The paper concludes providing a literary review on migrating to clouds to solve the NP-hard workflow scheduling problem using Aneka and CloudSim.