Invention Grant
- Patent Title: Plausibility-driven fault detection in string termination logic for fast exact substring match
-
Application No.: US16567356Application Date: 2019-09-11
-
Publication No.: US10996951B2Publication Date: 2021-05-04
- Inventor: Razvan Peter Figuli , Stefan Payer , Petra Leber , Cedric Lichtenau
- Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee Address: US NY Armonk
- Agency: Cantor Colburn LLP
- Agent William Kinnaman
- Main IPC: G06F9/30
- IPC: G06F9/30

Abstract:
A method for detecting faults in substring search operations using a processor unit including vector registers of M vector elements each. A non-limiting example of the method includes providing an M×M matrix of comparators for characterwise comparison of the elements of a reference string and a target string. A first zero detect vector having value indicative of terminating element of the target string and a second zero detect vector having a value indicative of terminating element of the reference string are generated. A resulting bit vector is generated using comparison performed by the M×M matrix. The resulting bit vector indicates characters of the target string that fully match the reference string and indicate characters of the target string that partially match the reference string. Fault detection in the substring search operations is performed by comparing the generated zero detect vectors with operands.
Public/Granted literature
- US20210072989A1 PLAUSABILITY-DRIVEN FAULT DETECTION IN STRING TERMINATION LOGIC FOR FAST EXACT SUBSTRING MATCH Public/Granted day:2021-03-11
Information query