Abstract
Replicated Checkpointing is emerging as a scalable fault tolerance technique. The fault tolerance capability is severely limited by number of replicas as well as improper replica placements. Dynamic generation of more replicas for mission critical and important data and their efficient placement requires high overheads due to computation again from initial stage. The performance becomes a severe problem for larges numbers of process or data need to replicate at run time again and again. Such increase of fault tolerance capability is bottleneck by rapid degradation of performance due to high overheads. In this paper we propose an algorithm disjoint algorithm which will not place the extra replicas without recomputing from initial stage but also will place replicas at totally disjoint set of nodes. This will avoid the system to break down the system from link or switch failure. This paper proposed architecture as well as experimental result to show effectiveness of proposed approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
