An Efficient Fault Tolerant Scheduling Approach for Computational Grid

Arwa,

doi:10.3844/ajassp.2012.2046.2051

Cited by 8 publications

(5 citation statements)

References 10 publications

(11 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed MLFT algorithm is compared with the Min-min algorithm which stands as a benchmark static heuristic algorithm for grid scheduling and the Fault Tolerant Algorithm (FTMM) proposed in [25], Bicriteria Scheduling Algorithm (BSA) [23], and LBFT algorithm [24] which is a load balancing algorithm for proving its performance based on makespan, hit count, deadline hit count, average resource utilization, and cost.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

Keerthika¹,

Suresh²

2015

The Scientific World Journal

View full text Add to dashboard Cite

Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Allocation of resources is a tedious issue since it has to consider several requirements such as system load, processing cost and time, user's deadline, and resource failure. This work attempts to design a resource allocation algorithm which is budget constrained and also targets load balancing, fault tolerance, and user satisfaction by considering the above requirements. The proposed Multiconstrained Load Balancing Fault Tolerant algorithm (MLFT) reduces the schedule makespan, schedule cost, and task failure rate and improves resource utilization. The proposed MLFT algorithm is evaluated using Gridsim toolkit and the results are compared with the recent algorithms which separately concentrate on all these factors. The comparison results ensure that the proposed algorithm works better than its counterparts.

show abstract

Section: Resultsmentioning

confidence: 99%

“…In our previous work [25], we have proposed an efficient fault tolerant scheduling algorithm (FTMM) which is based on data transfer time and failure rate. System performance is also achieved by reducing the idle time of the resources and distributing the unmapped tasks equally among the available resources.…”

Section: Introduction and Related Workmentioning

confidence: 99%

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

Keerthika¹,

Suresh²

2015

The Scientific World Journal

View full text Add to dashboard Cite

show abstract

“…In majority of the cases, users can be regarded as individual agents that generate jobs and try to access resources for their execution, or as external resource brokers that map jobs in favor of other individual users. A multi-agent architecture that addressed resource management and application execution with support for Quality of Services (QoS) in grid scheduling algorithms is presented by (Keerthika and Kasthuri, 2012;Marowka, 2000).…”

Section: Jcsmentioning

confidence: 99%

A Fuzzy Based Mechanism for Allocation of Grid Resources

Poonguzhali¹,

Shanmugavel

2013

Journal of Computer Science

View full text Add to dashboard Cite

One of the main challenges in Grid computing is efficient allocation of resources (CPU-hours, network bandwidth) to the tasks submitted by users. In our previous work a technique to allocate resources in a grid environment using predicted data has been proposed. We propose utilization of the predicted data the resources were classified into three types; they are permanent resources, semi-permanent and sporadic resources. These types of resources may become available for a time that is either higher than the dwelling time or lower than the dwelling time in a grid environment. As the nature features are not known in such classification and then allocation mechanism, the performance cannot be increased further. In order to avoid such problem, in this study, a prediction model and an allocation factor are introduced. These parameters are determined for the sporadic type and semi-permanent type of resources and they are used in the fuzzy-based resource allocation mechanism. The incorporation of these parameters in the resource allocation leads to a remarkable resource utilization rate and makespan. This can be observed from the simulation and comparative results. From the results, it can be said that the proposed resource allocation mechanism has proved the performance in a dynamic environment

show abstract

“…It also provides priority based scheduler to improve throughput, enhancing speed and a queue based scheduler as a compile time option. When a task is considered, the key parameters include deadline, memory space required, waiting time, process time, turnaround time (Keerthika and Kasthuri, 2012).…”

Section: Introductionmentioning

confidence: 99%

Implementation of Central Queue Based Realtime Scheduler for Multiple Source Data Streaming

Kaviha¹,

Kannan²,

Ravi³

2014

Journal of Computer Science

View full text Add to dashboard Cite

Real-time data packet sources are required to remain robust against different security threats. This study proposes a real-time secure scheduling strategy for data transmission to enhance the communication throughput and reduce the overheads. The proposed system combines real-time scheduling with security service enhancement, error detection and realtime scheduler based on EDF algorithm using uc/os-II real time operating system, implemented on cortex M3 processor. The scheduling unit uses central queue management model and the security enhancement scheme adopts a blowfish encryption mechanism.

show abstract

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

Cited by 8 publications

References 10 publications

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

A Fuzzy Based Mechanism for Allocation of Grid Resources

Implementation of Central Queue Based Realtime Scheduler for Multiple Source Data Streaming

Contact Info

Product

Resources

About