Article Fingerprint
ReserarchID
CSTBF8LMN
Computational grids have the potential for solving scientific and large -scale problems using heterogeneous and geographically distributed resources. In addition to the challenges of managing and scheduling resources reliable challenges arise because the grid infrastructure is unreliable. There are two major problems in Scheduling the Grid 1) Efficient Scheduling of jobs, 2) Providing fault tolerance in a reliable manner. Most of the existing strategies do not provide fault tolerance. There are some algorithms which provide fault tolerance but, they do a large amount of redundant computation to provide fault tolerance. This paper addresses this issue and minimizes redundant work by using a group level table of data. This technique is suitable for partitioning and group scheduling of jobs.
K. Srikala. 2013. \u201cFault Tolerant Scheduling of Partitioned and Grouped Jobs in Grid Computing (FTPG)\u201d. Global Journal of Computer Science and Technology - B: Cloud & Distributed GJCST-B Volume 13 (GJCST Volume 13 Issue B2): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 102
Country: India
Subject: Global Journal of Computer Science and Technology - B: Cloud & Distributed
Authors: K. Srikala, S. Ramachandram (PhD/Dr. count: 0)
View Count (all-time): 282
Total Views (Real + Logic): 9292
Total Downloads (simulated): 2546
Publish Date: 2013 06, Sat
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
Computational grids have the potential for solving scientific and large -scale problems using heterogeneous and geographically distributed resources. In addition to the challenges of managing and scheduling resources reliable challenges arise because the grid infrastructure is unreliable. There are two major problems in Scheduling the Grid 1) Efficient Scheduling of jobs, 2) Providing fault tolerance in a reliable manner. Most of the existing strategies do not provide fault tolerance. There are some algorithms which provide fault tolerance but, they do a large amount of redundant computation to provide fault tolerance. This paper addresses this issue and minimizes redundant work by using a group level table of data. This technique is suitable for partitioning and group scheduling of jobs.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.