Skip Navigation

The Computer Journal 1996 39(3):241-250; doi:10.1093/comjnl/39.3.241
© 1996 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Parhami, B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Extreme-Value Search and General Selection Algorithms for Fully Parallel Associative Memories

B. Parhami *

Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA

Several useful associative memory algorithms deal with identifying extreme values (maximum or minimum) in a specified field of a selected subset of words. Previously proposed algorithms for such extreme-value searches are bit-sequential in nature, even when implemented on fully parallel associative memories. We show how multiple-bit search capability of a fully parallel associative memory can be used to advantage in reducing the expected search time for finding extreme values. The idea is to search for the all-ones pattern within subfields of the specified search field in lieu of, or prior to, examining bit slices one at a time. Optimal subfield length is determined for both fixed-size and variable-size bit groupings and the corresponding reduction in search time is quantified. The results are extended to rank-based selection where the jth largest or smallest value in a given field of a selected subset of words is to be identified. We conclude that significant reduction in the number of search cycles is possible in most practical extreme-value search and selection problems.

Received May 18, 1993. revised February 26, 1996.

* Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA E-mail: parhami{at}ece.ucsb.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.