Date of Award

6-1993

Document Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Department

Department of Electrical and Computer Engineering

First Advisor

Mark A. Mehalic, PhD

Abstract

The dissertation develops a decision criteria to select an associative-memory organization that minimizes the execution time of a mix of associative-search operations and a decision criteria to estimate the layout dimensions of each organization for a specified memory size. The dissertation reclassifies Feng's associative-search operations into three hardware-influenced categories: bit-position independent (BPI), record-content independent (RCI); bit-position dependent (BPD), RCI; and BPD, record-content dependent (RCD). It develops a relationship between the categories and three associative-memory organizations: the CAM, the bit-serial word-parallel associative memory (BSWPAM) , and the extreme-search associative memory (ESAM). A version of the CAM, three versions of the BSWPAM, and a version of the ESAM organizations were designed and simulated to show that for most memory sizes, BPI, RCI operations require less time when executed on a CAM, BPD, RCI operations require less time when executed on a BSWPAM organization, and for many memory sizes, BPD, RCD operations require less time when executed on an ESAM. The dissertation calculates the layout dimensions of each memory. The results indicate the CAM is the most area efficient followed by the single, and two BSWPAM, the ESAM, and the four BSWPAM.

AFIT Designator

AFIT-DS-ENG-93-02

DTIC Accession Number

ADA266438

Download

Share

COinS