A Novel Associative Memory Architecturefor Quick Matching Frank Wang, Na Helian and Farhi Marir School of lnformatics and Multimedia Technology University of North London 166-220 Holloway Road, London N7 8DB, United Kingdom Tel: +44 20 7753 3142, Fax: +44 20 7753 7009 E-mail: f.wang@unl.ac, uk Many data processing applications, like databases, data warehouses, data mining, OLAP (On-Line Analytical Processing), require the search of items in a table stored in memory. The time required to find an item stored in memory cab be reduced considerably if stored data can be identified for access by the content of the data itself rather than by an address. A memory unit accessed by content rather than location is called an associative memory or content addressable memory (CAM). This type of memory is accessed simultaneously and in parallel on the basis of data content rather than by specific address or location. When a word is to be read from an associative memory, the content of the word or the database record, or part of the word or the database record, is specified. The memory locates all words or database records that match the specified content and marks them for reading. Because of its
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-novel-associative-memory-architecture-for-quick-matching-o30nBu1gsc
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A novel associative memory architecture for quick matching
Wang, Frank; Helian, Na; Marir, Farhi
Follow ACM SIGARCH Computer Architecture News
, Volume 30 (3)
Association for Computing Machinery – Jun 1, 2002
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
