公开(公告)号：US07197602B2

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

申请号：US10812514

申请日：2004-03-30

申请人： Michael Malcolm

发明人： Michael Malcolm

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

CPC分类号： H04L67/2842 ,  H04L67/28

摘要： The invention provides a method and system for operating multiple communicating caches. Between caches, unnecessary transmission of repeated information is substantially reduced. Each cache maintains information to improve the collective operation of the system of multiple communicating caches. This can include information about the likely contents of each other cache, or about the behavior of client devices or server devices coupled to other caches in the system. Pairs of communicating caches substantially compress transmitted information. This includes both reliable compression, in which the receiving cache can reliably identify the compressed information in response to the message, and unreliable compression, in which the receiving cache will sometimes be unable to identify the compressed information. A first cache refrains from unnecessarily transmitting the same information to a second cache when each already has a copy. This includes both maintaining a record at a first cache of information likely to be stored at a second cache, and transmitting a relatively short identifier for that information in place of the information itself. A set of caches are disposed in a directed graph structure, with a set of root caches disposed for coupling to server devices and a set of leaf caches disposed for coupling to client devices. Both root caches and leaf caches maintain non-cacheable objects beyond their initial use, along with digests of the non-cacheable objects. When a server device returns identical information to a root cache, root caches can transmit only associated digests to leaf caches, avoiding re-transmitting the entire non-cacheable object.

摘要翻译： 本发明提供了一种用于操作多个通信高速缓存的方法和系统。 在高速缓存之间，重复信息的不必要的传输显着减少。 每个缓存维护信息以改善多个通信高速缓存系统的集合操作。 这可以包括关于每个其他高速缓存的可能内容的信息，或关于耦合到系统中其他高速缓存的客户端设备或服务器设备的行为。 成对的通信缓存基本上压缩了传输的信息。 这包括可靠的压缩，其中接收缓存可以可靠地识别响应于消息的压缩信息，以及不可靠的压缩，其中接收缓存有时将不能识别压缩信息。 当每个已经具有副本时，第一高速缓存避免不必要地将相同的信息发送到第二缓存。 这包括在可能存储在第二高速缓存处的信息的第一高速缓存上保持记录，以及代替信息本身来发送该信息的相对较短的标识符。 一组缓存被布置在有向图结构中，一组根高速缓存被设置用于耦合到服务器设备和一组叶高速缓存，其被设置用于耦合到客户端设备。 根高速缓存和叶高速缓存都保留超过其初始使用的非可缓存对象，以及不可缓存对象的摘要。 当服务器设备向根高速缓存返回相同的信息时，根高速缓存可以仅将关联的摘要传输到叶高速缓存，避免重新发送整个不可缓存的对象。

公开(公告)号：US20060072786A1

公开(公告)日：2006-04-06

申请号：US11261442

申请日：2005-10-28

申请人： Stephen Watson ,  Daniel Collens ,  Kevin Hui ,  Michael Malcolm

发明人： Stephen Watson ,  Daniel Collens ,  Kevin Hui ,  Michael Malcolm

IPC分类号： G06K9/00

CPC分类号： H04N1/32187 ,  G06T1/0035 ,  H04N1/32165 ,  H04N1/32277 ,  H04N19/467 ,  H04N21/2383 ,  H04N21/23892 ,  H04N21/4348 ,  H04N21/8358 ,  H04N2201/324

摘要： A method of embedding information in digital content representing media streams. The method includes (1) selecting a set of locations within that digital content reprensenting the media stream to embed information, (2) selecting a set of possible alterations to make at those locations, and (3) making a subset of the possible alterations. The set of locations and possible alterations is herein sometimes called a “watermark.” The subset of actual alterations that are made is herein sometimes called a “fingerprint.” The method determines a set of locations at which there are alternative versions of digital content representing the same media stream, such as one being the original and one being an alternative version of the same digital content, herein sometimes called the “original movie” and the “alt-movie,” or herein sometimes called the “original block” and the “alt-block” for a particular block in the digital content representing the media stream.

摘要翻译： 一种在表示媒体流的数字内容中嵌入信息的方法。 该方法包括：（1）选择代替媒体流的数字内容中的一组位置以嵌入信息;（2）选择在这些位置进行的一组可能的改变，以及（3）制作可能的改变的子集。 这里的位置和可能的改变在这里有时被称为“水印”。 所做的实际改变的子集有时称为“指纹”。 该方法确定一组位置，其中存在代表相同媒体流的数字内容的替代版本，例如一个是原始的，一个是相同数字内容的替代版本，在此有时称为“原始电影”，并且 “alt-movie”，或有时称为“原始块”的“alt-block”和表示媒体流的数字内容中的特定块的“alt-block”。

公开(公告)号：US20050201726A1

公开(公告)日：2005-09-15

申请号：US10801091

申请日：2004-03-15

申请人： Michael Malcolm ,  Daniel Collens ,  Stephen Watson

发明人： Michael Malcolm ,  Daniel Collens ,  Stephen Watson

IPC分类号： G11B15/04 ,  G11B19/04 ,  H04N5/76

CPC分类号： G11B20/0021 ,  G06F21/10 ,  G11B20/00086 ,  G11B20/00188 ,  G11B20/00449 ,  G11B20/00869 ,  H04N5/765 ,  H04N5/85 ,  H04N5/913 ,  H04N2005/91342 ,  H04N2005/91364

摘要： A system including: (a) a media reader including a read element for physical media, the physical media including digital content representing at least one media stream, the digital content being maintained in a protected form; (b) a storage element coupled to the media reader, the storage element using a storage mechanism different from the physical media, the storage element non-evanescently storing the digital content in the protected form; and (c) a playback device coupled to the storage element, the playback device receiving the digital content and outputting analog, digital, or analog and digital audiovisual content for presentation. The digital content is stored in the storage element in the protected form, sent from the media reader to the storage element in the protected form, sent from the storage element to the playback device in the protected form, and output by the playback device in a second protected form.

摘要翻译： 一种系统，包括：（a）媒体读取器，其包括用于物理介质的读取元件，所述物理介质包括表示至少一个媒体流的数字内容，所述数字内容被保护为受保护的形式; （b）存储元件，其耦合到所述媒体读取器，所述存储元件使用与所述物理介质不同的存储机构，所述存储元件非易逝地将所述数字内容存储在所述保护形式中; 以及（c）与所述存储元件相连的重放装置，所述重放装置接收所述数字内容并输出用于呈现的模拟，数字或模拟和数字视听内容。 数字内容以受保护形式存储在存储元件中，从媒体读取器发送到以受保护形式从存储元件发送到回放设备的受保护形式的存储元件，并由播放设备输出 第二保护形式。

公开(公告)号：US06892211B2

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

申请号：US10822630

申请日：2004-04-12

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

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

IPC分类号： G06F11/14 ,  G06F17/30 ,  G06F12/00

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

摘要： The present invention provides a method for keeping a file system in a consistent state and for creating read-only copies of a file system. Changes to the file system are tightly controlled. The file system progresses from one self-consistent state to another self-consistent state. The set of self-consistent blocks on disk that is rooted by the root inode is referred to as a consistency point. To implement consistency points, new data is written to unallocated blocks on disk. A new consistency point occurs when the fsinfo block is updated by writing a new root inode for the inode file into it. Thus, as long as the root inode is not updated, the state of the file system represented on disk does not change. The present invention also creates snapshots that are read-only copies of the file system. A snapshot uses no disk space when it is initially created. It is designed so that many different snapshots can be created for the same file system. Unlike prior art file systems that create a clone by duplicating the entire inode file and all of the indirect blocks, the present invention duplicates only the inode that describes the inode file. A multi-bit free-block map file is used to prevent data from being overwritten on disk.

摘要翻译： 本发明提供了一种用于保持文件系统处于一致状态并用于创建文件系统的只读副本的方法。 对文件系统的更改受到严格控制。 文件系统从一个自我一致的状态进展到另一个自我一致的状态。 由根inode根据的磁盘上的一致性块被称为一致性点。 要实现一致性点，新数据将写入磁盘上的未分配块。 当通过为inode文件写入新的根inode来更新fsinfo块时，会发生新的一致性点。 因此，只要root inode不被更新，在磁盘上表示的文件系统的状态就不会改变。 本发明还创建作为文件系统的只读副本的快照。 快照在最初创建时不使用磁盘空间。 它的设计使得可以为同一个文件系统创建许多不同的快照。 与通过复制整个inode文件和所有间接块来创建克隆的现有技术文件系统不同，本发明仅复制描述了inode文件的inode。 多位自由块映射文件用于防止数据在磁盘上被覆盖。

公开(公告)号：US20050050103A1

公开(公告)日：2005-03-03

申请号：US10932330

申请日：2004-08-31

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

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

IPC分类号： G06F17/00 ,  G11B27/10 ,  G11B27/36 ,  H04N20060101

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

摘要： Associating multiple content chunks with multiple DVD packages or media objects; conveniently viewing or resuming these content chunks without knowing their disposition. Associating content chunks with media objects and positions therein, associating requests by a user for play or resumption of play with appropriate behaviors, including a database. Media objects have unique media hash values, to associate content chunks with hash values, and positions within media objects maintained by bookmarks and watchpoints. Selecting a content chunk might cause its metadata to be presented, or might cause selectable content chunks within that content chunk to become selectable. Users requesting play or resumption of play of content chunks, might cause those content chunks, or might cause smaller content chunks, such as movies, to be presented. Content chunks might span more than one media object, or might switch back and forth among multiple media objects, each without the viewer needing to know.

摘要翻译： 将多个内容块与多个DVD包或媒体对象相关联; 方便地查看或恢复这些内容块，而不知道他们的处置。 将内容块与媒体对象和位置相关联，将用户的播放请求或恢复播放与包括数据库的适当行为相关联。 媒体对象具有唯一的媒体散列值，将内容块与散列值相关联，以及通过书签和观察点维护的媒体对象中的位置。 选择内容块可能会导致其元数据被呈现，或者可能导致该内容块内的可选内容块变为可选择。 请求播放或恢复播放内容块的用户可能会导致这些内容块，或者可能会导致较小的内容块（如电影）。 内容块可能跨越多个媒体对象，或者可以在多个媒体对象之间来回切换，每个媒体对象都不需要查看者需要知道。

公开(公告)号：US06480969B1

公开(公告)日：2002-11-12

申请号：US09345246

申请日：1999-06-30

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

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

IPC分类号： H02H305

CPC分类号： G06F11/1076 ,  G06F2211/1059 ,  G06F2211/1061 ,  G11B20/1833

摘要： The present invention is a method for providing error correction for an array of disks using non-volatile random access memory (NV-RAM). Non-volatile RAM is used to increase the speed of RAID recovery from a disk error(s). This is accomplished by keeping a list of all disk blocks for which the parity is possibly inconsistent. Such a list of disk blocks is much smaller than the total number of parity blocks in the RAID subsystem. The total number of parity blocks in the RAID subsystem is typically in the range of hundreds of thousands of parity blocks. Knowledge of the number of parity blocks that are possibly inconsistent makes it possible to fix only those few blocks, identified in the list, in a significantly smaller amount of time than is possible in the prior art. The technique for safely writing to a RAID array with a broken disk is complicated. In this technique, data that can become corrupted is copied into NV-RAM before the potentially corrupting operation is performed.

摘要翻译： 本发明是使用非易失性随机存取存储器（NV-RAM）为磁盘阵列提供纠错的方法。 非易失性RAM用于从磁盘错误中提高RAID恢复的速度。 这是通过保留奇偶校验可能不一致的所有磁盘块的列表来实现的。 这样的磁盘块列表远小于RAID子系统中奇偶校验块的总数。 RAID子系统中奇偶校验块的总数通常在数十万个奇偶校验块的范围内。 对可能不一致的奇偶校验块的数量的了解使得可以以比现有技术中可能的更少的时间量来修复在列表中标识的那些几个块。 安全写入RAID磁盘阵列的技术很复杂。 在这种技术中，可能会损坏的数据在执行潜在的破坏性操作之前被复制到NV-RAM中。

公开(公告)号：US5948110A

公开(公告)日：1999-09-07

申请号：US471218

申请日：1995-06-05

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

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

IPC分类号： G06F12/16 ,  G06F3/06 ,  G06F11/10 ,  G11B20/18 ,  G06F11/00

CPC分类号： G06F11/1076 ,  G11B20/1833 ,  G06F2211/1059 ,  G06F2211/1061

摘要： A method is disclosed for providing error correction for an array of disks using non-volatile random access memory (NV-RAM). Non-volatile RAM is used to increase the speed of RAID recovery from a disk error(s). This is accomplished by keeping a list of all disk blocks for which the parity is possibly inconsistent. Such a list of disk blocks is much smaller than the total number of parity blocks in the RAID subsystem. The total number of parity blocks in the RAID subsystem is typically in the range of hundreds of thousands of parity blocks. Knowledge of the number of parity blocks that are possibly inconsistent makes it possible to fix only those few blocks, identified in the list, in a significantly smaller amount of time than is possible in the prior art. The technique for safely writing to a RAID array with a broken disk is complicated. In this technique, data that can become corrupted is copied into NV-RAM before the potentially corrupting operation is performed.

摘要翻译： 公开了一种使用非易失性随机存取存储器（NV-RAM）为磁盘阵列提供纠错的方法。 非易失性RAM用于从磁盘错误中提高RAID恢复的速度。 这是通过保留奇偶校验可能不一致的所有磁盘块的列表来实现的。 这样的磁盘块列表远小于RAID子系统中奇偶校验块的总数。 RAID子系统中奇偶校验块的总数通常在数十万个奇偶校验块的范围内。 对可能不一致的奇偶校验块的数量的了解使得可以以比现有技术中可能的更少的时间量来修复在列表中标识的那些几个块。 安全写入RAID磁盘阵列的技术很复杂。 在这种技术中，可能会损坏的数据在执行潜在的破坏性操作之前被复制到NV-RAM中。