Study and Design of Global Snapshot Compilation Protocols for Rollback-Recovery in Mobile Distributed System

Khan Hamid, Praveen Kumar
{"title":"Study and Design of Global Snapshot Compilation Protocols for Rollback-Recovery in Mobile Distributed System","authors":"Khan Hamid, Praveen Kumar","doi":"10.21276/24565644/2017.v2.i2.20","DOIUrl":null,"url":null,"abstract":"Checkpoint is characterized as an assigned place in a program at which ordinary process is intruded on particularly to protect the status data important to permit resumption of handling at a later time. A conveyed framework is an accumulation of free elements that participate to tackle an issue that can't be separately comprehended. A versatile figuring framework is a dispersed framework where some of procedures are running on portable hosts (MHs). The presence of versatile hubs in an appropriated framework presents new issues that need legitimate dealing with while outlining a checkpointing calculation for such frameworks. These issues are portability, detachments, limited power source, helpless against physical harm, absence of stable stockpiling and so forth. As of late, more consideration has been paid to giving checkpointing conventions to portable frameworks. Least process composed checkpointing is an alluring way to deal with present adaptation to internal failure in portable appropriated frameworks straightforwardly. This approach is without domino, requires at most two recovery_points of a procedure on stable stockpiling, and powers just a base number of procedures to recovery_point. In any case, it requires additional synchronization messages, hindering of the basic calculation or taking some futile recovery_points. In this paper, we complete the writing review of some Minimum-process Coordinated Checkpointing Algorithms for Mobile Computing Systems","PeriodicalId":89778,"journal":{"name":"International journal of biomaterials research and engineering","volume":"96 1","pages":"251-254"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of biomaterials research and engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21276/24565644/2017.v2.i2.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Checkpoint is characterized as an assigned place in a program at which ordinary process is intruded on particularly to protect the status data important to permit resumption of handling at a later time. A conveyed framework is an accumulation of free elements that participate to tackle an issue that can't be separately comprehended. A versatile figuring framework is a dispersed framework where some of procedures are running on portable hosts (MHs). The presence of versatile hubs in an appropriated framework presents new issues that need legitimate dealing with while outlining a checkpointing calculation for such frameworks. These issues are portability, detachments, limited power source, helpless against physical harm, absence of stable stockpiling and so forth. As of late, more consideration has been paid to giving checkpointing conventions to portable frameworks. Least process composed checkpointing is an alluring way to deal with present adaptation to internal failure in portable appropriated frameworks straightforwardly. This approach is without domino, requires at most two recovery_points of a procedure on stable stockpiling, and powers just a base number of procedures to recovery_point. In any case, it requires additional synchronization messages, hindering of the basic calculation or taking some futile recovery_points. In this paper, we complete the writing review of some Minimum-process Coordinated Checkpointing Algorithms for Mobile Computing Systems
移动分布式系统回滚恢复全局快照编译协议的研究与设计
检查点的特点是程序中一个指定的位置,在这个位置上,普通进程被侵入,特别是为了保护状态数据,这些数据对于以后恢复处理很重要。传达的框架是参与解决无法单独理解的问题的自由元素的积累。通用图形框架是一种分散的框架,其中一些过程在便携式主机上运行。在适当的框架中使用通用集线器带来了新的问题,这些问题需要在概述此类框架的检查点计算时合理处理。这些问题是便携性、可分离性、有限的电源、无法抵御物理伤害、缺乏稳定的储存等等。最近,更多的考虑是为可移植框架提供检查点约定。最小进程组合检查点是直接处理可移植专用框架中当前对内部故障的适应的一种诱人的方法。这种方法不使用多米诺骨牌,在稳定存储时最多需要一个过程的两个recovery_point,并且只将基本数量的过程提供给recovery_point。在任何情况下,它都需要额外的同步消息,这会妨碍基本计算或占用一些无用的恢复点。在本文中,我们完成了一些用于移动计算系统的最小进程协调检查点算法的写作综述
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书