会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 33. 发明申请
    • EFFICIENT VALIDATION OF WRITES FOR PROTECTION AGAINST DROPPED WRITES
    • 用于保护写作的写作的有效验证
    • US20090216944A1
    • 2009-08-27
    • US12036194
    • 2008-02-22
    • Binny Sher GillJames Lee Hafner
    • Binny Sher GillJames Lee Hafner
    • G06F12/00G06F12/08
    • G06F12/0804G06F12/0866G06F2212/1032
    • A write cache provides for staging of data units written from a processor for recording in a disk. The order in which destages and validations occur is controlled to make validations more efficient. The data units are arranged in a circular queue according to their respective disk storage addresses. Each data unit is tagged with a state value of 1, 0, or −1. A destaging pointer is advanced one-by-one to each data unit like the hand of a clock. Each data unit pointed to is evaluated as a destage victim. The first step is to check its state value. A data unit newly brought into the write cache will have its state value reset to 0. It will stay that way until it receives an overwrite x command or the destage pointer clocks around to x. If an overwrite x, the state value is set to 1, in a way, indicating recent use of the data unit and postponing its destaging and eviction. If the destage pointer clocks around to x when the state was 0, then it's time to destage x and the state value is changed to −1. A write to the disk occurs and a later read will be used to verify the write. If the state value was already 1 when the destage pointer clocks around to x, the state value is reset to 0. If the destage pointer clocks around to x when the state is −1, the associated data is read from the disk and validated to be same as the copy in cache. If not, the destage of x is repeated, and the state value remains as −1. Otherwise, if the associated read for validation did return a success, then data unit x is evicted from the write cache.
    • 写高速缓存提供从处理器写入的数据单元的分段以便在盘中记录。 控制出现故障和验证的顺序,使验证更有效率。 数据单元根据其各自的磁盘存储地址被排列成圆形队列。 每个数据单元的状态值为1,0或-1。 每个数据单元像时钟的手一个接一个地提前一个命中指针。 指出的每个数据单元被评估为一个流血的受害者。 第一步是检查其状态值。 新进入写入缓存的数据单元将其状态值重置为0.它将一直保持这种方式,直到它接收到覆盖x命令,或者指针指针周期延伸到x。 如果覆盖x,状态值设置为1,表示最近使用数据单元并延迟其破坏和驱逐。 如果在状态为0的情况下,目标指针周期到x,那么现在是时间到x,状态值改为-1。 将发生对磁盘的写入,稍后读取将用于验证写入。 如果目标指针周期到x的状态值已经为1,则状态值将重置为0.如果状态为-1,则返回指针周期为x,则从磁盘读取相关数据,并验证为 与缓存中的副本相同。 如果不是,则重复x的迁移,状态值保持为-1。 否则,如果用于验证的关联读取确实返回成功,则数据单元x从写缓存中被逐出。