Load Balancing Using Enhanced Ant Algorithm In Grid Computing


Download Load Balancing Using Enhanced Ant Algorithm In Grid Computing PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Load Balancing Using Enhanced Ant Algorithm In Grid Computing book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.

Download

Load Balancing Using Enhanced Ant Algorithm in Grid Computing


Load Balancing Using Enhanced Ant Algorithm in Grid Computing

Author: Husna Jamal Abdul Nasir

language: en

Publisher:

Release Date: 2010


DOWNLOAD





Ant Colony Optimization Algorithm for Load Balancing in Grid Computing (UUM Press)


Ant Colony Optimization Algorithm for Load Balancing in Grid Computing (UUM Press)

Author: Ku Ruhana Ku Mahamud

language: en

Publisher: UUM Press

Release Date: 2012-01-01


DOWNLOAD





Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources. This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. The proposed algorithm is known as the enhance Ant Colony Optimization (EACO). The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism. The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone. This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job. EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form. The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. Resources with high pheromone value are selected to process the submitted jobs. Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization. Experimental results show that EACO produced better grid resource management solution.

Big Data Analytics


Big Data Analytics

Author: V. B. Aggarwal

language: en

Publisher: Springer

Release Date: 2017-10-03


DOWNLOAD





This volume comprises the select proceedings of the annual convention of the Computer Society of India. Divided into 10 topical volumes, the proceedings present papers on state-of-the-art research, surveys, and succinct reviews. The volumes cover diverse topics ranging from communications networks to big data analytics, and from system architecture to cyber security. This volume focuses on Big Data Analytics. The contents of this book will be useful to researchers and students alike.