会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Unpacking a variable number of data bits
    • 打开一个可变数量的数据位
    • US08587458B2
    • 2013-11-19
    • US13313833
    • 2011-12-07
    • Bulent AbaliBartholomew BlanerJohn J. Reilly
    • Bulent AbaliBartholomew BlanerJohn J. Reilly
    • H03M7/00
    • H03M7/4031H03M7/6029
    • Unpacking a variable number of data bits is provided. A structure includes an input port operable to receive one or more input data units including a plurality of packed bits of data, each of the one or more input data units including a header and a payload, the header including a predetermined number of bits and identifying a format of the payload and a length of the payload, and the payload including a variable number of bits. The structure further includes a circuit operable to identify and unpack the one or more input data units based on the header and the payload of each of the one or more input data units. The structure further includes an output port operable to transmit one or more output data units including the unpacked one or more input data units, once per clock cycle.
    • 提供了可变数量的数据位开箱。 一种结构包括:输入端口,用于接收一个或多个输入数据单元,所述输入数据单元包括数据的多个压缩位,所述一个或多个输入数据单元中的每一个包括报头和有效载荷,所述报头包括预定数量的位和识别 有效载荷的格式和有效载荷的长度,并且有效载荷包括可变位数。 该结构还包括可操作以基于一个或多个输入数据单元中的每一个的标题和有效载荷来识别和解包一个或多个输入数据单元的电路。 该结构还包括输出端口,其可操作以每时钟周期一次传送包括未封装的一个或多个输入数据单元的一个或多个输出数据单元。
    • 2. 发明授权
    • Hash table using hash table banks
    • 哈希表使用哈希表银行
    • US08775776B2
    • 2014-07-08
    • US13352410
    • 2012-01-18
    • Bulent AbaliJohn J. Reilly
    • Bulent AbaliJohn J. Reilly
    • G06F12/00
    • G06F17/30097
    • A hash table method and structure comprises a processor that receives a plurality of access requests for access to a storage device. The processor performs a plurality of hash processes on the access requests to generate a first number of addresses for each access request. Such addresses are within a full address range. Hash table banks are operatively connected to the processor. The hash table banks form the storage device. Each of the hash table banks has a plurality of input ports. Specifically, each of the hash table banks has less input ports than the first number of addresses for each access request. The processor provides the addresses to the hash table banks, and each of the hash table banks stores pointers corresponding to a different limited range of addresses within the full address range (each of the different limited range of addresses is less than the full address range).
    • 哈希表方法和结构包括接收多个访问存储设备的访问请求的处理器。 处理器对访问请求执行多个哈希处理,以为每个访问请求生成第一数量的地址。 这样的地址在一个完整的地址范围内。 哈希表库可操作地连接到处理器。 哈希表库形成存储设备。 每个散列表组具有多个输入端口。 具体地说,每个哈希表组对于每个访问请求具有比第一数量的地址少的输入端口。 处理器向散列表组提供地址,并且每个散列表存储体存储对应于在完整地址范围内的不同有限范围的地址的指针(每个不同的有限的地址范围小于全地址范围) 。
    • 3. 发明申请
    • HASH TABLE USING HASH TABLE BANKS
    • US20130185537A1
    • 2013-07-18
    • US13352410
    • 2012-01-18
    • Bulent AbaliJohn J. Reilly
    • Bulent AbaliJohn J. Reilly
    • G06F12/08
    • G06F17/30097
    • A hash table method and structure comprises a processor that receives a plurality of access requests for access to a storage device. The processor performs a plurality of hash processes on the access requests to generate a first number of addresses for each access request. Such addresses are within a full address range. Hash table banks are operatively connected to the processor. The hash table banks form the storage device. Each of the hash table banks has a plurality of input ports. Specifically, each of the hash table banks has less input ports than the first number of addresses for each access request. The processor provides the addresses to the hash table banks, and each of the hash table banks stores pointers corresponding to a different limited range of addresses within the full address range (each of the different limited range of addresses is less than the full address range).
    • 哈希表方法和结构包括接收多个访问存储设备的访问请求的处理器。 处理器对访问请求执行多个哈希处理,以为每个访问请求生成第一数量的地址。 这样的地址在一个完整的地址范围内。 哈希表库可操作地连接到处理器。 哈希表库形成存储设备。 每个散列表组具有多个输入端口。 具体地说,每个哈希表组对于每个访问请求具有比第一数量的地址少的输入端口。 处理器向散列表组提供地址,并且每个散列表存储体存储对应于在完整地址范围内的不同有限范围的地址的指针(每个不同的有限的地址范围小于全地址范围) 。
    • 4. 发明授权
    • Translation table and method for compressed data
    • 压缩数据的翻译表和方法
    • US08954683B2
    • 2015-02-10
    • US13587246
    • 2012-08-16
    • Bulent AbaliJames A. MarcellaMichael Mi TsaoSteven M. Wheeler
    • Bulent AbaliJames A. MarcellaMichael Mi TsaoSteven M. Wheeler
    • G06F12/00
    • G06F12/10G06F12/0292G06F2212/1044G06F2212/656
    • A translation table has entries that each include a share bit and a delta bit, with pointers that point to a memory block that includes reuse bits. When two translation table entries reference identical fragments in a memory block, one of the translation table entries is changed to refer to the same memory block referenced in the other translation table entry, which frees up a memory block. The share bit is set to indicate a translation table entry is sharing its memory block with another translation table entry. In addition, a translation table entry may include a private delta in the form of a pointer that references a memory fragment in the memory block that is not shared with other translation table entries. When a translation table has a private delta, its delta bit is set.
    • 转换表具有各自包括共享位和增量位的条目,指针指向包括重用位的存储器块。 当两个转换表条目引用存储器块中的相同片段时,转换表条目中的一个被改变以引用在另一个转换表条目中引用的相同的存储器块,这释放了存储器块。 共享位被设置为指示转换表条目与另一个转换表条目共享其存储器块。 此外,转换表条目可以包括引用存储器块中不与其他转换表条目共享的存储器片段的指针形式的专用增量。 当转换表具有专用增量时,其增量位被设置。
    • 6. 发明申请
    • DATA COMPRESSION USING A NESTED HIERACHY OF FIXED PHRASE LENGTH STATIC AND DYNAMIC DICTIONARIES
    • 数据压缩使用固定长度静态和动态字典的嵌套等级
    • US20110043387A1
    • 2011-02-24
    • US12544726
    • 2009-08-20
    • Bulent AbaliMohammad BanikazemiPeter FranaszekLuis A. LastrasDan E. Poff
    • Bulent AbaliMohammad BanikazemiPeter FranaszekLuis A. LastrasDan E. Poff
    • H03M7/34
    • H03M7/3088
    • The present invention describes lossless data compression/decompression methods and systems. A random access memory (RAM) operates as a static dictionary and includes commonly used strings/symbols/phrases/words. An input buffer operates as a dynamic dictionary and includes input strings/phrases/symbols/words. A set-associative cache memory operates as a hash table, and includes pointers pointing to the commonly used strings/symbols/phrases/words in the static dictionary and/or pointing to one or more of the input strings/phrases/symbols/words in the dynamic dictionary. Alternatively, the set-associative cache memory combines the dynamic dictionary, the static dictionary and the hash table. When encountering a symbol/phrase/string/word in the static or dynamic dictionary in an input stream, a compressor logic or module places a pointer pointing to the symbol/phrase/string/word at a current location on the output stream. The hash table may include phrases/symbols/strings/words and/or pointers pointing to phrases/symbols/strings/words.
    • 本发明描述了无损数据压缩/解压缩方法和系统。 随机访问存储器(RAM)作为静态字典操作,并且包括常用的字符串/符号/短语/单词。 输入缓冲器作为动态字典操作,包括输入字符串/短语/符号/字。 集合关联高速缓冲存储器作为散列表操作,并且包括指向静态字典中常用的字符串/符号/短语/单词的指针和/或指向一个或多个输入字符串/短语/符号/单词中的一个或多个 动态词典。 或者,集合关联高速缓存存储器组合动态字典,静态字典和散列表。 当在输入流中的静态或动态字典中遇到符号/短语/字符串/单词时,压缩器逻辑或模块将指向指向输出流上当前位置的符号/短语/字符串/字的指针放置。 哈希表可以包括短语/符号/字符串/单词和/或指向短语/符号/字符串/单词的指针。
    • 7. 发明申请
    • WEAR REDUCTION METHODS BY USING COMPRESSION/DECOMPRESSION TECHNIQUES WITH FAST RANDOM ACCESS
    • 使用快速随机访问的压缩/解压缩技术减少减少方法
    • US20100302077A1
    • 2010-12-02
    • US12476297
    • 2009-06-02
    • Bulent AbaliMohammad BanikazemiDan E. Poff
    • Bulent AbaliMohammad BanikazemiDan E. Poff
    • H03M7/34G06F12/08G06F12/00
    • H03M7/3084G06F12/0804G06F2212/401
    • The present invention reduces the number of writes to a main memory to increase useful life of the main memory. To reduce the number of writes to the main memory, data to be written is written to a cache line in a lowest-level cache memory and in a higher-level cache memory(s). If the cache line in the lowest-level cache memory is full, the number of used cache lines in the lowest-level cache reaches a threshold, or there is a need for an empty entry in the lowest-level cache, a processor or a hardware unit compresses content of the cache line and stores the compressed content in the main memory. The present invention also provides LZB algorithm allowing decompression of data from an arbitrary location in compressed data stream with a bound on the number of characters which needs to be processed before a character or string of interest is processed.
    • 本发明减少了对主存储器的写入次数,以增加主存储器的使用寿命。 为了减少对主存储器的写入次数,要写入的数据被写入最低级高速缓冲存储器和较高级高速缓冲存储器中的高速缓存行。 如果最低级高速缓存中的高速缓存线已满,则最低级别高速缓存中使用的高速缓存行的数量达到阈值,或者需要在最低级缓存中的空条目,处理器或 硬件单元压缩高速缓存线的内容并将压缩的内容存储在主存储器中。 本发明还提供了LZB算法,其允许在压缩数据流中的任意位置解压缩数据,并且在处理感兴趣的字符串或字符串之前需要处理的字符数量的限制。
    • 8. 发明授权
    • Fanning route generation technique for multi-path networks
    • 多路径网络的漫游路由生成技术
    • US07558248B2
    • 2009-07-07
    • US11353429
    • 2006-02-14
    • Aruna V. RamananBulent Abali
    • Aruna V. RamananBulent Abali
    • H04L12/28
    • H04L45/00H04L45/12H04L45/24
    • A fanning route generation technique is provided for multi-path networks having a shared communications fabric. The technique includes selecting a source node—destination node (S-D) group having common starting and ending sets of links from the network of interconnected nodes. Within this group, selecting the shortest routes between the S-D nodes of the group so that: selected routes substantially uniformly fan out from the source node to a center of the network and fan in from the center of the network to the destination node, thereby achieving local balance; and global balance of routes passing through links that are at a same level of the network is achieved.
    • 为具有共享通信结构的多路径网络提供扇区路由生成技术。 该技术包括从互连节点的网络中选择具有共同起始和结束的链路集合的源节点 - 目的地节点(S-D)组。 在该组内,选择组中SD节点之间的最短路由,使得所选路由从源节点大量均匀地从网络中心扇出到网络中心,并从网络中心到目的节点,从而实现 当地平衡; 实现通过网络同级链路的路由的全局平衡。
    • 10. 发明申请
    • Diagnostic repair system and method for computing systems
    • 诊断修复系统和计算系统的方法
    • US20050235007A1
    • 2005-10-20
    • US10826455
    • 2004-04-16
    • Bulent AbaliRobert Saccone
    • Bulent AbaliRobert Saccone
    • G06F17/30
    • G06F11/1482G06F11/0712G06F11/0748G06F11/079
    • A diagnostic system and method for repairing computing devices comprises a diagnostic application running on a same computing system having a failed operating system (O/S). The diagnostic application is provided with access to the file system of the failed O/S image. The diagnostic software application collects relevant configuration information from the file system of the failed O/S image, and transports this information to a proxy system running the same operating system as the computing device being diagnosed. The proxy system utilizes the collected data to diagnose the subject failed O/S system. Once the proxy makes a determination it synthesizes repair information comprising new or modified files and instructions to be transported back to the diagnostic software system to apply. A network connection is provided between the computer running the diagnostic application and the proxy system that enables data to be easily transported between the two systems without human intervention.
    • 用于修复计算设备的诊断系统和方法包括在具有故障操作系统(O / S)的同一计算系统上运行的诊断应用。 诊断应用程序可以访问失败的O / S映像的文件系统。 诊断软件应用程序从故障O / S映像的文件系统收集相关配置信息,并将该信息传输到运行与被诊断的计算设备相同的操作系统的代理系统。 代理系统利用收集的数据来诊断主体失败的O / S系统。 一旦代理确定,它将包括新的或修改的文件的修复信息和要被运送回诊断软件系统的指令进行合成。 在运行诊断应用的计算机和代理系统之间提供网络连接,使得能够在没有人为干预的情况下在两个系统之间容易地传输数据。