Issue No. 03 - March (2006 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.39
Fayez Gebali , IEEE Computer Society
<p><b>Abstract</b>—This paper presents a systematic technique for expressing a string search algorithm as a regular iterative expression to explore all possible processor arrays for deep packet classification. The computation domain of the algorithm is obtained and three affine scheduling functions are presented. The technique allows some of the algorithm variables to be pipelined while others are broadcast over system-wide buses. Nine possible processor array structures are obtained and analyzed in terms of speed, area, power, and I/O timing requirements. Time complexities are derived analytically and through extensive numerical simulations. The proposed designs exhibit optimum speed and area complexities. The processor arrays are compared with previously derived processor arrays for the string matching problem.</p>
Processor array, string search, deep packet classification, parallel hardware.
F. Gebali and A. E. Rafiq, "Processor Array Architectures for Deep Packet Classification," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 241-252, 2006.