检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]厦门大学信息科学与技术学院,福建厦门361005 [2]电子科技大学中山学院,广东中山528402
出 处:《航空计算技术》2007年第3期63-65,82,共4页Aeronautical Computing Technique
基 金:广东省自然科学基金(06029667)
摘 要:探讨如何把抢占门限应用于具有优先级提升和内存受限的实时系统,并进一步研究了互不抢占组内,linux平台上基于增量检测点的内存备份/恢复的方法及原型系统的实现。原型系统采用了可扩展的链接方式作为检测点文件格式,使得数据更加紧凑有序;在内存的备份操作上,提出了“影子脏位”算法来识别两检测点之间有无被改变的部分。原型实验验证了所提出方法的有效性。After analyzing how to apply preemption - threshold - scheduling into real - time systems among which the recoveries of safety tasks may be executed at higher priority levels and the sizes of memories are limited, we research realization methods about memory backup/recovery on the Linux platform based on increment checkpoints for no-pre- emption task groups. At last, taking the microcomputer interlocking simulation system as an example, prototype experiment of memory backup/recovery has been done on the Linux platform in the lab. Our prototype experiment takes an ex- tendable checkpoint file layout to make data in a file compact. And with regard of memory backup operation, by using a“ showdown of dirty-bit” algorithm to identify the difference between two checkpoints, it implements an increment check- point to improve system performance. This experiment has proved the validity of proposed methods.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.240.165