公开(公告)号：US20070174494A1

公开(公告)日：2007-07-26

申请号：US11407614

申请日：2006-04-20

Applicant: Jeffrey Bonwick ,  William Moore

Inventor： Jeffrey Bonwick ,  William Moore

IPC: G06F3/00

CPC classification number: G06F3/0659 ,  G06F3/0611 ,  G06F3/0613 ,  G06F3/0689 ,  G06F13/385

Abstract: A method for executing a selected input/output (I/O) command from a plurality of I/O commands based on a dependency graph of I/O commands includes building the dependency graph of I/O commands, wherein the dependency graph is built by requiring all children of the selected I/O command to be ready before the selected I/O command is ready, and executing the I/O command based on the dependency graph, wherein execution of the selected I/O command is completed when all of the children of the selected I/O command finish execution.

Abstract translation: 基于I / O命令的依赖图来执行来自多个I / O命令的选择的输入/输出（I / O）命令的方法包括建立I / O命令的依赖图，其中构建依赖图 通过在选择的I / O命令准备就绪之前，要求所有I / O命令的所有子项都准备就绪，并且基于依赖关系图执行I / O命令，其中所有I / O命令的执行在完成时 的所选I / O命令的子项完成执行。

公开(公告)号：US20070124659A1

公开(公告)日：2007-05-31

申请号：US11434296

申请日：2006-05-15

Applicant: William Moore ,  Jeffrey Bonwick ,  Matthew Ahrens

Inventor： William Moore ,  Jeffrey Bonwick ,  Matthew Ahrens

IPC: G06F11/00 ,  H03M13/00

CPC classification number: G06F11/1076 ,  G06F2211/1059

Abstract: A method for writing data to a storage pool includes receiving a write operation to write a logical block of data to the storage pool, determining a number (n−1) of physical blocks required to store the logical block of data, generating a parity block using the logical block of data, allocating n physical blocks in the storage pool, writing the parity block in the first of n allocated physical block, and writing the logical block of data across the remaining n−1 allocated physical blocks, where n is less than a number of disks in the storage pool, and where each of the n allocated physical blocks is located on a different disk in the storage pool.

Abstract translation: 一种将数据写入存储池的方法包括接收写入操作以将数据的逻辑块写入存储池，确定存储逻辑数据块所需的数量（n-1）个物理块，产生奇偶校验块 使用逻辑数据块，在存储池中分配n个物理块，将奇偶校验块写入n个分配的物理块中的第一个，并将逻辑数据块写入剩余的n-1个分配的物理块，其中n少于 比存储池中的多个磁盘，并且其中每个n个分配的物理块位于存储池中的不同磁盘上。

公开(公告)号：US20070106677A1

公开(公告)日：2007-05-10

申请号：US11409427

申请日：2006-04-19

Applicant: William Moore ,  Jeffrey Bonwick ,  Matthew Ahrens

Inventor： William Moore ,  Jeffrey Bonwick ,  Matthew Ahrens

IPC: G06F7/00

CPC classification number: G06F11/1435 ,  G06F11/2082

Abstract: A computer readable medium includes executable instructions for resilvering a hierarchical block tree in a storage pool by traversing a branch of the hierarchical block tree only if a birth time of a parent block of the branch is greater than or equal to a lowest birth time on a dirty time log (DTL), and resilvering a child block in the branch only if the DTL comprises a birth time of the child block.

Abstract translation: 计算机可读介质包括用于通过遍历分层块树的分支来恢复存储池中的分层块树的可执行指令，只有当分支的父块的出生时间大于或等于分支块树的最低出生时间时 脏时间日志（DTL），并且如果DTL包括子块的出生时间，则在分支中恢复子块。

公开(公告)号：US20070118576A1

公开(公告)日：2007-05-24

申请号：US11406957

申请日：2006-04-19

Applicant: William Moore ,  Jeffrey Bonwick ,  Matthew Ahrens

Inventor： William Moore ,  Jeffrey Bonwick ,  Matthew Ahrens

IPC: G06F17/30

CPC classification number: G06F17/30212

Abstract: A method for writing a data block to a storage pool. The method including receiving a write operation for a block, determining whether the block comprises metadata, and if the block comprises metadata: determining a first replication type for the block, and writing the block to the storage pool in accordance with the first replication type. If the block does not comprise metadata: determining a second replication type for the block and writing the block to the storage pool in accordance with the second replication type.

Abstract translation: 一种将数据块写入存储池的方法。 该方法包括接收块的写入操作，确定块是否包括元数据，以及块是否包括元数据：确定块的第一复制类型，以及根据第一复制类型将块写入存储池。 如果块不包括元数据：确定块的第二复制类型并根据第二复制类型将块写入存储池。

公开(公告)号：US20070106865A1

公开(公告)日：2007-05-10

申请号：US11407637

申请日：2006-04-20

Applicant: William Moore ,  Jeffrey Bonwick

Inventor： William Moore ,  Jeffrey Bonwick

IPC: G06F12/00

CPC classification number: G06F3/0644 ,  G06F3/0617 ,  G06F3/0631 ,  G06F3/064 ,  G06F3/0689

Abstract: A method for writing a logical block into a storage pool includes receiving a request to write the logical block, selecting a block allocation policy, by a file system associated with the storage pool, from a set of allocation policies, obtaining a list of free physical blocks in the storage pool, allocating a physical block from the list of free physical blocks, based on the block allocation policy, and writing the logical block to the physical block.

Abstract translation: 用于将逻辑块写入存储池的方法包括从一组分配策略接收写入逻辑块的请求，由与存储池相关联的文件系统选择块分配策略，获得自由物理列表 存储池中的块，基于块分配策略从空闲物理块的列表分配物理块，以及将逻辑块写入物理块。

公开(公告)号：US20070106851A1

公开(公告)日：2007-05-10

申请号：US11406850

申请日：2006-04-19

Applicant: Jeffrey Bonwick ,  William Moore

Inventor： Jeffrey Bonwick ,  William Moore

IPC: G06F13/00 ,  G06F12/00

CPC classification number: G06F11/1435 ,  G06F3/0601 ,  G06F11/1076 ,  G06F11/2056 ,  G06F17/30212 ,  G06F2003/0697 ,  G06F2211/105

Abstract: A method for writing data to a storage pool, involving receiving a first write operation to write a first block to the storage pool, determining a first replication type for the first block using a first replication policy associated with the first block, determining a first number of physical blocks required to write the first block to the storage pool using a size of the first block and the first replication type, and writing the first block, in accordance with the first replication policy, to the storage pool by filling in the first number of physical blocks.

Abstract translation: 一种将数据写入存储池的方法，包括接收第一写入操作以将第一块写入存储池，使用与第一块相关联的第一复制策略确定第一块的第一复制类型，确定第一数量 使用所述第一块和所述第一复制类型的大小将所述第一块写入所述存储池所需的物理块;以及根据所述第一复制策略将所述第一块写入所述存储池，通过填充所述第一块 的物理块。

公开(公告)号：US20070106870A1

公开(公告)日：2007-05-10

申请号：US11409435

申请日：2006-04-19

Applicant: Jeffrey Bonwick ,  William Moore ,  Matthew Ahrens

Inventor： Jeffrey Bonwick ,  William Moore ,  Matthew Ahrens

IPC: G06F12/00

CPC classification number: G06F12/0238 ,  G06F11/2094

Abstract: A system includes a storage pool including a first disk and a second disk, a data management unit (DMU), and a storage pool allocator (SPA). The SPA is configured to receive a request from the DMU to write a logical block, allocate a first physical block on the first disk, attempt to write the logical block to the first physical block, and allocate a second physical block on the second disk, if the attempt to write the logical block to the first physical block fails.

Abstract translation: 系统包括包括第一盘和第二盘的存储池，数据管理单元（DMU）和存储池分配器（SPA）。 SPA被配置为从DMU接收写入逻辑块的请求，在第一磁盘上分配第一物理块，尝试将逻辑块写入第一物理块，并在第二盘上分配第二物理块， 如果将逻辑块写入第一个物理块的尝试失败。

公开(公告)号：US20070106868A1

公开(公告)日：2007-05-10

申请号：US11407772

申请日：2006-04-19

Applicant: William Moore ,  Jeffrey Bonwick

Inventor： William Moore ,  Jeffrey Bonwick

IPC: G06F12/00

CPC classification number: G06F3/0644 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0662 ,  G06F3/0683

Abstract: A computer readable medium includes executable instructions for writing a logical block in a storage pool by receiving a request to write the logical block, obtaining a first latency associated with a first disk in the storage pool and a second latency associated with a second disk in the storage pool, obtaining a list of free physical blocks, where the list of free physical blocks identifies free physical blocks on the first disk and the second disk, allocating a physical block from the list of free physical blocks based on the first latency and the second latency, and writing the logical block to the physical block.

Abstract translation: 计算机可读介质包括用于通过接收写入逻辑块的请求来写入存储池中的逻辑块的可执行指令，获得与存储池中的第一盘相关联的第一等待时间和与第二盘相关联的第二等待时间 存储池，获得空闲物理块的列表，其中所述空闲物理块的列表标识所述第一盘和所述第二盘上的空闲物理块，基于所述第一等待时间从所述空闲物理块的列表分配物理块，并且所述第二 延迟并将逻辑块写入物理块。

公开(公告)号：US20070106864A1

公开(公告)日：2007-05-10

申请号：US11406956

申请日：2006-04-19

Applicant: William Moore ,  Jeffrey Bonwick

Inventor： William Moore ,  Jeffrey Bonwick

IPC: G06F12/00

CPC classification number: G06F3/0644 ,  G06F3/0617 ,  G06F3/064 ,  G06F3/0689 ,  G06F11/1076 ,  G06F11/1435 ,  G06F11/2056 ,  G06F17/30212 ,  G06F2211/105

Abstract: A method for writing data to a storage pool, including receiving a first write operation for a first block, determining a first replication type for the first block, determining a number of physical blocks (n1) required to write the first block to the storage pool using a size of the first block and the first replication type, if n1 is not a multiple of the maximum supported replication level of the storage pool: allocating a number of padded physical blocks (p1) to n1 until n1+p1 is a multiple of a maximum supported replication level of the storage pool, and writing the first block to the storage pool by filling in the n1 physical blocks.

Abstract translation: 一种用于向存储池写入数据的方法，包括接收第一块的第一写入操作，确定第一块的第一复制类型，确定将第一块写入存储器所需的物理块数量（n 1） 使用第一个块的大小和第一个复制类型的池，如果n 1不是存储池的最大支持的复制级别的倍数：将多个填充的物理块（p 1）分配到n 1直到n 1 + p 1是存储池的最大支持的复制级别的倍数，并且通过填充n 1个物理块将第一块写入存储池。

公开(公告)号：US20070106862A1

公开(公告)日：2007-05-10

申请号：US11406590

申请日：2006-04-19

Applicant: Jeffrey Bonwick ,  William Moore ,  Matthew Ahrens

Inventor： Jeffrey Bonwick ,  William Moore ,  Matthew Ahrens

IPC: G06F12/00

CPC classification number: G06F3/065 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0683 ,  G06F11/1435 ,  G06F11/2056

Abstract: A method for storing a data block in a storage pool, including receiving a write operation for the data block, writing the data block into the storage pool, determining a first indirect block to store in the storage pool, wherein the first indirect block references the data block, writing the first indirect block to a first location in the storage pool, creating a copy of the first indirect block, and writing the copy of first indirect block to a second location in the storage pool.

Abstract translation: 一种用于将数据块存储在存储池中的方法，包括接收对数据块的写入操作，将数据块写入存储池，确定存储在存储池中的第一间接块，其中第一间接块引用 数据块，将所述第一间接块写入所述存储池中的第一位置，创建所述第一间接块的副本，以及将所述第一间接块的副本写入所述存储池中的第二位置。