公开(公告)号：US20100146226A1

公开(公告)日：2010-06-10

申请号：US12706693

申请日：2010-02-16

申请人： Robert Zarnke ,  Michael Malcolm

发明人： Robert Zarnke ,  Michael Malcolm

IPC分类号： G06F12/00

CPC分类号： G06F11/1096 ,  G06F2211/1052

摘要： Integrating content into a storage system with substantially immediate access to that content. Providing high reliability and relatively easy operation with a storage system using redundant information for error correction. Having the storage system perform a “virtual write,” including substantially all steps associated with writing to the media to be integrated, except for the step of actually writing data to that media, including rewriting information relating to used disk blocks, and including rewriting any redundant information maintained by the storage system. Integrating the new physical media into the storage system, including accessing content already present on that media, free space already present on that media, and reading and writing that media. Recovering from errors during integration.

摘要翻译： 将内容集成到存储系统中，基本上立即访问该内容。 使用冗余信息的存储系统提供高可靠性和相对容易的操作，用于纠错。 使存储系统执行“虚拟写入”，包括与要写入的媒体相关的基本上所有步骤，除了将数据实际写入该媒体的步骤之外，包括重写与所使用的磁盘块有关的信息，并且包括重写任何 由存储系统维护的冗余信息。 将新的物理媒体集成到存储系统中，包括访问媒体上已经存在的内容，媒体上已经存在的可用空间以及阅读和写入该媒体。 在整合期间从错误中恢复。

公开(公告)号：US07539818B2

公开(公告)日：2009-05-26

申请号：US11461320

申请日：2006-07-31

申请人： Michael Malcolm ,  Robert Zarnke

发明人： Michael Malcolm ,  Robert Zarnke

IPC分类号： G06F13/00

CPC分类号： G06F11/1435 ,  G06F12/0813 ,  G06F17/30902

摘要： The invention provides a method and system for caching information objects transmitted using a computer network. A cache engine determines directly when and where to store those objects in a memory (such as RAM) and mass storage (such as one or more disk drives), so as to optimally write those objects to mass storage and later read them from mass storage, without having to maintain them persistently. The cache engine actively allocates those objects to memory or to disk, determines where on disk to store those objects, retrieves those objects in response to their network identifiers (such as their URLs), and determines which objects to remove from the cache so as to maintain sufficient operating space. The cache engine collects information to be written to disk in write episodes, so as to maximize efficiency when writing information to disk and so as to maximize efficiency when later reading that information from disk. The cache engine performs write episodes so as to atomically commit changes to disk during each write episode, so the cache engine does not fail in response to loss of power or storage, or other intermediate failure of portions of the cache. The cache engine also stores key system objects on each one of a plurality of disks, so as to maintain the cache holographic in the sense that loss of any subset of the disks merely decreases the amount of available cache. The cache engine also collects information to be deleted from disk in delete episodes, so as to maximize efficiency when deleting information from disk and so as to maximize efficiency when later writing to those areas having former deleted information. The cache engine responds to the addition or deletion of disks as the expansion or contraction of the amount of available cache.

摘要翻译： 本发明提供一种用于缓存使用计算机网络发送的信息对象的方法和系统。 缓存引擎直接确定将这些对象存储在内存（如RAM）和大容量存储（如一个或多个磁盘驱动器）中的时间和位置，以便最佳地将这些对象写入大容量存储，然后从大容量存储中读取它们 ，而不必一直维持它们。 高速缓存引擎主动将这些对象分配给内存或磁盘，确定磁盘上存储这些对象的位置，根据其网络标识符（如其URL）检索这些对象，并确定要从高速缓存中删除的对象，以便 保持足够的操作空间。 缓存引擎收集在写入事件中写入磁盘的信息，以便在将信息写入磁盘时最大化效率，以便在稍后从磁盘读取信息时最大化效率。 缓存引擎执行写入事件，以便在每个写入事件期间以原子方式向磁盘提交更改，因此高速缓存引擎不会因电源或存储的丢失或缓存部分的其他中间故障而失败。 高速缓存引擎还将密钥系统对象存储在多个盘中的每一个上，以便保持高速缓存全息，这意味着磁盘的任何子集的丢失仅仅减少可用高速缓存的数量。 缓存引擎还在删除情节中收集要从磁盘中删除的信息，以便在从磁盘中删除信息时最大限度地提高效率，从而在以后写入具有以前删除的信息的区域时最大限度提高效率。 缓存引擎响应于添加或删除磁盘，因为可用缓存量的扩展或缩小。

公开(公告)号：US20070050662A1

公开(公告)日：2007-03-01

申请号：US11461320

申请日：2006-07-31

申请人： Michael Malcolm ,  Robert Zarnke

发明人： Michael Malcolm ,  Robert Zarnke

IPC分类号： G06F11/00 ,  G06F12/00

CPC分类号： G06F11/1435 ,  G06F12/0813 ,  G06F17/30902

摘要： The invention provides a method and system for caching information objects transmitted using a computer network. A cache engine determines directly when and where to store those objects in a memory (such as RAM) and mass storage (such as one or more disk drives), so as to optimally write those objects to mass storage and later read them from mass storage, without having to maintain them persistently. The cache engine actively allocates those objects to memory or to disk, determines where on disk to store those objects, retrieves those objects in response to their network identifiers (such as their URLs), and determines which objects to remove from the cache so as to maintain sufficient operating space. The cache engine collects information to be written to disk in write episodes, so as to maximize efficiency when writing information to disk and so as to maximize efficiency when later reading that information from disk. The cache engine performs write episodes so as to atomically commit changes to disk during each write episode, so the cache engine does not fail in response to loss of power or storage, or other intermediate failure of portions of the cache. The cache engine also stores key system objects on each one of a plurality of disks, so as to maintain the cache holographic in the sense that loss of any subset of the disks merely decreases the amount of available cache. The cache engine also collects information to be deleted from disk in delete episodes, so as to maximize efficiency when deleting information from disk and so as to maximize efficiency when later writing to those areas having former deleted information. The cache engine responds to the addition or deletion of disks as the expansion or contraction of the amount of available cache.

摘要翻译： 本发明提供一种用于缓存使用计算机网络发送的信息对象的方法和系统。 缓存引擎直接确定将这些对象存储在内存（如RAM）和大容量存储（如一个或多个磁盘驱动器）中的时间和位置，以便最佳地将这些对象写入大容量存储，然后从大容量存储中读取它们 ，而不必一直维持它们。 高速缓存引擎主动将这些对象分配给内存或磁盘，确定磁盘上存储这些对象的位置，根据其网络标识符（如其URL）检索这些对象，并确定要从高速缓存中删除的对象，以便 保持足够的操作空间。 缓存引擎收集在写入事件中写入磁盘的信息，以便在将信息写入磁盘时最大化效率，以便在稍后从磁盘读取信息时最大化效率。 缓存引擎执行写入事件，以便在每个写入事件期间以原子方式向磁盘提交更改，因此高速缓存引擎不会因电源或存储的丢失或缓存部分的其他中间故障而失败。 高速缓存引擎还将密钥系统对象存储在多个盘中的每一个上，以便保持高速缓存全息，这意味着磁盘的任何子集的丢失仅仅减少可用高速缓存的数量。 缓存引擎还在删除情节中收集要从磁盘中删除的信息，以便在从磁盘中删除信息时最大限度地提高效率，从而在以后写入具有以前删除的信息的区域时最大限度提高效率。 缓存引擎响应于添加或删除磁盘，因为可用缓存量的扩展或缩小。

公开(公告)号：US08161319B2

公开(公告)日：2012-04-17

申请号：US12706693

申请日：2010-02-16

申请人： Robert Zarnke ,  Michael Malcolm

发明人： Robert Zarnke ,  Michael Malcolm

IPC分类号： G06F11/00

CPC分类号： G06F11/1096 ,  G06F2211/1052

摘要： Integrating content into a storage system with substantially immediate access to that content. Providing high reliability and relatively easy operation with a storage system using redundant information for error correction. Having the storage system perform a “virtual write,” including substantially all steps associated with writing to the media to be integrated, except for the step of actually writing data to that media, including rewriting information relating to used disk blocks, and including rewriting any redundant information maintained by the storage system. Integrating the new physical media into the storage system, including accessing content already present on that media, free space already present on that media, and reading and writing that media. Recovering from errors during integration.

摘要翻译： 将内容集成到存储系统中，基本上立即访问该内容。 使用冗余信息的存储系统提供高可靠性和相对容易的操作，用于纠错。 使存储系统执行“虚拟写入”，包括与要写入的媒体相关的基本上所有步骤，除了将数据实际写入该媒体的步骤之外，包括重写与所使用的磁盘块有关的信息，并且包括重写任何 由存储系统维护的冗余信息。 将新的物理媒体集成到存储系统中，包括访问媒体上已经存在的内容，媒体上已经存在的可用空间以及阅读和写入该媒体。 在整合期间从错误中恢复。

公开(公告)号：US07103794B2

公开(公告)日：2006-09-05

申请号：US09093533

申请日：1998-06-08

申请人： Michael Malcolm ,  Robert Zarnke

发明人： Michael Malcolm ,  Robert Zarnke

IPC分类号： G06F11/00

CPC分类号： G06F11/1435 ,  G06F12/0813 ,  G06F17/30902

摘要： The invention provides a method and system for caching information objects transmitted using a computer network. A cache engine determines directly when and where to store those objects in a memory (such as RAM) and mass storage (such as one or more disk drives), so as to optimally write those objects to mass storage and later read them from mass storage, without having to maintain them persistently. The cache engine actively allocates those objects to memory or to disk, determines where on disk to store those objects, retrieves those objects in response to their network identifiers (such as their URLs), and determines which objects to remove from the cache so as to maintain sufficient operating space. The cache engine collects information to be written to disk in write episodes, so as to maximize efficiency when writing information to disk and so as to maximize efficiency when later reading that information from disk. The cache engine performs write episodes so as to atomically commit changes to disk during each write episode, so the cache engine does not fail in response to loss of power or storage, or other intermediate failure of portions of the cache. The cache engine also stores key system objects on each one of a plurality of disks, so as to maintain the cache holographic in the sense that loss of any subset of the disks merely decreases the amount of available cache. The cache engine also collects information to be deleted from disk in delete episodes, so as to maximize efficiency when deleting information from disk and so as to maximize efficiency when later writing to those areas having former deleted information. The cache engine responds to the addition or deletion of disks as the expansion or contraction of the amount of available cache.

公开(公告)号：US20050182989A1

公开(公告)日：2005-08-18

申请号：US10778934

申请日：2004-02-13

申请人： Robert Zarnke ,  Michael Malcolm

发明人： Robert Zarnke ,  Michael Malcolm

IPC分类号： G06F12/16

CPC分类号： G06F11/1096 ,  G06F2211/1052

摘要： Integrating content into a storage system with substantially immediate access to that content. Providing high reliability and relatively easy operation with a storage system using redundant information for error correction. Having the storage system perform a “virtual write,” including substantially all steps associated with writing to the media to be integrated, except for the step of actually writing data to that media, including rewriting information relating to used disk blocks, and including rewriting any redundant information maintained by the storage system. Integrating the new physical media into the storage system, including accessing content already present on that media, free space already present on that media, and reading and writing that media. Recovering from errors during integration.

摘要翻译： 将内容集成到存储系统中，基本上立即访问该内容。 使用冗余信息的存储系统提供高可靠性和相对容易的操作，用于纠错。 使存储系统执行“虚拟写入”，包括与要写入的媒体相关的基本上所有步骤，除了将数据实际写入该媒体的步骤之外，包括重写与所使用的磁盘块有关的信息，并且包括重写任何 由存储系统维护的冗余信息。 将新的物理媒体集成到存储系统中，包括访问媒体上已经存在的内容，媒体上已经存在的可用空间以及阅读和写入该媒体。 在整合期间从错误中恢复。

公开(公告)号：US08359334B2

公开(公告)日：2013-01-22

申请号：US12896779

申请日：2010-10-01

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F3/0643 ,  G06F3/0601 ,  G06F3/0613 ,  G06F3/064 ,  G06F3/0689 ,  G06F11/1076 ,  G06F17/30067 ,  G06F2003/0691 ,  Y10S707/99943 ,  Y10S707/99953 ,  Y10S707/99956

摘要： Integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The present invention uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The present invention writes on the disk with the lowest CWL pointer. A new disk is chosen only when the algorithm starts allocating space for a new file, or when it has allocated N blocks on the same disk for a single file. A sufficient number of blocks are defined as all the buffers in a chunk of N sequential buffers in a file. The result is that CWL pointers are never more than N blocks apart on different disks, and large files have N consecutive blocks on the same disk.

摘要翻译： 将文件系统与导出RAID子系统中数据块布局的精确信息的RAID阵列集成在一起。 本发明对磁盘阵列中的每个磁盘使用单独的电流写入位置（CWL）指针，其中当发生写入时，指针简单地前进通过磁盘。 本发明在具有最低CWL指针的盘上写入。 只有当算法开始为新文件分配空间时，或者在同一个磁盘上为单个文件分配了N个块时，才选择新的磁盘。 足够数量的块被定义为文件中N个顺序缓冲区块中的所有缓冲区。 结果是CWL指针在不同的磁盘上绝对不超过N个块，大文件在同一个磁盘上有N个连续的块。

公开(公告)号：US20070118812A1

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

申请号：US10564811

申请日：2004-07-14

申请人： Lawrence Kesteloot ,  Paul Rechsteiner ,  Michael Malcolm

发明人： Lawrence Kesteloot ,  Paul Rechsteiner ,  Michael Malcolm

IPC分类号： G06Q99/00 ,  H04N11/20

CPC分类号： G11B27/105 ,  G11B27/034 ,  G11B27/36 ,  G11B2220/2562 ,  G11B2220/41 ,  H04N21/47214 ,  H04N21/858

摘要： The invention provides a method and system capable of displaying media streams in a variety of formats on a screen that is dynamically adjustable to conform to displaying the media format that is the object of the media stream. Specifically, the invention allows the viewable area of a display screen (143) to be dynamically resized using masks (161) and sidebars (163), thus the resulting viewable area is optimized for the media stream. A database (110) includes metadata (113) for media presentations. When a user (190) selects a presentation to view, a server (130) associated with the user (190) queries the database (110) for metadata (113) associated with the presentation. The metadata (113) includes aspect ratio and other information for the presentation and sends a response to the server (130) that includes the metadata (113). A portion of the metadata (113) returned to the server (130) is used by a mask controller (160) to appropriately format the display screen (143) on which the user (190) will view the presentation.

摘要翻译： 本发明提供了一种方法和系统，其能够在屏幕上显示各种格式的媒体流，所述媒体流动态地可调整以符合显示作为媒体流的对象的媒体格式。 具体地，本发明允许使用掩模（161）和侧边栏（163）动态地调整显示屏（143）的可视区域，从而为媒体流优化所得到的可视区域。 数据库（110）包括用于媒体呈现的元数据（113）。 当用户（190）选择呈现来观看时，与用户（190）相关联的服务器（130）向数据库（110）查询与演示相关联的元数据（113）。 元数据（113）包括用于演示的宽高比和其他信息，并且向包括元数据（113）的服务器（130）发送响应。 返回到服务器（130）的元数据（113）的一部分由掩模控制器（160）用于适当地格式化用户（190）将在其上观看呈现的显示屏幕（143）。

公开(公告)号：US07174352B2

公开(公告)日：2007-02-06

申请号：US09854187

申请日：2001-05-10

申请人： Steven R. Kleiman ,  David Hitz ,  Guy Harris ,  Sean W. O'Malley ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： Steven R. Kleiman ,  David Hitz ,  Guy Harris ,  Sean W. O'Malley ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F17/00

CPC分类号： G06F11/1451 ,  G06F11/1435 ,  G06F17/30067 ,  Y10S707/99953 ,  Y10S707/99954

摘要： The invention provides a method and system for duplicating all or part of a file system while maintaining consistent copies of the file system. The file server maintains a set of snapshots, each indicating a set of storage blocks making up a consistent copy of the file system as it was at a known time. Each snapshot can be used for a purpose other than maintaining the coherency of the file system, such as duplicating or transferring a backup copy of the file system to a destination storage medium. In a preferred embodiment, the snapshots can be manipulated to identify sets of storage blocks in the file system for incremental backup or copying, or to provide a file system backup that is both complete and relatively inexpensive. Also in a preferred embodiment, shadow snapshots can be maintained, with a shadow snapshot including a set of member storage blocks that formed a consistent file system other than an active file system, with a set of selected member storage blocks removed from the consistent file system.

摘要翻译： 本发明提供了一种用于在保持文件系统的一致副本的同时复制文件系统的全部或部分的方法和系统。 文件服务器维护一组快照，每个快照指示一组存储块，构成文件系统的一致副本，就像在已知时间一样。 每个快照可以用于维护文件系统的一致性之外的目的，例如将文件系统的备份副本复制或传送到目的地存储介质。 在优选实施例中，可以操纵快照以识别用于增量备份或复制的文件系统中的存储块集合，或提供完整且相对便宜的文件系统备份。 同样在优选实施例中，可以维护影子快照，其中，影子快照包括一组成员存储块，其形成除活动文件系统之外的一致的文件系统，并且从一致的文件系统中移除了一组选定的成员存储块 。

公开(公告)号：US06751637B1

公开(公告)日：2004-06-15

申请号：US09624753

申请日：2000-07-24

申请人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

发明人： David Hitz ,  Michael Malcolm ,  James Lau ,  Byron Rakitzis

IPC分类号： G06F1730

CPC分类号： G06F3/0643 ,  G06F3/0601 ,  G06F3/0613 ,  G06F3/064 ,  G06F3/0689 ,  G06F11/1076 ,  G06F17/30067 ,  G06F2003/0691 ,  Y10S707/99943 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A is a method is disclosed for integrating a file system with a RAID array that exports precise information about the arrangement of data blocks in the RAID subsystem. The file system examines this information and uses it to optimize the location of blocks as they are written to the RAID system. Thus, the system uses explicit knowledge of the underlying RAID disk layout to schedule disk allocation. The method uses separate current-write location (CWL) pointers for each disk in the disk array where the pointers simply advance through the disks as writes occur. The algorithm used has two primary goals. The first goal is to keep the CWL pointers as close together as possible, thereby improving RAID efficiency by writing to multiple blocks in the stripe simultaneously. The second goal is to allocate adjacent blocks in a file on the same disk, thereby improving read back performance. The method satisfies the first goal by always writing on the disk with the lowest CWL pointer. For the second goal, a new disks chosen only when the algorithm starts allocating space for a new file, or when it has allocated N blocks on the same disk for a single file. A sufficient number of blocks is defined as all the buffers in a chunk of N sequential buffers in a file. The result is that CWL pointers are never more than N blocks apart on different disks, and large files have N consecutive blocks on the same disk.

摘要翻译： A公开了一种用于将文件系统与导出关于RAID子系统中的数据块的布置的精确信息的RAID阵列集成的方法。 文件系统检查此信息，并使用它来优化块写入RAID系统时的位置。 因此，系统使用底层RAID磁盘布局的显式知识来计划磁盘分配。 该方法为磁盘阵列中的每个磁盘使用单独的当前写入位置（CWL）指针，其中当发生写入时，指针简单地通过磁盘。 所使用的算法有两个主要目标。 第一个目标是使CWL指针尽可能靠近，从而通过同时写入条带中的多个块来提高RAID效​​率。 第二个目标是将文件中的相邻块分配到同一个磁盘上，从而提高回读性能。 该方法通过始终使用最低CWL指针在磁盘上写入来满足第一个目标。 对于第二个目标，只有当算法开始为新文件分配空间时，或者在同一个磁盘上为单个文件分配了N个块时才选择新的磁盘。 足够数量的块被定义为文件中N个顺序缓冲区块中的所有缓冲区。 结果是CWL指针在不同的磁盘上绝对不超过N个块，大文件在同一个磁盘上有N个连续的块。