UB ScholarWorks

Implementation of Fault Tolerance Algorithm to Restore Affected Nodes in Scheduling Clusters

Show simple item record

dc.contributor.author Hussen, Fadel
dc.contributor.author Elleithy, Khaled M.
dc.contributor.author Razaque, Abdul
dc.date.accessioned 2015-08-20T13:45:27Z
dc.date.available 2015-08-20T13:45:27Z
dc.date.issued 2012-01
dc.identifier.uri https://scholarworks.bridgeport.edu/xmlui/handle/123456789/1293
dc.description.abstract Due to the convergence of the networks, the top priority objective of researchers is to get the network fully connected. Several types of networks have been introduced and proposed to improve performance. Cluster environment provides full support for various applications. Scheduling is one of the most important research-focusing areas, where different supporting algorithms are implemented. However, there is still a gap in scheduling to provide best network connectivity to all nodes. This paper targets nodes affected issue that occurs due to scalability, data sharing, while leaving and joining the nodes. To control and retain an affected node in the clustering scheduling, fault tolerance techniques are applied. The base of this technique is Node Recovery Algorithm (NRA). This algorithm supports disconnected nodes and restores them to join the scheduling. Furthermore, this algorithm maximizes the efficiency of the cluster and improves the performance. en_US
dc.language.iso en_US en_US
dc.publisher AIRCC Publishing en_US
dc.subject Fault tolerance en_US
dc.subject Scheduling en_US
dc.subject Cluster en_US
dc.subject Algorithm en_US
dc.title Implementation of Fault Tolerance Algorithm to Restore Affected Nodes in Scheduling Clusters en_US
dc.type Article en_US
dc.publication.issue 1 en_US
dc.publication.name International Journal of Computer Networks & Communications (IJCNC) en_US
dc.publication.volume 4 en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ScholarWorks

Advanced Search


My Account