会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • In-order delivery of plurality of RDMA messages
    • 按顺序传送多个RDMA消息
    • US07912979B2
    • 2011-03-22
    • US10734037
    • 2003-12-11
    • Giora BiranZorik MachulskyVadim Makhervaks
    • Giora BiranZorik MachulskyVadim Makhervaks
    • G06F15/16
    • H04L67/1097H04L47/193H04L49/90H04L49/9094H04L69/12H04L69/16H04L69/161H04L69/163
    • An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.
    • 执行直接数据放置到特定连接的所有段对齐的存储器的RNIC实现,或者通过重组缓冲区移动数据,其中特定连接的所有段都不对齐。 在不访问重组缓冲区的情况下,直接连接的类型被称为“快速”连接,因为它很可能被对齐,而另一种类型被称为“慢速”连接。 当消费者建立连接时,它指定一个连接类型。 连接类型可以从快速变慢到慢。 本发明减少了内存带宽,延迟,使用TCP重传的错误恢复,并提供了从空接收队列的“优雅恢复”。 在确认段接收之前,实现还可以在Fast连接中的大部分入站DDP段进行CRC校验。
    • 12. 发明申请
    • METHOD OF CONSTRUCTING AN APPROXIMATED DYNAMIC HUFFMAN TABLE FOR USE IN DATA COMPRESSION
    • 构建用于数据压缩的大致动态霍夫曼表的方法
    • US20100253556A1
    • 2010-10-07
    • US12418896
    • 2009-04-06
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • H03M7/40
    • H03M7/40
    • A novel and useful method of constructing a fast approximation of a dynamic Huffman table from a data sample comprising a subset of data to be compressed. The frequency of incidence of each symbol in the sample is calculated, and the symbols are then allocated to predefined bins based on their frequency of incidence. The bins are then transformed into binary sub-trees, where the leaf nodes of the binary sub-trees comprise the symbols of the bin associated with the binary sub-trees. The binary sub-trees are then combined via nesting, thereby creating a coarse grained binary tree, where all leaves are mapped to a specified number of depths. The coarse grained binary tree is then traversed, thereby yielding a canonical code for each symbol, thereby defining the entries for a dynamic Huffman table.
    • 一种从包括要压缩的数据的子集的数据样本构建动态霍夫曼表的快速近似的新颖且有用的方法。 计算样本中每个符号的入射频率,然后根据其入射频率将符号分配给预定义的分组。 然后,将这些分组转换成二进制子树,其中二进制子树的叶节点包括与二进制子树相关联的bin的符号。 然后通过嵌套组合二进制子树,从而创建粗粒度二叉树,其中所有叶被映射到指定数量的深度。 然后遍历粗粒二进制树,从而为每个符号产生规范代码,从而为动态霍夫曼表定义条目。
    • 14. 发明授权
    • Method and apparatus for data decompression in the presence of memory hierarchies
    • 在存在层次结构的情况下进行数据解压缩的方法和装置
    • US07692561B2
    • 2010-04-06
    • US12175214
    • 2008-07-17
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • H03M7/34
    • H03M7/3086
    • A method for decompressing a stream of a compressed data packet includes determining whether first data of a data-dictionary for a first decompression copy operation is located in a history buffer on a remote memory or a local memory, and when it is determined that the first data is located in the remote memory, stalling the first decompression copy operation, performing a second decompression operation using second data that is located in the history buffer on the local memory and fetching the first data from the remote memory to the history buffer on the local memory. The method further includes performing the first decompression operation using the first data in the history buffer on the local memory.
    • 用于对压缩数据分组的流进行解压缩的方法包括:确定用于第一解压缩复制操作的数据字典的第一数据是否位于远程存储器或本地存储器上的历史缓冲器中,以及当确定第一 数据位于远程存储器中,停止第一次解压缩复制操作,使用位于本地存储器上的历史缓冲器中的第二数据执行第二次解压缩操作,并将第一数据从远程存储器读取到本地的历史缓冲区 记忆。 该方法还包括使用本地存储器上的历史缓冲器中的第一数据来执行第一解压缩操作。
    • 15. 发明申请
    • METHOD AND APPARATUS FOR DATA DECOMPRESSION IN THE PRESENCE OF MEMORY HIERARCHIES
    • 存储分层存在的数据分解方法与装置
    • US20100013678A1
    • 2010-01-21
    • US12175214
    • 2008-07-17
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • H03M5/00
    • H03M7/3086
    • A method for decompressing a stream of a compressed data packet includes determining whether first data of a data-dictionary for a first decompression copy operation is located in a history buffer on a remote memory or a local memory, and when it is determined that the first data is located in the remote memory, stalling the first decompression copy operation, performing a second decompression operation using second data that is located in the history buffer on the local memory and fetching the first data from the remote memory to the history buffer on the local memory. The method further includes performing the first decompression operation using the first data in the history buffer on the local memory.
    • 用于对压缩数据分组的流进行解压缩的方法包括:确定用于第一解压缩复制操作的数据字典的第一数据是否位于远程存储器或本地存储器上的历史缓冲器中,以及当确定第一 数据位于远程存储器中,停止第一次解压缩复制操作,使用位于本地存储器上的历史缓冲器中的第二数据执行第二次解压缩操作,并将第一数据从远程存储器读取到本地的历史缓冲区 记忆。 该方法还包括使用本地存储器上的历史缓冲器中的第一数据来执行第一解压缩操作。
    • 17. 发明授权
    • Reducing number of write operations relative to delivery of out-of-order RDMA send messages by managing reference counter
    • 通过管理引用计数器减少相对于无序RDMA发送消息传递的写操作数
    • US07441006B2
    • 2008-10-21
    • US10733594
    • 2003-12-11
    • Giora BiranZorik MachulskyVadim Makhervaks
    • Giora BiranZorik MachulskyVadim Makhervaks
    • G06F13/00
    • G06F13/28H04L29/06H04L67/1097H04L69/329
    • An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.
    • 执行直接数据放置到特定连接的所有段对齐的存储器的RNIC实现,或者通过重组缓冲区移动数据,其中特定连接的所有段都不对齐。 在不访问重组缓冲区的情况下,直接连接的类型被称为“快速”连接,因为它很可能被对齐,而另一种类型被称为“慢速”连接。 当消费者建立连接时,它指定一个连接类型。 连接类型可以从快速变慢到慢。 本发明减少了内存带宽,延迟,使用TCP重传的错误恢复,并提供了从空接收队列的“优雅恢复”。 在确认段接收之前,实现还可以在Fast连接中的大部分入站DDP段进行CRC校验。
    • 18. 发明申请
    • Descriptor Prefetch Mechanism for High Latency and Out of Order DMA Device
    • 高延迟和超出DMA设备的描述符预取机制
    • US20080168259A1
    • 2008-07-10
    • US11621789
    • 2007-01-10
    • Giora BiranLuis E. De la TorreBernard C. DrerupJyoti GuptaRichard Nicholas
    • Giora BiranLuis E. De la TorreBernard C. DrerupJyoti GuptaRichard Nicholas
    • G06F9/30G06F12/14G06F11/00
    • G06F13/28
    • A DMA device prefetches descriptors into a descriptor prefetch buffer. The size of descriptor prefetch buffer holds an appropriate number of descriptors for a given latency environment. To support a linked list of descriptors, the DMA engine prefetches descriptors based on the assumption that they are sequential in memory and discards any descriptors that are found to violate this assumption. The DMA engine seeks to keep the descriptor prefetch buffer full by requesting multiple descriptors per transaction whenever possible. The bus engine fetches these descriptors from system memory and writes them to the prefetch buffer. The DMA engine may also use an aggressive prefetch where the bus engine requests the maximum number of descriptors that the buffer will support whenever there is any space in the descriptor prefetch buffer. The DMA device discards any remaining descriptors that cannot be stored.
    • DMA设备将描述符预取到描述符预取缓冲区中。 描述符预取缓冲区的大小在给定的等待时间环境中保存适当数量的描述符。 为了支持描述符的链表,DMA引擎基于它们在存储器中是连续的假设来预取描述符,并丢弃任何被发现违反这个假设的描述符。 DMA引擎寻求通过每个事务请求多个描述符尽可能地保持描述符预取缓冲区已满。 总线引擎从系统内存中读取这些描述符,并将它们写入预取缓冲区。 DMA引擎还可以使用积极的预取,其中总线引擎请求缓冲区将在描述符预取缓冲器中存在任何空间时将支持的最大数量的描述符。 DMA设备丢弃任何其他不能存储的描述符。
    • 19. 发明授权
    • Data transfer error checking
    • 数据传输错误检查
    • US07383483B2
    • 2008-06-03
    • US10733588
    • 2003-12-11
    • Giora BiranZorik MachulskyVadim Makhervaks
    • Giora BiranZorik MachulskyVadim Makhervaks
    • H03M13/00
    • H03M13/00
    • An RNIC implementation that performs direct data placement to memory where all segments of a particular connection are aligned, or moves data through reassembly buffers where all segments of a particular connection are non-aligned. The type of connection that cuts-through without accessing the reassembly buffers is referred to as a “Fast” connection because it is highly likely to be aligned, while the other type is referred to as a “Slow” connection. When a consumer establishes a connection, it specifies a connection type. The connection type can change from Fast to Slow and back. The invention reduces memory bandwidth, latency, error recovery using TCP retransmit and provides for a “graceful recovery” from an empty receive queue. The implementation also may conduct CRC validation for a majority of inbound DDP segments in the Fast connection before sending a TCP acknowledgement (Ack) confirming segment reception.
    • 执行直接数据放置到特定连接的所有段对齐的存储器的RNIC实现,或者通过重组缓冲区移动数据,其中特定连接的所有段都不对齐。 在不访问重组缓冲区的情况下,直接连接的类型被称为“快速”连接,因为它很可能被对齐,而另一种类型被称为“慢速”连接。 当消费者建立连接时,它指定一个连接类型。 连接类型可以从快速变慢到慢。 本发明减少了内存带宽,延迟,使用TCP重传的错误恢复,并提供了从空接收队列的“优雅恢复”。 在确认段接收之前,实现还可以在Fast连接中的大部分入站DDP段进行CRC校验。