专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US08407265B1 Hierarchical mapping of free blocks of cylinder groups of file systems built on slices of storage and linking of the free blocks 有权
标题翻译：文件系统的自由块的分层映射构建在存储片段和自由块的链接之上
公开(公告)号：US08407265B1
公开(公告)日：2013-03-26
申请号：US12950996
申请日：2010-11-19
申请人： Michael D. Scheer , Jean-Pierre Bono , Morgan Clark , Hongliang Tang , Sairam Veeraswamy , Pranit Sethi , Alexander S. Mathews
发明人： Michael D. Scheer , Jean-Pierre Bono , Morgan Clark , Hongliang Tang , Sairam Veeraswamy , Pranit Sethi , Alexander S. Mathews
IPC分类号： G06F12/00
CPC分类号： G06F17/30138
摘要： In a file server, a file system is built upon a volume of data storage. The file system includes multiple cylinder groups. Each cylinder group includes file system blocks. The file system blocks include allocated blocks and free blocks. The volume includes slices of storage, and each slice stores at least one of the cylinder groups. A hierarchical slice map has a top level that includes a count of free blocks in the file system, an upper level that includes a count of free blocks in groups of the slices, an intermediate level that includes a count of the free blocks in sub-groups of the slices, and a bottom level that includes a count of the free blocks in each slice of storage. To find a free block for allocation to a file, the slice map hierarchy is searched in a top-down fashion.
摘要翻译：在文件服务器中，文件系统是建立在一定数量的数据存储上的。文件系统包括多个气缸组。每个气缸组包括文件系统块。文件系统块包括分配的块和空闲块。卷包括存储片，并且每个片存储至少一个圆柱组。分级切片图具有包括文件系统中的空闲块的计数的顶层，包括片段中的空闲块的计数的上级，包括子块中的空闲块的计数的中间级，组的片，以及包括每个存储片中的空闲块的计数的底层。要找到用于分配到文件的空闲块，以自顶向下的方式搜索切片图层次结构。

2. 发明授权

US09152637B1 Just-in time formatting of file system metadata 有权
标题翻译：即时格式化文件系统元数据
公开(公告)号：US09152637B1
公开(公告)日：2015-10-06
申请号：US13591612
申请日：2012-08-22
申请人： Walter C. Forrester , Marc DeSouter , Michael D. Scheer , Morgan Clark , Pranit Sethi
发明人： Walter C. Forrester , Marc DeSouter , Michael D. Scheer , Morgan Clark , Pranit Sethi
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30067 , G06F17/30091
摘要： An improved technique generates formatted file system metadata in increments only when metadata for those increments are specifically requested. A location on a storage volume designated for storing file system metadata is read and tested to determine whether it stores a predetermined pattern indicating an unformatted state. If the pattern is found, metadata for the designated location are generated and returned. Otherwise, metadata are returned as initially read from the storage volume.
摘要翻译：改进的技术只有在具体请求这些增量的元数据时，才能以增量生成格式化的文件系统元数据。读取并测试指定用于存储文件系统元数据的存储卷上的位置，以确定其是否存储指示未格式化状态的预定模式。如果找到该模式，则生成并返回指定位置的元数据。否则，最初从存储卷读取元数据。

3. 发明授权

US08745005B1 Checkpoint recovery using a B-tree intent log with syncpoints 有权
标题翻译：使用具有同步点的B树意图日志进行检查点恢复
公开(公告)号：US08745005B1
公开(公告)日：2014-06-03
申请号：US11536952
申请日：2006-09-29
申请人： Marc DeSouter , Pranit Sethi
发明人： Marc DeSouter , Pranit Sethi
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F11/1471
摘要： A networked data storage system includes a primary volume and a pointer-based virtual secondary volume. The secondary volume has B-tree checkpoints of the state of a primary filesystem of the primary volume. Intermediate syncpoints are declared between checkpoint checkpoints. The syncpoints are logical locations on the secondary volume where the B-tree is known to be in a consistent state. The frequency of syncpoints may be set by an administrator in units of blocks, i.e., a syncpoint to be taken every n blocks. Before performing a B-tree split, entire images of the leaves and parent node involved in the split are written to an intent log in a relatively fast transaction that may comprise a single I/O operation to contiguous memory. Movement of data between leaf nodes and changes to the parent nodes as a result of the split operation proceed asynchronously. In the event of a reboot before the split operation is complete, the intent log is used to complete the split transaction from the most recent syncpoint. When a new syncpoint is declared, the intent log and dirty leaves are flushed.
摘要翻译：网络数据存储系统包括主卷和基于指针的虚拟辅助卷。辅助卷具有主卷的主文件系统状态的B树检查点。检查点检查点之间声明中间同步点。同步点是辅助卷上的逻辑位置，其中B树已知处于一致状态。同步点的频率可以由管理员以块为单位设置，即，每n个块要采取的同步点。在执行B-tree拆分之前，涉及分割的叶子和父节点的整个图像被写入相对快速的事务中的意图日志，该事务可以包括对连续存储器的单个I / O操作。作为分割操作的结果，叶节点之间的数据的移动和对父节点的更改将以异步方式进行。在拆分操作完成之前重新启动，意图日志用于从最近的同步点完成拆分事务。当一个新的同步点被声明时，意图日志和脏的叶子被刷新。

4. 发明授权

US08250033B1 Replication of a data set using differential snapshots 有权
标题翻译：使用差异快照复制数据集
公开(公告)号：US08250033B1
公开(公告)日：2012-08-21
申请号：US12240666
申请日：2008-09-29
申请人： Marc De Souter , Pranit Sethi
发明人： Marc De Souter , Pranit Sethi
IPC分类号： G06F17/30
CPC分类号： G06F17/30144 , G06F3/065 , G06F11/1451 , G06F11/2056 , G06F17/30088 , G06F17/30212
摘要： A replication process using snapshots to maintain information regarding changes made to a production data set following a point in time. In some embodiments, the production data set may be a file system and the snapshot may store information relating to changes made to both previously-allocated and newly-allocated data blocks. When a change is made to a previously-allocated data block, the original contents for the data block may be copied to a save volume prior to being overwritten by the new data, while for a newly-allocated data block no data may be copied to the save volume. An entry may also be created in a map identifying each changed data block. A replication process may then read the block map to identify data blocks storing new data to should be replicated to a replication data set, such that the replication data set remains a copy of the production data set.
摘要翻译：使用快照的复制过程来维护关于在时间点之后对生产数据集进行的更改的信息。在一些实施例中，生产数据集可以是文件系统，并且快照可以存储与对先前分配的和新分配的数据块进行的改变有关的信息。当对先前分配的数据块进行改变时，数据块的原始内容可以在被新数据覆盖之前复制到保存卷，而对于新分配的数据块，不能将数据复制到保存音量。还可以在标识每个改变的数据块的映射中创建条目。然后，复制过程可以读取块映射以识别存储要被复制到复制数据集的新数据的数据块，使得复制数据集保持生产数据集的副本。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式