{"title":"准随机存取存储器系统","authors":"G. L. Hollander","doi":"10.1145/1455533.1455563","DOIUrl":null,"url":null,"abstract":"Synopsis: To select an economical memory for business data-processing systems, the memory characteristics must be matched to the work cycle, processing rate, and permissible delay time of the system. Quasi-random systems feature the low memory cost of serial memories, high processing rates, short delay times, and minimum sorting. An efficient addressing method and rapid cross references reduce the total storage requirements. Typical business examples illustrate the principles.","PeriodicalId":259150,"journal":{"name":"AIEE-IRE '56 (Eastern)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Quasi-random access memory systems\",\"authors\":\"G. L. Hollander\",\"doi\":\"10.1145/1455533.1455563\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Synopsis: To select an economical memory for business data-processing systems, the memory characteristics must be matched to the work cycle, processing rate, and permissible delay time of the system. Quasi-random systems feature the low memory cost of serial memories, high processing rates, short delay times, and minimum sorting. An efficient addressing method and rapid cross references reduce the total storage requirements. Typical business examples illustrate the principles.\",\"PeriodicalId\":259150,\"journal\":{\"name\":\"AIEE-IRE '56 (Eastern)\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1899-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"AIEE-IRE '56 (Eastern)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1455533.1455563\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"AIEE-IRE '56 (Eastern)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1455533.1455563","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Synopsis: To select an economical memory for business data-processing systems, the memory characteristics must be matched to the work cycle, processing rate, and permissible delay time of the system. Quasi-random systems feature the low memory cost of serial memories, high processing rates, short delay times, and minimum sorting. An efficient addressing method and rapid cross references reduce the total storage requirements. Typical business examples illustrate the principles.