Accelerated content analytics based on a hierarchical data-flow-graph representation
AssigneeInternational Business Machines Corporation
InventorsKubilay Atasu, Akihiro Nakayama, Raphael Polig, Tong Xu
Life of this patent
Estimating the term…
Abstract
A system and method to hardware-accelerate finite state transducer libraries and their compilation toolchains. In an embodiment, a computer-implemented method for partitioning an UIMA-PEAR file into software-based and hardware-accelerated components may comprise creating a data-flow graph representation of the UIMA-PEAR-file, flattening hierarchies of the data-flow graph representation, and selecting the components to be hardware accelerated from the flattened hierarchies of the data-flow graph representation based on data dependencies of data types produced and consumed by each component of the flattened data-flow graph.
Claims18
A computer-implemented method for partitioning an UIMA-PEAR file into software-based and hardware-accelerated components comprising:
- creating a data-flow graph representation of the UIMA-PEAR-file;
- evaluating the software and hardware complexity of each component of the data-flow graph representation;
- flattening hierarchies of the data-flow graph representation;
- and
- selecting the components to be hardware accelerated from the flattened hierarchies of the data-flow graph representation based on data dependencies of data types produced and consumed by each component of the flattened data-flow graph.
A computer program product for partitioning an UIMA-PEAR file into software-based and hardware-accelerated components, the computer program product comprising a non-transitory computer readable storage having program instructions embodied therewith, the program instructions executable by a computer, to cause the computer to perform a method comprising:
- creating a data-flow graph representation of the UIMA-PEAR-file;
- flattening hierarchies of the data-flow graph representation;
- and
- selecting the components to be hardware accelerated from the flattened hierarchies of the data-flow graph representation based on data dependencies of data types produced and consumed by each component of the flattened data-flow graph.
A system for partitioning an UIMA-PEAR file into software-based and hardware-accelerated components, the system comprising a processor, memory accessible by the processor, and computer program instructions stored in the memory and executable by the processor to perform:
- creating a data-flow graph representation of the UIMA-PEAR-file;
- flattening hierarchies of the data-flow graph representation;
- and
- selecting the components to be hardware accelerated from the flattened hierarchies of the data-flow graph representation based on data dependencies of data types produced and consumed by each component of the flattened data-flow graph.
Dependencies are inferred from the claim text.