Author Topic: CAM paper  (Read 470 times)

ranch vermin

  • Not much time left.
  • *******
  • Starship Trooper
  • Posts: 366
  • Not much time.
CAM paper
« on: August 30, 2015, 06:14:34 AM »
This idea is kinda like using the data portion of a pointer as a pointer itself.  And its in use on the internet today to match ip addresses or something,  I cant quite think of it.

http://www.csit-sun.pub.ro/courses/Masterat/Materiale_Suplimentare/CAM2006.pdf
A bit from here, a bit from there, and bring it together and see the whole picture.

ranch vermin

  • Not much time left.
  • *******
  • Starship Trooper
  • Posts: 366
  • Not much time.
Re: CAM paper
« Reply #1 on: August 30, 2015, 08:44:01 AM »
Hot off the theory plate->

Just imagine if you had this many bits of ram in your computer->
(its around a tri-google.)
179769313486231590772930519078900000000000000000000000
000000000000000000000000000000000000000000000000000000
000000000000000000000000000000000000000000000000000000
000000000000000000000000000000000000000000000000000000
000000000000000000000000000000000000000000000000000000
000000000000000000000000000000000000000000000000000000
0000000000000

If you had that many bits, you could look up a 1024 bit word, the data being the address.

And have a really awesome pattern matching memory.   

a) write the virtual address space.
b) its down to the query system being able to produce n close matches with the exact matches, given so many queries in the entry word.

but its a tree based system, and you have to handle word entry into the spacial division,  so it becomes tricky, if you wanted adapting hardware... 
« Last Edit: August 30, 2015, 09:33:58 AM by ranch vermin »
A bit from here, a bit from there, and bring it together and see the whole picture.

 

Welcome

Please login or register.



Login with username, password and session length

Users Online

24 Guests, 0 Users

Most Online Today: 31. Most Online Ever: 208 (August 27, 2008, 08:24:30 AM)

Articles