专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20180089401A1 CALCULATING CONSECUTIVE MATCHES USING PARALLEL COMPUTING 审中-公开
公开(公告)号：US20180089401A1
公开(公告)日：2018-03-29
申请号：US15817271
申请日：2017-11-19
申请人： Fortinet, Inc.
发明人： Juneng Zheng
IPC分类号： G06F21/12 , G06F21/56 , G06F17/30 , G06F7/02 , H04L29/06 , G06F21/55
CPC分类号： G06F21/125 , G06F7/02 , G06F17/30516 , G06F17/30982 , G06F21/552 , G06F21/554 , G06F21/566 , H04L63/1408 , H04L63/1416
摘要： Methods and systems for determining consecutive matches are provided. According to one embodiment, a class definition and a data stream are received by a network security device. The data stream is partitioned into multiple data blocks each containing N data segments. Each data block is processed in parallel to compute: (i) a value (F) indicating whether every data segment value meets the class definition; (ii) a value (L) indicating a number of consecutive data segment values meeting the class definition starting from the left; (iii) a value (M) indicating a maximum number of consecutive data segment values meeting the class definition; and (iv) a value (R) indicating a number of consecutive data segment values meeting the class definition starting from the right. Corresponding values for each data block are then aggregated to determine a maximum number of consecutive data segment values meeting the class definition for the entire data stream.

2. 发明授权

US09912351B1 Methods for accelerating hash-based compression and apparatuses using the same 有权
公开(公告)号：US09912351B1
公开(公告)日：2018-03-06
申请号：US15673649
申请日：2017-08-10
申请人： VIA Alliance Semiconductor Co., Ltd.
发明人： Xiaoyang Li , Zongpu Qi , Zheng Wang , Mengchen Yang , Fangfang Wu , Shican Luo , Lei Meng , Jin Yu , Kuan-Jui Ho , Lin Li
IPC分类号： H03M7/30 , G06F5/06 , G06F9/44 , G06F17/30 , G06F12/1018 , G06F12/02
CPC分类号： H03M7/3084 , G06F5/065 , G06F9/4498 , G06F12/0215 , G06F12/1018 , G06F17/30982 , G06F2212/401 , G06F2212/654 , H03M7/3086 , H03M7/6011 , H03M7/6017 , H03M7/6023
摘要： The invention introduces a method for accelerating hash-based compression, performed in a compression accelerator, comprising: receiving, by a plurality of hash functions, a plurality of substrings from an FSM (Finite-State Machine) in parallel; mapping, by each hash function, the received substring to a hash index and directing a selector to connect to one of a plurality of match paths according to the hash index; transmitting, by a matcher of each connected match path, a no-match message to the FSM when determining that a hash table does not contain the received substring; and transmitting, by the matcher of each connected match path, a match message and a match offset of the hash table to the FSM when determining that the hash table contains the received substring, wherein the match offset corresponds to the received substring.

3. 发明授权

US09911496B2 Associative memory for realizing a k-nearest neighbors algorithm 有权
公开(公告)号：US09911496B2
公开(公告)日：2018-03-06
申请号：US15009699
申请日：2016-01-28
申请人： HIROSHIMA UNIVERSITY
发明人： Hans Juergen Mattausch , Shogo Yamasaki
IPC分类号： G11C15/04 , G06F17/30
CPC分类号： G11C15/04 , G06F17/30982
摘要： A k-nearest neighbors associative memory includes: a clock counting type associative memory that holds R pieces of reference data and outputs, for each of the R pieces of reference data, a match signal that becomes active when a clock count corresponding to a distance between the reference data and given search data has been reached; and a k-nearest neighbors clustering circuit that, every time at least one of the R match signals output from the clock counting type associative memory becomes active, selects a piece of class data, out of R pieces of class data representing classes of the R pieces of reference data, corresponding to each of the at least one active match signal, until k match signals out of the R match signals become active, and determines a class having a largest number of pieces of data when the selected total k pieces of class data are classified.

4. 发明授权

US09891831B2 Dual data storage using an in-memory array and an on-disk page structure 有权
公开(公告)号：US09891831B2
公开(公告)日：2018-02-13
申请号：US14553859
申请日：2014-11-25
申请人： Thomas Legler , David Wein , Ivan Schreter , Mihnea Andrei , Anil Kumar Goel , Guenter Radestock
发明人： Thomas Legler , David Wein , Ivan Schreter , Mihnea Andrei , Anil Kumar Goel , Guenter Radestock
IPC分类号： G06F17/30 , G06F3/06
CPC分类号： G06F3/0605 , G06F3/0653 , G06F3/067 , G06F17/30315 , G06F17/30982
摘要： The subject matter disclosed herein provides methods for the dual storage of data using an in-memory array and an on-disk page structure. An in-memory array holding a column of data can be maintained. One or more pages can be maintained. Each of the one or more pages can have one or more rows for storing the column of data. Random access can be provided to a subset of the one or more rows by at least loading the subset of rows from the one or more pages to the in-memory array without loading all of the rows from the one or more pages. Related apparatus, systems, techniques, and articles are also described.

5. 发明申请

US20180018257A1 SEARCH DEVICE AND SEMICONDUCTOR DEVICE 审中-公开
公开(公告)号：US20180018257A1
公开(公告)日：2018-01-18
申请号：US15590081
申请日：2017-05-09
申请人： Renesas Electronics Corporation
发明人： Takeo MIKI
IPC分类号： G06F12/02 , H03K19/01 , G06F17/30 , H04L12/28 , H03K19/21
CPC分类号： G06F12/0215 , G06F17/30 , G06F17/30982 , H03K19/01 , H03K19/21 , H04L12/28
摘要： To provide a search device with less memory consumption, the search device includes a first associative memory searched with a first search key, a second associative memory searched with a second search key, a concatenated search data generating unit that generates first search information based on hit information including multiple hits in the first associative memory, and a search key generating unit that includes a first key generating unit generating a portion of search data as the first search key and a second search key generating unit generating the first search information and another portion of the search data as the second search key.

6. 发明授权

US09824195B2 Calculating consecutive matches using parallel computing 有权
公开(公告)号：US09824195B2
公开(公告)日：2017-11-21
申请号：US15280384
申请日：2016-09-29
申请人： Fortinet, Inc.
发明人： Juneng Zheng
IPC分类号： G06F21/00 , G06F21/12 , H04L29/06 , G06F17/30 , G06F7/02 , G06F21/55
CPC分类号： G06F21/125 , G06F7/02 , G06F17/30516 , G06F17/30982 , G06F21/552 , G06F21/554 , G06F21/566 , H04L63/1408 , H04L63/1416
摘要： Methods and systems for determining consecutive matches are provided. According to one embodiment, a class definition and a data stream are received by a network security device. The data stream is partitioned into multiple data blocks each containing N data segments. Each data block is processed in parallel to compute: (i) a value (F) indicating whether every data segment value meets the class definition; (ii) a value (L) indicating a number of consecutive data segment values meeting the class definition starting from the left; (iii) a value (M) indicating a maximum number of consecutive data segment values meeting the class definition; and (iv) a value (R) indicating a number of consecutive data segment values meeting the class definition starting from the right. Corresponding values for each data block are then aggregated to determine a maximum number of consecutive data segment values meeting the class definition for the entire data stream.

7. 发明授权

US09740633B2 Updatable address lookup application program interface 有权
公开(公告)号：US09740633B2
公开(公告)日：2017-08-22
申请号：US14591045
申请日：2015-01-07
申请人： International Business Machines Corporation
发明人： Lawrence Y. Chiu , Paul H. Muench , Sangeetha Seshadri
IPC分类号： G06F12/10 , G06F9/54 , G06F17/30 , G06F12/1027
CPC分类号： G06F12/1027 , G06F9/54 , G06F17/30 , G06F17/30952 , G06F17/30982 , G06F2212/651 , G06F2212/657
摘要： Embodiments relate to a new application program interface (API) and supporting tools to introduce efficiency associated with a transaction. An in-memory translation table maintains accurate address locations of key-value pair locations. The new API employs the translation table to obtain both the requested data and any updated address associated with the requested data. Any subsequent API may be communicated with the updated address.

8. 发明申请

US20170068697A1 MANAGING DATA RECORDS 有权
公开(公告)号：US20170068697A1
公开(公告)日：2017-03-09
申请号：US15363373
申请日：2016-11-29
申请人： International Business Machines Corporation
发明人： Min Fang , Di Jin , Zhen Yu Shi , Nigel G. Slinger , Shu Wang , Li Fei Zheng , Wen Jie Zhu
IPC分类号： G06F17/30 , H03M7/30
CPC分类号： G06F17/30339 , G06F17/30371 , G06F17/30595 , G06F17/30982 , H03M7/3084 , H03M7/60 , H03M7/6058
摘要： Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.

9. 发明申请

US20160315633A1 MANAGING DATA RECORDS 有权
标题翻译：管理数据记录
公开(公告)号：US20160315633A1
公开(公告)日：2016-10-27
申请号：US15139477
申请日：2016-04-27
申请人： International Business Machines Corporation
发明人： Min Fang , Di Jin , Zhen Yu Shi , Nigel G. Slinger , Shu Wang , Li Fei Zheng , Wen Jie Zhu
IPC分类号： H03M7/30 , G06F17/30
CPC分类号： G06F17/30339 , G06F17/30371 , G06F17/30595 , G06F17/30982 , H03M7/3084 , H03M7/60 , H03M7/6058
摘要： Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.
摘要翻译：数据记录可以通过监视关系数据库中的一个内存中的第一个数据记录的记录长度，页面中的可用空间量以及页面长度来管理。响应于接收到用第二数据记录替换第一数据记录的操作员命令，数据库管理系统可以确定压缩的第二数据记录的估计记录长度是否在页面中的可用空间量之外。响应于确定压缩的第二数据记录的估计记录长度超出页面中的可用空间量，数据库管理系统可以确定压缩页面的估计长度是否在页面长度之外。响应于确定压缩页面的估计长度在页面长度内，可以压缩该页面。

10. 发明申请

US20160285895A1 CALCULATING CONSECUTIVE MATCHES USING PARALLEL COMPUTING 有权
公开(公告)号：US20160285895A1
公开(公告)日：2016-09-29
申请号：US14665744
申请日：2015-03-23
申请人： Fortinet, Inc.
发明人： Juneng Zheng
IPC分类号： H04L29/06
CPC分类号： G06F21/125 , G06F7/02 , G06F17/30516 , G06F17/30982 , G06F21/552 , G06F21/554 , G06F21/566 , H04L63/1408 , H04L63/1416
摘要： Methods and systems for determining consecutive matches are provided. According to one embodiment, a class definition and a data stream are received by a network security device. The data stream is partitioned into multiple data blocks each containing N data segments. Each data block is processed in parallel to compute: (i) a value (F) indicating whether every data segment value meets the class definition; (ii) a value (L) indicating a number of consecutive data segment values meeting the class definition starting from the left; (iii) a value (M) indicating a maximum number of consecutive data segment values meeting the class definition; and (iv) a value (R) indicating a number of consecutive data segment values meeting the class definition starting from the right. Corresponding values for each data block are then aggregated to determine a maximum number of consecutive data segment values meeting the class definition for the entire data stream.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式