Project: CA-RAM (content-addressable random access memory)

Search (content lookup) is a key operation in many real-world applications including network packet processing and speech recognition. In this research, we aim to design a specialized, search-capable memory architecture that has better performance, power and cost characteristics than existing software- and hardware-only solutions. This project is supported partly by a grant from the NSF.

Selected Publications

• Michel Hanna, Sangyeun Cho, and Rami Melhem, A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries, Proceedings of the IFIP Int'l Conference on Networking (Networking), Valencia, Spain, May 2011. (pdf) (pptx)

• Michel Hanna, Socrates Demetriades, Sangyeun Cho, and Rami Melhem, Advanced Hashing Schemes for Packet Forwarding Using Set Associative Memory Architectures, Journal of Parallel and Distributed Computing (JPDC), 71(1):1~15, January, 2011. (pdf)

• Michel Hanna, Socrates Demetriades, Sangyeun Cho, and Rami Melhem, Progressive Hashing for Packet Processing Using Set-Associative Memory, Proceedings of the ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), Princeton, New Jersey, October 2009. (pdf)

• Michel Hanna, Socrates Demetriades, Sangyeun Cho, and Rami Melhem, CHAP: Enabling Efficient Hardware-based Multiple Hash Schemes for IP Lookup, Proceedings of the IFIP Int'l Conference on Networking (Networking), pp. 756~769, Aachen, Germany, May 2009. (pdf) (pptx)

• Socrates Demetriades, Michel Hanna, Sangyeun Cho, and Rami Melhem, An Efficient Hardware-based Multi-hash Scheme for High Speed IP Lookup, Proceedings of the Annual IEEE Symposium on High-Performance Interconnects (HOTI), pp. 103~110, Stanford, California, August 2008. (pdf)

• Sangyeun Cho, Joel R. Martin, Ruibin Xu, Mohammad H. Hammoud, and Rami Melhem, CA-RAM: A High-Performance Memory Substrate for Search-Intensive Applications, Proceedings of the IEEE Int'l Symposium on Performance Analysis of Systems and Software (ISPASS), pp. 230~241, San Jose, California, April 2007. (pdf) (ppt)

• Sangyeun Cho and Rami Melhem, A Scalable and Reconfigurable Search Memory Substrate for High Throughput Packet Processing, Presented at the IEEE 21st Annual Computer Communications Workshop (CCW), Pittsburgh, Pennsylvania, February 2007. Invited presentation. (ppt)