Sorting and Searching using Ternary CAMs

Sorting and searching are classic problems in computing. Although several RAM-based solutions exist, algorithms using ternary content-addressable memories offer performance benefits. Using these algorithms, a TCAM can sort in O(N) memory cycles.

[1]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[2]  Devavrat Shah,et al.  Fast Updating Algorithms for TCAMs , 2001, IEEE Micro.

[3]  Anja Feldmann,et al.  Tradeoffs for packet classification , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Dan E. Willard.  Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N) , 1983, Inf. Process. Lett..

[5]  George Varghese,et al.  Fast and scalable layer four switching , 1998, SIGCOMM '98.

[6]  David Eppstein,et al.  Internet packet filter management and rectangle geometry , 2000, SODA '01.

[7]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[8]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[9]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .