会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for archival data storage
    • 归档数据存储的方法和装置
    • US06912645B2
    • 2005-06-28
    • US10198185
    • 2002-07-18
    • Sean Matthew DorwardSean Quinlan
    • Sean Matthew DorwardSean Quinlan
    • G06F11/14G06F12/00G06F17/30
    • G06F17/30073G06F17/30097G06F17/30188Y10S707/99931
    • Data storage techniques particularly well-suited for use in archival data storage are disclosed. In one aspect of the invention, a data block is processed to generate an address as a function of the contents of the data block, and the data block is then stored in the system in a memory location identified by the address. The processing operation is configured to provide write-once archival storage of the data block, in that the contents of the data block are not modifiable without also altering the address of the data block determinable in the processing operation. In an illustrative embodiment, the processing of the data block involves determining a substantially unique identifier of the data block by applying a collision-resistant hash function to the contents of the data block, and the address is subsequently determined from the substantially unique identifier by utilizing the identifier to perform a lookup of the address in an index.
    • 公开了特别适用于存档数据存储的数据存储技术。 在本发明的一个方面,处理数据块以根据数据块的内容生成地址,然后将数据块存储在由该地址标识的存储器位置中的系统中。 处理操作被配置为提供数据块的一次性归档存储,因为数据块的内容不可修改,而不会改变在处理操作中可确定的数据块的地址。 在说明性实施例中,数据块的处理涉及通过对数据块的内容应用抗冲突散列函数来确定数据块的基本上唯一的标识符,并且随后通过利用基本上唯一的标识符来确定地址 用于执行索引中地址查找的标识符。
    • 2. 发明授权
    • Method and apparatus for data compression of network packets employing per-packet hash tables
    • 采用每分组哈希表的网络数据包的数据压缩方法和装置
    • US06236341B1
    • 2001-05-22
    • US09526844
    • 2000-03-16
    • Sean Matthew DorwardSean Quinlan
    • Sean Matthew DorwardSean Quinlan
    • H03M700
    • H03M7/3084
    • A method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios. More particularly, a variable-length coding is used in conjunction with maintaining a separate hash table for each packet. Further, the per-packet hash table indexes particular byte strings in the packet but does not index data in any other packet(s). That is, a respective separate hash table for each packet is employed wherein such hash table is constructed as the particular packet is compressed. As such, the respective hash table is encoded with the particular packet. Employing a per-packet hash table in combination with variable history state inter-packet compression provides for efficient and robust overall compression of the packets.
    • 一种用于压缩能够进行分组间压缩的分组的方法和装置,从而实现更大的鲁棒性和增加的压缩比。 更具体地,可变长度编码与维护每个分组的单独散列表结合使用。 此外,每分组散列表索引分组中的特定字节串,但是不对任何其他分组中的数据进行索引。 也就是说,对于每个分组使用相应的单独的哈希表,其中在特定分组被压缩时构造这样的哈希表。 这样,相应的哈希表用特定分组进行编码。 采用每分组散列表与可变历史状态分组间压缩相结合,提供了分组的有效且鲁棒的整体压缩。
    • 3. 发明授权
    • Method and apparatus for data compression of network packets
    • 网络数据包的数据压缩方法和装置
    • US06388584B1
    • 2002-05-14
    • US09527315
    • 2000-03-16
    • Sean Matthew DorwardSean Quinlan
    • Sean Matthew DorwardSean Quinlan
    • H03M734
    • H03M7/3084
    • A method and apparatus for compressing packets that enables inter-packet compression thereby achieving greater robustness and increased compression ratios without the deleterious effects, e.g., the effect of packet loss multiplying, of prior compression schemes. More particularly, a so-called acknowledgment scheme is employed in conjunction with the specific compression algorithm such that the transmitter, i.e., sender, can limit the history used by the compression algorithm to those packets that are correctly received. In particular, a vector identifying the packets used as the history is included in the compressed packet thereby enabling the receiver to reconstruct the packet history state necessary to decompress the packet. Advantageously, increased robustness and greater compression ratios are achieved independent of any particular one compression scheme.
    • 一种用于压缩能够进行分组间压缩的分组的方法和装置,从而实现更大的鲁棒性和增加的压缩比,而不会产生现有压缩方案的有害影响,例如分组丢失乘法的影响。 更具体地,所谓的确认方案与特定的压缩算法结合使用,使得发送者,即发送者,可以将压缩算法使用的历史限制到正确接收的那些分组。 特别地,识别用作历史的分组的向量被包括在压缩分组中,从而使得接收机能够重建解压缩分组所需的分组历史状态。 有利地,独立于任何特定的一个压缩方案实现了增强的鲁棒性和更大的压缩比。
    • 5. 发明授权
    • Decompression of block-sorted data
    • 块排序数据的解压缩
    • US07254689B1
    • 2007-08-07
    • US10892988
    • 2004-07-15
    • Sean M. DorwardSean QuinlanMichael Burrows
    • Sean M. DorwardSean QuinlanMichael Burrows
    • G06F12/00G06F13/00G06F13/28
    • G06F12/0802G06F2212/401
    • In an embodiment of the present invention, the computational efficiency of decoding of block-sorted compressed data is improved by ensuring that more than one set of operations corresponding to a plurality of paths through a mapping array T are being handled by a processor. This sequence of operations, including instructions from the plurality of sets of operations, ensures that there is another operation in the pipeline if a cache miss on any given lookup operation in the mapping array results in a slower main memory access. In this way, the processor utilization is improved. While the sets of operations in the sequence of operations are independent of another other, there will be an overlap of a plurality of the main memory access operations due to the long time required for main memory access.
    • 在本发明的一个实施例中,通过确保通过映射阵列T的多个路径对应的多于一组的操作正由处理器处理,来提高对块分类压缩数据的解码的计算效率。 包括来自多组操作的指令的操作序列确保如果在映射阵列中的任何给定的查找操作上的高速缓存未命中导致较慢的主存储器访问,则存在流水线中的另一操作。 以这种方式,处理器利用率得到改善。 虽然操作序列中的操作集合独立于另一操作,但是由于主存储器访问所需的长时间,将存在多个主存储器访问操作的重叠。
    • 8. 发明授权
    • System and method for managing access to a resource
    • 管理资源访问的系统和方法
    • US08549104B2
    • 2013-10-01
    • US13487073
    • 2012-06-01
    • Joshua A. RedstoneSean QuinlanMichael Burrows
    • Joshua A. RedstoneSean QuinlanMichael Burrows
    • G06F15/16
    • G06F9/526
    • A server system includes a processor and a data structure having an entry for a resource, the entry including a first sequence number. The server has communication procedures for receiving a request from a client to access the resource, where the request includes a second sequence number obtained from a service, and a resource request handling program. Upon receiving the request, the resource request handling program determines whether the server has any record of having previously received a request to access the resource. If not, the server returns a provisional rejection to the client, requiring the client to verify that it holds a lock on the specified resource. A provisional bit in the entry is initially set to indicate that the resource has not been accessed since the system was last initialized. The provisional bit is reset when a request to access the resource is granted.
    • 服务器系统包括处理器和具有资源条目的数据结构,该条目包括第一序列号。 服务器具有用于从客户端接收请求以访问资源的通信过程,其中请求包括从服务获得的第二序列号和资源请求处理程序。 在接收到请求时,资源请求处理程序确定服务器是否具有先前已经接收到访问资源的请求的记录。 如果没有,则服务器向客户端返回临时拒绝,要求客户端验证它是否对指定的资源进行锁定。 条目中的临时位最初设置为指示自系统上次初始化以来资源尚未被访问。 当授予访问资源的请求时,临时位被复位。