{"title":"A 300 nanosecond search memory","authors":"C. A. Rowland, W. O. Berge","doi":"10.1145/1463822.1463830","DOIUrl":null,"url":null,"abstract":"This paper describes a 24 digit, 128 word, transistorized magnetic thin film search memory with a 300 nanosecond read cycle time. With further improvement such a memory could work with a 100 nanosecond cycle time. A search or associative memory is one in which an input word is compared simultaneously with all stored words; an output is produced on all words that differ from the input word. Variations of this memory permit search between limits by setting up a \"don't care\" condition for some of the stored bits; however, the emphasis in this paper is on the equality search.\n The writing system described is capable of doing a complete rewrite of all 128 words in 13 milliseconds; much faster writing systems are possible. Applications are in sorting, cataloging, information retrieval, translation, and searching.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AFIPS '63 (Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1463822.1463830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
This paper describes a 24 digit, 128 word, transistorized magnetic thin film search memory with a 300 nanosecond read cycle time. With further improvement such a memory could work with a 100 nanosecond cycle time. A search or associative memory is one in which an input word is compared simultaneously with all stored words; an output is produced on all words that differ from the input word. Variations of this memory permit search between limits by setting up a "don't care" condition for some of the stored bits; however, the emphasis in this paper is on the equality search.
The writing system described is capable of doing a complete rewrite of all 128 words in 13 milliseconds; much faster writing systems are possible. Applications are in sorting, cataloging, information retrieval, translation, and searching.