Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8694
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgarwal, Neha-
dc.contributor.authorChauhan, Piyush-
dc.contributor.authorNitin-
dc.date.accessioned2022-12-22T05:17:48Z-
dc.date.available2022-12-22T05:17:48Z-
dc.date.issued2013-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8694-
dc.description.abstractFault tolerance is one of the most desirable property in decentralized grid computing systems, where computational resources are geographically distributed. These resources collaborate in order to execute workflow applications as fast as possible. In workflow applications, tasks are dependent on each other, so it becomes extremely vital that scheduling techniques should also have some decentralized fault tolerant mechanism. In this paper, we have proposed a decentralized fault tolerant mechanism which utilize the checkpoint concept; for Heterogeneous Limited Duplication (HLD) algorithm. HLD is based on task duplication scheduling in heterogeneous environment. There are two fold benefits firstly; if node failure occurs then rest of grid nodes sustain the execution of application. Secondly, less makespan of application is obtained using checkpoint concept. Therefore, application scheduled over decentralized grid systems (which are known for their unreliable behavior) will yield results fast utilizing algorithm proposed in this paper.en_US
dc.language.isoenen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectGrid computingen_US
dc.subjectDependent task schedulingen_US
dc.subjectTask duplication strategyen_US
dc.subjectDecentralized fault toleranceen_US
dc.titleFault Tolerant Heterogeneous Limited Duplication Scheduling algorithm for Decentralized Griden_US
dc.typeArticleen_US
Appears in Collections:Journal Articles



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.