IP Library Granted Patent US 10,372,700
Granted Patent B2
US 10,372,700 · App. 14/672,630 · Granted Aug 6, 2019

Data filtering using a plurality of hardware accelerators

Inventors: Sameh W. Asaad (Briarcliff Manor, NY); Robert J. Halstead (Alta Loma, CA); Bharat Sukhwani (Briarcliff Manor, NY)
Assignee: International Business Machines Corporation
G06F16/2365G06F16/24554G06F16/24569
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,372,700
App. No.
14/672,630
Granted
Aug 6, 2019
Kind
B2
Abstract

Techniques are provided for data filtering using hardware accelerators. An apparatus comprises a processor, a memory and a plurality of hardware accelerators. The processor is configured to stream data from the memory to a first one of the hardware accelerators and to receive filtered data from a second one of the hardware accelerators. The plurality of hardware accelerators are configured to filter the streamed data utilizing at least one bit vector partitioned across the plurality of hardware accelerators. The hardware accelerators may be field-programmable gate arrays.

Claims (56)

1. An apparatus comprising:

a processor;

a memory; and

a plurality of hardware accelerators;

wherein the processor is configured to stream data from the memory to a first one of the hardware accelerators and to receive filtered data from a second one of the hardware accelerators;

wherein the plurality of hardware accelerators are configured to filter the streamed data utilizing at least one bit vector partitioned across the plurality of hardware accelerators;

wherein the plurality of hardware accelerators are daisy-chain connected to one another;

wherein each of the plurality of hardware accelerators is configured to perform a build phase and a probe phase;

wherein build phase comprises:

computing one or more hashes of the streamed data; and

updating the at least one bit vector if the computed hashes are within a range of a corresponding partitioned portion of the at least one bit vector; and

wherein the probe phase comprises:

probing the at least one bit vector if the computed hashes are within the range of the corresponding partitioned portion of the at least one bit vector;

generating one or more probed bit values responsive to the probing; and

passing the probed bit values to a next hardware accelerator in the daisy chain; and

wherein the second hardware accelerator comprises a last one of the hardware accelerators in the daisy chain, the second hardware accelerator being configured to utilize the probed bit values passed from the other ones of the plurality of hardware accelerators to determine whether to: (i) pass a given packet in the streamed data to the processor as part of the filtered data; or (ii) drop the given packet.

2. The apparatus of claim 1 , wherein at least one of the hardware accelerators comprises a field-programmable gate array.

3. The apparatus of claim 1 , wherein the plurality of hardware accelerators form a Bloom filter.

4. The apparatus of claim 1 , wherein the streamed data is forwarded between respective ones of the plurality of hardware accelerators.

5. The apparatus of claim 1 , wherein each of the plurality of hardware accelerators is configured to utilize one or more hash functions to compute bit vector indices for its corresponding partitioned portion of the at least one bit vector.

6. The apparatus of claim 1 , wherein a given one of the plurality of hardware accelerators is configured:

to utilize one or more hash functions to compute bit vector indices for the at least one bit vector; and

to forward the bit vector indices for the at least one bit vector to other ones of the plurality of hardware accelerators.

7. An apparatus comprising:

a processor;

a memory; and

a plurality of hardware accelerators;

wherein the processor is configured to stream data from the memory to a first one of the hardware accelerators and to receive filtered data from a second one of the hardware accelerators;

wherein the plurality of hardware accelerators are configured to filter the streamed data utilizing at least one bit vector partitioned across the plurality of hardware accelerators;

wherein the plurality of hardware accelerators are daisy-chain connected to one another; and

wherein each of the plurality of hardware accelerators is configured:

to receive one or more packets each comprising a set of flags and a value, the set of flags comprising a phase flag and two or more match flags; and

to perform one of a build phase and a probe phase responsive to the value of the phase flag;

wherein the second hardware accelerator comprises a last one of the hardware accelerators in the daisy chain, the second hardware accelerator being configured to utilize values of match flags passed from the other ones of the plurality of hardware accelerators to determine whether to: (i) pass a given packet in the streamed data to the processor as part of the filtered data; or (ii) drop the given packet.

8. The apparatus of claim 7 , wherein the build phase comprises programming each of the plurality of hardware accelerators with a corresponding range of said at least one bit vector.

9. The apparatus of claim 8 , wherein the probe phase comprises:

for a first hardware accelerator in the daisy-chain, setting each of the match flags for the given packet to a first value;

for each hardware accelerator in the daisy-chain:

hashing the value of the given packet using two or more hash functions to compute two or more indices, each index corresponding to a respective one of the match flags;

verifying whether each of the two or more indices are within the corresponding range of a current hardware accelerator of the daisy-chain; and

for each index within the corresponding range of the current hardware accelerator, modifying the corresponding match flag to a second value;

for a last hardware accelerator in the daisy-chain:

determining whether each match flag for the given packet is set to the second value;

if each match flag for the given packet is set to the second value, streaming the value of the given packet to the processor as filtered data; and

if one or more match flags for the given packet is set to the first value, dropping the value of the given packet.

10. The apparatus of claim 1 , wherein the plurality of hardware accelerators are configured to filter the streamed data by performing a database join operation.

11. The apparatus of claim 10 , wherein the database join operation comprises a hash join.

12. The apparatus of claim 1 , wherein the plurality of hardware accelerators are configured to filter the streamed data by performing string matching in the streamed data.

13. The apparatus of claim 1 , wherein the plurality of hardware accelerators are configured to filter the streamed data by performing a search of the streamed data.

14. The apparatus of claim 7 , wherein the plurality of hardware accelerators are configured to filter the streamed data by performing a database join operation.

15. The apparatus of claim 7 , wherein the plurality of hardware accelerators are configured to filter the streamed data by performing string matching in the streamed data.

16. The apparatus of claim 7 , wherein the plurality of hardware accelerators are configured to filter the streamed data by performing a search of the streamed data.

17. The apparatus of claim 7 , wherein at least one of the hardware accelerators comprises a field-programmable gate array.

18. The apparatus of claim 7 , wherein the plurality of hardware accelerators form a Bloom filter.

19. The apparatus of claim 7 , wherein the streamed data is forwarded between respective ones of the plurality of hardware accelerators.

20. The apparatus of claim 7 , wherein each of the plurality of hardware accelerators is configured to utilize one or more hash functions to compute bit vector indices for its corresponding partitioned portion of the at least one bit vector.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 30, 2015
From: ASAAD, SAMEH W.; HALSTEAD, ROBERT J.; SUKHWANI, BHARAT
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 035286/0308 →
Continuity (1)
Related Publication 20160292201A1 · Oct 6, 2016
Cited By (1)
US 12,360,778