English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In case of multiple node failures performance becomes very low as compare tosingle node failure. Failures of nodes in cluster computing can be tolerated bymultiple fault tolerant computing. Existing recovery schemes are efficient forsingle fault but not with multiple faults. Recovery scheme proposed in thispaper having two phases; sequentially phase, concurrent phase. In sequentiallyphase, loads of all working nodes are uniformly and evenly distributed byproposed dynamic rank based and load distribution algorithm. In concurrentphase, loads of all failure nodes as well as new job arrival are assignedequally to all available nodes by just finding the least loaded node among theseveral nodes by failure nodes job allocation algorithm. Sequential andconcurrent executions of algorithms improve the performance as well betterresource utilization. Dynamic rank based algorithm for load redistributionworks as a sequential restoration algorithm and reassignment algorithm fordistribution of failure nodes to least loaded computing nodes works as aconcurrent recovery reassignment algorithm. Since load is evenly and uniformlydistributed among all available working nodes with less number of iterations,low iterative time and communication overheads hence performance is improved.Dynamic ranking algorithm is low overhead, high convergence algorithm forreassignment of tasks uniformly among all available nodes. Reassignments offailure nodes are done by a low overhead efficient failure job allocationalgorithm. Test results to show effectiveness of the proposed scheme arepresented.

An Improved Multiple Faults Reassignment based Recovery in Cluster Computing