Fault Tolerant Scheduling of Partitioned and Grouped Jobs in Grid Computing (FTPG)

1
K. Srikala
K. Srikala
2
S. Ramachandram
S. Ramachandram
1 TutorVista Global Pvt. Ltd

Send Message

To: Author

GJCST Volume 13 Issue B2

Article Fingerprint

ReserarchID

CSTBF8LMN

Fault Tolerant Scheduling of Partitioned and Grouped Jobs in Grid Computing (FTPG) Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

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.

5 Cites in Articles

References

  1. M Amoon (2011). Design of a fault tolerant Scheduling system for Grid Computing.
  2. Ming Tao,Shoubin Dong,Kejing He (2011). A New Replication Scheduling Strategy for Grid Workflow Applications.
  3. J Abawajy (2004). Fault-tolerant scheduling policy for grid computing systems.
  4. Malarvizhi Nandagopal ; Malarvizhi,Nandagopal (2010). FAULT TOLERANT SCHEDULING STRATEGY FOR COMPUTATIONAL GRID ENVIRONMENT.
  5. August´_N Caminero,Anthony Sulistio,Blanca Caminero,C Carrion,Rajkumar Buyya (2007). Extending GridSim with an architecture for failure detection.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

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): .

Download Citation

Issue Cover
GJCST Volume 13 Issue B2
Pg. 39- 42
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Classification
Not Found
Version of record

v1.2

Issue date

June 22, 2013

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 9250
Total Downloads: 2391
2026 Trends
Research Identity (RIN)
Related Research

Published Article

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.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Fault Tolerant Scheduling of Partitioned and Grouped Jobs in Grid Computing (FTPG)

K. Srikala
K. Srikala TutorVista Global Pvt. Ltd
S. Ramachandram
S. Ramachandram

Research Journals