A. D. Falkoff
Abstract
The underlying logical structure of parallel-search memories is described; the characteristic operation of three major types is displayed in the execution of searches based on equality; and algorithms are presented for searches based on other specifications including maximum, miniTnum, greater than, less than, nearest to, between limits, and ordering (sorting). It is shown that there is a hierarchy of dependency among these algorithms, that they appear in pairs with each member of a pair belonging to one or the other of two distinct classes, and that every type of search can be executed within each class.
- 1 McDERMID, W L., AND PETERSEN, H. E. A magnetic associative memory system. IBM J. Res. Dev. ~ (Jan. 1961), 59.Google Scholar
- 2 SLADE, A. E., AND MCMA~ON, H.O. A cryotron catalog memory system Proc EJCC (Dec. 1956), 115-120.Google Scholar
- 3 IVERSON, I(. E. A Programming Language. Wiley (1962) Google Scholar
- 4 KISEDA, J R, PETERSEN, i. n., SEELBACH, W. C , AND TEI~, M. A magnetic associative memory. IBM d. Res. Dev. 5 (Apr. 1961), 106.Google Scholar
- 5 The incorporation of a plurality counter in each column was communicated to the author by R. I. Roth, IBM Thomas J. Watson Research Center, who has designed a memory to operate according to Program 8.Google Scholar
- 6 SEEBER, R. R., AND LINDqUIST, A B. Associative memory with ordered retrieval. 1BM J. ICes. Dev. 6 (Jan. 1962), 126 This article gives a detaded description of the memory system whose princxple of operation has been summarized in Program 12Google Scholar
Index Terms
- Algorithms for Parallel-Search Memories
Recommendations
Fast Search Algorithms for Associative Memories
A new scheme for constructing search algorithms for bit-parallel associative memories of m n-bit words is described. The resulting equivalence searches, threshold searches, and double-limit searches achieve the time bound of O(log n), compared to O(n), ...
Stochastic Modeling of Branch-and-Bound Algorithms with Best-First Search
Special issue on COMPSAC 1982 and 1983Branch-and-bound algorithms are organized and intelligently structured searches of solutions in a combinatorially large problem space. In this paper, we propose an approximate stochastic model of branch-and-bound algorithms with a best-first search. We ...
Comments