A New Co-Ordinated Checkpointing and Rollback Recovery Scheme for Distributed Shared Memory Clusters

Tripathy, Minakshi; Tripathy, C. R.

doi:10.5121/ijdps.2011.2104

Cited by 4 publications

(7 citation statements)

References 14 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But how many messages must be logged and until when. The only period that can create potential transit message is ED R before the checkpointing time [20], [24], [25]. So logging the message sent during this period can resolve the transit message problem.…”

Section: Recoverability Conditionmentioning

confidence: 99%

“…Based on this observation, the papers [18], [19], [24] propose to block the message sent during a certain period after the checkpointing. Using time based checkpointing assumptions, it is possible to specify approximately …”

Section: Consistency Conditionmentioning

confidence: 99%

“…To avoid blocking the communication during ED C (such as the strategies in [18], [19], [24]), when a VM sends a message during ED C to another VM (in this case the "send event" is not recorded), the VM receiver buffers the message and creates its checkpoint file, then it computes the message. In this case, the "receive event" will be also unrecorded in the checkpoint file of the receiver.…”

Section: Checkpointing Phasementioning

confidence: 99%

“…To deal with the problem of transit messages, the paper [24] proposes to block the communication a certain period just before the checkpointing time. The transit message is a message sent before the checkpointing of a VM i and received after the checkpointing of VM j .…”

Section: Recoverability Conditionmentioning

confidence: 99%

“…To avoid the synchronization condition, the papers [18], [19], [24] take into account the timer deviation ρ. In this case, orphan message can be created.…”

Section: Consistency Conditionmentioning

confidence: 99%

See 4 more Smart Citations

Adaptive time-based coordinated checkpointing for cloud computing workfl ows

Meroufel¹,

Belalem²

2014

SCPE

View full text Add to dashboard Cite

Abstract. Cloud computing is a new benchmark towards enterprise application development that can facilitate the execution of workflows in business process management system. The workflow technology can manage the business processes efficiently satisfying the requirements of modern enterprises. Besides the scheduling, the fault tolerance is a very important issue in the workflow management. In this paper, we analyse and compare between some existing checkpointing strategies, then we propose a lightweight checkpointing adequate to the cloud computing and the workflows characteristics. The proposed strategy is an Adaptive Time based Coordinated Checkpointing ATCCp, it ensures a strong consistency without any synchronization. ATCCp uses the concept of soft checkpointing to minimize the storage time and it uses the VIOLIN topology to improve the checkpointing performances. According to the experimental results, our approach decreases the overhead and the SLA violations.

show abstract

Section: Recoverability Conditionmentioning

confidence: 99%

Section: Consistency Conditionmentioning

confidence: 99%

Section: Checkpointing Phasementioning

confidence: 99%

Section: Recoverability Conditionmentioning

confidence: 99%

“…To avoid the synchronization condition, the papers [18], [19], [24] take into account the timer deviation ρ. In this case, orphan message can be created.…”

Section: Consistency Conditionmentioning

confidence: 99%

See 3 more Smart Citations

Adaptive time-based coordinated checkpointing for cloud computing workfl ows

Meroufel¹,

Belalem²

2014

SCPE

View full text Add to dashboard Cite

show abstract

A Comparative Analysis of Performance of Shared Memory Cluster Computing Interconnection Systems

Tripathy¹,

Tripathy

2014

Journal of Computer Networks and Communications

Self Cite

View full text Add to dashboard Cite

In recent past, many types of shared memory cluster computing interconnection systems have been proposed. Each of these systems has its own advantages and limitations. With the increase in system size of the cluster interconnection systems, the comparative analysis of their various performance measures becomes quite inevitable. The cluster architecture, load balancing, and fault tolerance are some of the important aspects, which need to be addressed. The comparison needs to be made in order to choose the best one for a particular application. In this paper, a detailed comparative study on four important and different classes of shared memory cluster architectures has been made. The systems taken up for the purpose of the study are shared memory clusters, hierarchical shared memory clusters, distributed shared memory clusters, and the virtual distributed shared memory clusters. These clusters are analyzed and compared on the basis of the architecture, load balancing, and fault tolerance aspects. The results of comparison are reported.

show abstract