Data Dependent Circuit Design: A Case Study
Data dependent circuits are logic circuits specialized to specific input data. They are smaller and faster than the original circuits, although they are not reusable and require circuit generation for each input instance. This study examines data dependent designs for subgraph isomorphism problems, and shows that a simple algorithm is faster than an elaborate algorithm. An algorithm that requires many hardware resources consumes an accordingly longer circuit generation time, which outweighs the performance advantage in execution.
Unable to display preview. Download preview PDF.
- 3.Ichikawa, S., Udorn, L., Konishi, K.: An FPGA-based implementation of subgraph isomorphism algorithm. IPSJ Trans. High Performance Computing Systems 41(SIG5), 39–49 (2000) (in Japanese)Google Scholar
- 5.Ichikawa, S., Yamamoto, S.: Data dependent circuit for subgraph isomorphism problem. IEICE Trans. Information and Systems E86-D(5), 796–802 (2003)Google Scholar