Optimized Assignment of Independent Task for Improving Resources Performance in Computational Grid
S. Singh. International Journal of Grid Computing & Applications (IJGCA), 6 (1/2):
27-36(June 2015)
DOI: 10.5121/ijgca.2015.6203
Abstract
Grid computing has emerged from category of distributed and parallel computing where the heterogeneous resources from different network are used simultaneously to solve a particular problem that need huge amount of resources. Potential of Grid computing depends on my issues such as security of resources, heterogeneity of resources, fault tolerance & resource discovery and job scheduling. Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing resources and is an NP-complete problem. To achieve the promising potential of grid computing, an effective and efficient job scheduling algorithm is
proposed, which will optimized two important criteria to improve the performance of resources i.e. makespan time & resource utilization. With this, we have classified various tasks scheduling heuristic in grid on the basis of their characteristics.
%0 Journal Article
%1 noauthororeditor
%A Singh, Sarpreet
%D 2015
%J International Journal of Grid Computing & Applications (IJGCA)
%K dynamic fault network secret-based tolerance
%N 1/2
%P 27-36
%R 10.5121/ijgca.2015.6203
%T Optimized Assignment of Independent Task for Improving Resources Performance in Computational Grid
%U http://airccse.org/journal/ijgca/papers/6215ijgca03.pdf
%V 6
%X Grid computing has emerged from category of distributed and parallel computing where the heterogeneous resources from different network are used simultaneously to solve a particular problem that need huge amount of resources. Potential of Grid computing depends on my issues such as security of resources, heterogeneity of resources, fault tolerance & resource discovery and job scheduling. Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing resources and is an NP-complete problem. To achieve the promising potential of grid computing, an effective and efficient job scheduling algorithm is
proposed, which will optimized two important criteria to improve the performance of resources i.e. makespan time & resource utilization. With this, we have classified various tasks scheduling heuristic in grid on the basis of their characteristics.
@article{noauthororeditor,
abstract = {Grid computing has emerged from category of distributed and parallel computing where the heterogeneous resources from different network are used simultaneously to solve a particular problem that need huge amount of resources. Potential of Grid computing depends on my issues such as security of resources, heterogeneity of resources, fault tolerance & resource discovery and job scheduling. Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing resources and is an NP-complete problem. To achieve the promising potential of grid computing, an effective and efficient job scheduling algorithm is
proposed, which will optimized two important criteria to improve the performance of resources i.e. makespan time & resource utilization. With this, we have classified various tasks scheduling heuristic in grid on the basis of their characteristics.},
added-at = {2018-05-21T07:42:52.000+0200},
author = {Singh, Sarpreet},
biburl = {https://www.bibsonomy.org/bibtex/200e09a49bcd0b8fc6b523abafd328352/ijgcajournal},
doi = {10.5121/ijgca.2015.6203},
interhash = {8e4ff8d28e97bc1785485411d88cd61c},
intrahash = {00e09a49bcd0b8fc6b523abafd328352},
issn = {0976-9404},
journal = {International Journal of Grid Computing & Applications (IJGCA)},
keywords = {dynamic fault network secret-based tolerance},
month = {June},
number = {1/2},
pages = {27-36},
timestamp = {2018-05-21T07:42:52.000+0200},
title = {Optimized Assignment of Independent Task for Improving Resources Performance in Computational Grid},
url = {http://airccse.org/journal/ijgca/papers/6215ijgca03.pdf},
volume = 6,
year = 2015
}