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

1. 发明授权

US10419022B2 Run-length base-delta encoding for high-speed compression 有权
公开(公告)号：US10419022B2
公开(公告)日：2019-09-17
申请号：US15828385
申请日：2017-11-30
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Jose N. Amaral , Christopher M. Barton , Taylor J. Lloyd , Ettore Tiotto
IPC分类号： H03M7/34 , H03M7/48 , H03M7/30
摘要： A method, computer system, and a computer program product for high-speed data compression is provided. The present invention may include receiving an input stream. The present invention may include selecting a header based on the received input stream, wherein the header includes a base, a scheme and a delta count. The present invention may include determining whether there are any remaining values in an uncompressed input stream. The present invention may include reading a first next value from the input stream. The present invention may include determining whether the read first next value is representable with a current base scheme. The present invention may include calculating the delta count based on determining that the read first next value is representable with the current base scheme. The present invention may include writing the calculated delta count to the selected header. The present invention may include incrementing the written delta count.

2. 发明授权

US11070230B2 Run-length base-delta encoding for high-speed compression 有权
公开(公告)号：US11070230B2
公开(公告)日：2021-07-20
申请号：US16521627
申请日：2019-07-25
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Jose N. Amaral , Christopher M. Barton , Taylor J. Lloyd , Ettore Tiotto
IPC分类号： H03M7/00 , H03M7/48 , H03M7/30 , H03M7/46
摘要： A method, computer system, and a computer program product for high-speed data compression is provided. The present invention may include receiving an input stream. The present invention may include selecting a header based on the received input stream, wherein the header includes a base, a scheme and a delta count. The present invention may include determining whether there are any remaining values in an uncompressed input stream. The present invention may include reading a first next value from the input stream. The present invention may include determining whether the read first next value is representable with a current base scheme. The present invention may include calculating the delta count based on determining that the read first next value is representable with the current base scheme. The present invention may include writing the calculated delta count to the selected header. The present invention may include incrementing the written delta count.

3. 发明申请

US20190165804A1 RUN-LENGTH BASE-DELTA ENCODING FOR HIGH-SPEED COMPRESSION 审中-公开
公开(公告)号：US20190165804A1
公开(公告)日：2019-05-30
申请号：US15828385
申请日：2017-11-30
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Jose N. Amaral , Christopher M. Barton , Taylor J. Lloyd , Ettore Tiotto
IPC分类号： H03M7/48 , H03M7/30
CPC分类号： H03M7/48 , H03M7/46 , H03M7/6029
摘要： A method, computer system, and a computer program product for high-speed data compression is provided. The present invention may include receiving an input stream. The present invention may include selecting a header based on the received input stream, wherein the header includes a base, a scheme and a delta count. The present invention may include determining whether there are any remaining values in an uncompressed input stream. The present invention may include reading a first next value from the input stream. The present invention may include determining whether the read first next value is representable with a current base scheme. The present invention may include calculating the delta count based on determining that the read first next value is representable with the current base scheme. The present invention may include writing the calculated delta count to the selected header. The present invention may include incrementing the written delta count.

4. 发明申请

US20150317141A1 EXTENDING SUPERWORD LEVEL PARALLELISM 有权
标题翻译：扩展超级水平并行
公开(公告)号：US20150317141A1
公开(公告)日：2015-11-05
申请号：US14623920
申请日：2015-02-17
申请人： International Business Machines Corporation
发明人： Ehsan Amiri , Christopher M. Barton , Yaoqing Gao , Denis M. Palmeiro , Raul E. Silvera
IPC分类号： G06F9/45
CPC分类号： G06F8/456 , G06F8/443 , G06F8/445 , G06F8/45 , G06F9/30036
摘要： A computer identifies one or more pairs of scalar statements and performs a cost analysis of operations of each of the one or more pairs of scalar statements to determine both a benefit and a cost of operations. The computer determines, based, at least in part, on the cost analysis, a gain for each of the one or more pairs of scalar statements. The computer creates based, at least in part, on the gain, a sorted list of each of the one or more pairs of scalar statements and selects a first pair from the sorted list. The computer issues a query to a hash table using a statement of the first pair and selects from results received from the query, a second pair. The computer then extends, based, at least in part, on the second pair, the first pair to create a pack.
摘要翻译：计算机识别一个或多个标量语句对，并且对一个或多个标量语句对中的每一个执行操作的成本分析以确定操作的益处和成本。计算机至少部分地基于成本分析确定一对或多对标量语句中的每一对的增益。计算机至少部分地基于增益创建一个或多个标量语句对中的每一个的排序列表，并且从排序列表中选择第一对。计算机使用第一对的语句向哈希表发出查询，并从查询接收到的结果中选择第二对。然后，计算机至少部分地基于第二对，第一对来扩展，以创建一个包。

5. 发明申请

US20150067268A1 OPTIMIZING MEMORY BANDWIDTH CONSUMPTION USING DATA SPLITTING WITH SOFTWARE CACHING 有权
公开(公告)号：US20150067268A1
公开(公告)日：2015-03-05
申请号：US14304220
申请日：2014-06-13
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Christopher M. Barton , Shimin Cui , Satish K. Sadasivam , Raul E. Silvera , Madhavi G. Valluri , Steven W. White
IPC分类号： G06F12/08
CPC分类号： G06F12/0837 , G06F8/41 , G06F8/4442 , G06F12/0875 , G06F2212/1044
摘要： A computer processor collects information for a dominant data access loop and reference code patterns based on data reference pattern analysis, and for pointer aliasing and data shape based on pointer escape analysis. The computer processor selects a candidate array for data splitting wherein the candidate array is referenced by a dominant data access loop. The computer processor determines a data splitting mode by which to split the data of the candidate array, based on the reference code patterns, the pointer aliasing, and the data shape information, and splits the data into two or more split arrays. The computer processor creates a software cache that includes a portion of the data of the two or more split arrays in a transposed format, and maintains the portion of the transposed data within the software cache and consults the software cache during an access of the split arrays.

6. 发明申请

US20150317137A1 EXTENDING SUPERWORD LEVEL PARALLELISM 有权
公开(公告)号：US20150317137A1
公开(公告)日：2015-11-05
申请号：US14267268
申请日：2014-05-01
申请人： International Business Machines Corporation
发明人： Ehsan Amiri , Christopher M. Barton , Yaoqing Gao , Denis M. Palmeiro , Raul E. Silvera
IPC分类号： G06F9/45
CPC分类号： G06F8/456 , G06F8/443 , G06F8/445 , G06F8/45 , G06F9/30036
摘要： A computer identifies one or more pairs of scalar statements and performs a cost analysis of operations of each of the one or more pairs of scalar statements to determine both a benefit and a cost of operations. The computer determines, based, at least in part, on the cost analysis, a gain for each of the one or more pairs of scalar statements. The computer creates based, at least in part, on the gain, a sorted list of each of the one or more pairs of scalar statements and selects a first pair from the sorted list. The computer issues a query to a hash table using a statement of the first pair and selects from results received from the query, a second pair. The computer then extends, based, at least in part, on the second pair, the first pair to create a pack.

7. 发明申请

US20150178056A1 GENERATING SIMD CODE FROM CODE STATEMENTS THAT INCLUDE NON-ISOMORPHIC CODE STATEMENTS 有权
公开(公告)号：US20150178056A1
公开(公告)日：2015-06-25
申请号：US14138424
申请日：2013-12-23
申请人： International Business Machines Corporation
发明人： Ehsan Amiri , Christopher M. Barton , Denis M. Palmeiro , Raul Silvera
IPC分类号： G06F9/45
CPC分类号： G06F8/443
摘要： Generating SIMD code from code statements that include non-isomorphic code statements. Code statements are received, each code statement has one or more operators in a respective operator order and each operator has a type and associated operands. At least two code statements among the code statements received have an operator of the same type in a different operator order position. A first operator order position is identified for the operators of the same type in each of the code statements. For each of the code statements, code is generated for operators and their associated operands having operator order positions preceding the first operator order positions. SIMD code is generated at least based on the identified first operator order positions, the corresponding operator type, and the operands associated with the operator type at the identified operator order positions.

8. 发明授权

US09632762B2 Extending superword level parallelism 有权
公开(公告)号：US09632762B2
公开(公告)日：2017-04-25
申请号：US14623920
申请日：2015-02-17
申请人： International Business Machines Corporation
发明人： Ehsan Amiri , Christopher M. Barton , Yaoqing Gao , Denis M. Palmeiro , Raul E. Silvera
IPC分类号： G06F9/45 , G06F9/30
CPC分类号： G06F8/456 , G06F8/443 , G06F8/445 , G06F8/45 , G06F9/30036
摘要： A computer identifies one or more pairs of scalar statements and performs a cost analysis of operations of each of the one or more pairs of scalar statements to determine both a benefit and a cost of operations. The computer determines, based, at least in part, on the cost analysis, a gain for each of the one or more pairs of scalar statements. The computer creates based, at least in part, on the gain, a sorted list of each of the one or more pairs of scalar statements and selects a first pair from the sorted list. The computer issues a query to a hash table using a statement of the first pair and selects from results received from the query, a second pair. The computer then extends, based, at least in part, on the second pair, the first pair to create a pack.

9. 发明授权

US09557977B2 Extending superword level parallelism 有权
标题翻译：扩展词水平并行度
公开(公告)号：US09557977B2
公开(公告)日：2017-01-31
申请号：US14267268
申请日：2014-05-01
申请人： International Business Machines Corporation
发明人： Ehsan Amiri , Christopher M. Barton , Yaoqing Gao , Denis M. Palmeiro , Raul E. Silvera
IPC分类号： G06F9/45 , G06F9/30
CPC分类号： G06F8/456 , G06F8/443 , G06F8/445 , G06F8/45 , G06F9/30036
摘要： A computer identifies one or more pairs of scalar statements and performs a cost analysis of operations of each of the one or more pairs of scalar statements to determine both a benefit and a cost of operations. The computer determines, based, at least in part, on the cost analysis, a gain for each of the one or more pairs of scalar statements. The computer creates based, at least in part, on the gain, a sorted list of each of the one or more pairs of scalar statements and selects a first pair from the sorted list. The computer issues a query to a hash table using a statement of the first pair and selects from results received from the query, a second pair. The computer then extends, based, at least in part, on the second pair, the first pair to create a pack.
摘要翻译：计算机识别一个或多个标量语句对，并且对一个或多个标量语句对中的每一个执行操作的成本分析以确定操作的益处和成本。计算机至少部分地基于成本分析确定一对或多对标量语句中的每一对的增益。计算机至少部分地基于增益创建一个或多个标量语句对中的每一个的排序列表，并从排序列表中选择第一对。计算机使用第一对的语句向哈希表发出查询，并从查询接收到的结果中选择第二对。然后，计算机至少部分地基于第二对，第一对来扩展，以创建一个包。

10. 发明授权

US09542169B2 Generating SIMD code from code statements that include non-isomorphic code statements 有权
标题翻译：从包含非同构代码语句的代码语句生成SIMD代码
公开(公告)号：US09542169B2
公开(公告)日：2017-01-10
申请号：US14818567
申请日：2015-08-05
申请人： International Business Machines Corporation
发明人： Ehsan Amiri , Christopher M. Barton , Denis M. Palmeiro , Raul Silvera
IPC分类号： G06F9/45 , G06F17/30
CPC分类号： G06F8/443
摘要： Generating SIMD code from code statements that include non-isomorphic code statements. Code statements are received, each code statement has one or more operators in a respective operator order and each operator has a type and associated operands. At least two code statements among the code statements received have an operator of the same type in a different operator order position. A first operator order position is identified for the operators of the same type in each of the code statements. For each of the code statements, code is generated for operators and their associated operands having operator order positions preceding the first operator order positions. SIMD code is generated at least based on the identified first operator order positions, the corresponding operator type, and the operands associated with the operator type at the identified operator order positions.
摘要翻译：从包含非同构代码语句的代码语句生成SIMD代码。接收到代码语句，每个代码语句在相应的运算符顺序中具有一个或多个运算符，并且每个运算符具有类型和相关联的运算符。所接收的代码语句中至少有两个代码语句在不同的操作员顺序位置具有相同类型的运算符。为每个代码语句中的相同类型的运算符标识第一个操作员订单位置。对于每个代码语句，为操作员及其相关操作数生成代码，其操作员顺序位置位于第一操作员顺序位置之前。至少基于所识别的第一操作员订单位置，相应的操作者类型以及与所识别的操作员订单位置处的操作者类型相关联的操作数，生成SIMD代码。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式