By Topic

Sorting and searching using ternary CAMs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Sorting and searching are classic problems in computing and several RAM based solutions exist. We present sorting and searching algorithms using TCAMs. Using these algorithms, one can perform sorting in O(n) memory cycles using a TCAM. Furthermore, inserts and deletes to a sorted list and priority queue operations can be done in O(1) cycles. A searching problem may typically involve finding if a query point is contained in a given set of ranges. We call this the point intersection problem. The ranges may be inserted or deleted from the set dynamically. For these problems, we present several algorithms with different time, space and implementation complexity tradeoffs. One of the algorithms uses only O(1) time for all operations and O(1) space for each range in the set when the ranges are disjoint. More precisely, one can perform disjoint range search in one memory cycle using a 2-stage pipeline. We also provide several solutions in scenarios where the ranges in the set are allowed to overlap.

Published in:

High Performance Interconnects, 2002. Proceedings. 10th Symposium on

Date of Conference: