知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

21 条记录 (耗时 0.016 秒)

    System and method for cleaning a log structure
    2.
    发明授权
    System and method for cleaning a log structure 有权
    用于清理日志结构的系统和方法

    公开(公告)号：US06611852B1

    公开(公告)日：2003-08-26

    申请号：US09675420

    申请日：2000-09-29

    申请人： Steve Morley ,  Robert C. Solomon ,  David DesRoches ,  John Percy

    发明人： Steve Morley ,  Robert C. Solomon ,  David DesRoches ,  John Percy

    IPC分类号： G06F1200

    CPC分类号： G06F3/0601 ,  G06F12/0802 ,  G06F12/123 ,  G06F2003/0697 ,  Y10S707/99953 ,  Y10S707/99957

    摘要： A system and method for cleaning a log structure, the log structure including one or more segments, each segment including live data, orders the one or more segments into a hot list according to age, with the youngest segment at the beginning of the hot list and the oldest segment at the end of the hot list, the youngest segment being the most recently used segment and the oldest segment being the least recently used segment, pushes one or more of the oldest segments in the hot list to a cleaning matrix, the cleaning matrix grouping segments according to age and percent of live data in the segment, traverses the cleaning matrix looking for a segment, determines whether enough live data has been found to write a complete segment, sequentially repeats the previous two processes until enough live data has been found to write a complete segment, reads data from the one or more found segments, and writes the read live data into an unused segment.

    摘要翻译： 一种用于清理日志结构的系统和方法，日志结构包括一个或多个段，每个段包括实时数据，根据年龄将一个或多个段排列成热列表，最热段在热列表的开始处 和热列表末尾的最旧的段，最小的段是最近使用的段，最旧的段是最近使用的段，将热列表中的一个或多个最旧的段推送到清理矩阵， 根据年龄和段中实时数据的百分比来清理矩阵分组，遍历查找分段的清理矩阵，确定是否已经发现是否有足够的实时数据写入完整的分段，依次重复前两个进程，直到足够的实况数据具有 被发现写入一个完整的段，从一个或多个找到的段读取数据，并将读取的实时数据写入未使用的段。

    System and method for expanding a log structure in a disk array
    4.
    发明授权
    System and method for expanding a log structure in a disk array 有权
    用于扩展磁盘阵列中的日志结构的系统和方法

    公开(公告)号：US06507890B1

    公开(公告)日：2003-01-14

    申请号：US09676222

    申请日：2000-09-29

    申请人： Steve Morley ,  Robert C. Solomon ,  David DesRoches ,  John Percy

    发明人： Steve Morley ,  Robert C. Solomon ,  David DesRoches ,  John Percy

    IPC分类号： G06F1200

    CPC分类号： G06F3/0607 ,  G06F3/0632 ,  G06F3/0644 ,  G06F3/0689 ,  G06F11/1096

    摘要： A system and method for expanding a log structure in a disk array, the disk array being expanded from M-width to N-width, the disk array including a storage level, the log structure including one or more sequential used segments, the one or more sequential used segments including live data, locates one or more sequential used segments, writes live data from the one or more located segments to the storage level, enlarges the size of the one or more located segments from M-width to N-width, and places the one or more enlarged segments on a first free segment list.

    摘要翻译： 一种用于扩展磁盘阵列中的日志结构的系统和方法，所述磁盘阵列从M宽扩展到N-width，所述磁盘阵列包括存储级别，所述逻辑结构包括一个或多个顺序使用的段，所述一个或多个 更多连续使用的段，包括实时数据，定位一个或多个顺序使用的段，将实时数据从一个或多个定位段写入存储级别，将一个或多个定位的段的大小从M宽扩大到N宽， 并将一个或多个放大的段放在第一个空闲段列表上。