[ 
https://issues.apache.org/jira/browse/HADOOP-19012?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=18024525#comment-18024525
 ] 

ASF GitHub Bot commented on HADOOP-19012:
-----------------------------------------

szetszwo opened a new pull request, #8011:
URL: https://github.com/apache/hadoop/pull/8011

   ### Description of PR
   
   HADOOP-19012
   
   (Resubmitting https://github.com/apache/hadoop/pull/6542 )
   
   CrcUtil.galoisFieldMultiply(p, q, m) supports multiplying two polynomials p, 
q modulo any modulus polynomial m over GF(2). Since the method is used for CRC 
calculations, the modulus polynomial m is restricted to either the 
GZIP_POLYNOMIAL or the CASTAGNOLI_POLYNOMIAL. We may use CRC tables in 
PureJavaCrc32/PureJavaCrc32C to speed up the computation.
   
   ### How was this patch tested?
   
   Added new tests.
   
   ### For code changes:
   
   - [X] Does the title or this PR starts with the corresponding JIRA issue id 
(e.g. 'HADOOP-17799. Your PR title ...')?
   - [ ] Object storage: have the integration tests been executed and the 
endpoint declared according to the connector-specific documentation?
   - [ ] If adding new dependencies to the code, are these dependencies 
licensed in a way that is compatible for inclusion under [ASF 
2.0](http://www.apache.org/legal/resolved.html#category-a)?
   - [ ] If applicable, have you updated the `LICENSE`, `LICENSE-binary`, 
`NOTICE-binary` files?
   
   




> Use CRC tables to speed up galoisFieldMultiply in CrcUtil
> ---------------------------------------------------------
>
>                 Key: HADOOP-19012
>                 URL: https://issues.apache.org/jira/browse/HADOOP-19012
>             Project: Hadoop Common
>          Issue Type: Improvement
>          Components: util
>            Reporter: Tsz-wo Sze
>            Assignee: Tsz-wo Sze
>            Priority: Major
>              Labels: pull-request-available
>
> CrcUtil.galoisFieldMultiply(p, q, m) supports multiplying two polynomials p, 
> q modulo any modulus polynomial m over GF(2). Since the method is used for 
> CRC calculations, the modulus polynomial m is restricted to either the 
> GZIP_POLYNOMIAL or the CASTAGNOLI_POLYNOMIAL. We may use CRC tables in 
> PureJavaCrc32/PureJavaCrc32C to speed up the computation.



--
This message was sent by Atlassian Jira
(v8.20.10#820010)

---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to