公开(公告)号：US3772654A

公开(公告)日：1973-11-13

申请号：US3772654D

申请日：1971-12-30

Applicant: IBM

Inventor： EVANS J ,  KREWSON N ,  ROOSSIEN J

IPC: H03M7/30 ,  G06F5/00

CPC classification number: H03M7/30

Abstract: Apparatus and method for performing data form modification on information to be stored in a large scale storage system including, defining and storing data form modification routines to be performed; DEFINING AND STORING DATA ELEMENTS WHICH RELATE TO A PARTICULAR CLASS OF INFORMATION TO BE STORED; EXECUTING THE DATA FORM MODIFICATION ROUTINES IN AND UNDER THE CONTROL OF A PROCESSING UNIT WHICH INCLUDES REGISTERS AND COUNTERS ASSOCIATED WITH PARTICULAR DATA FORM MODIFICATION ROUTINES.

Abstract translation: 对要存储在大规模存储系统中的信息执行数据形式修改的装置和方法，包括：定义和存储要执行的数据形式修改例程; 定义和存储与要存储的特定信息类别相关的数据元素; 在处理单元的控制下执行数据形式修改程序，其中包括与特定数据形式修改方案相关的寄存器和计数器。

公开(公告)号：CA931269A

公开(公告)日：1973-07-31

申请号：CA96626

申请日：1970-10-27

Applicant: IBM

Inventor： EVANS J ,  ROOSSIEN J

IPC: G06F3/06 ,  G06F17/30 ,  G11C15/00 ,  G11C15/04

Abstract: 1279056 Data storage INTERNATIONAL BUSINESS MACHINES CORP 2 Nov 1970 [12 Nov 1969] 51955/70 Heading G4C A data searching system compares a record transferred from a random access storage device (e.g. magnetic disc) with search parameters from a stored table which includes start address and field length information, the comparison results being stored, stored indications of predetermined combinations of selected search parameters controlling logic means for performing a series of tests upon the comparison results to determine if the combinations have been satisfied, there being means for transferring to an output a record which satisfies at least one of the combinations. Data transfer between any of a plurality of disc stores and a main store is via a (disc) storage control unit and a CPU in series. In the storage control unit, as a serialby-bit record arrives from the disc it is converted to parallel form in a shift register and inserted in a core buffer, and also supplied serial-by-bit to comparators for comparison with upper and lower limits (see below). The buffer also includes a sequence of three table entries each specifying upper and lower limits between which the value of field of a record or records should lie, the start address of the field in the record, the number of bytes in the field and three logic control bits. As the record arrives from the disc, each table entry in turn is used as follows. The start address is incremented by the address starting at which the record will be stored in the buffer, the result being compared with the address register of the buffer so that on equality a compare latch is set. This enables a counter preset with the " number of bytes " field to be decremented as each byte is stored in the buffer. The compare latch also enables comparison of the field with the upper and lower limits, and if it is between them a result latch respective to the table entry is set. The compare latch is reset when the counter reaches zero (end of field). When all the table entries have been thus used, logic circuitry checks the result latches corresponding to table entries whose first logic control bits are 1 to see if all are set. If so the record is read from the buffer to the main store (via the CPU), but if not similar checking is performed using the second logic control bits, followed by read out or use of the third logic control bits similarly. Transfer in the other direction (main store to disc) is also possible. Extra upper and lower limit comparators may be provided to deal with synonyms.

公开(公告)号：SE343698B

公开(公告)日：1972-03-13

申请号：SE424267

申请日：1967-03-28

Applicant: IBM

Inventor： EVANS J ,  JONES R

IPC: G06F17/30 ,  G11B20/12 ,  G06F7/28

Abstract: 1,114,148. Record retrieval. INTERNATIONAL BUSINESS MACHINES CORPORATION. 6 March, 1967 [28 March, 1966], No. 10383/67. Heading G4C. A position in a storage unit is addressed and a key field of the record in the addressed position is compared with a mask, the comparison being at least partly under control of a field of the record which specifies the length of the key field, a data field of the record being retrieved on equality. A computer selects a bulk storage module (magnetic discs, drums or tapes) using conventional channel controls by supplying its address, the module recognizing the address and sending its address to the computer for a check comparison. The computer selects a read-write head in the storage module and can perform an associative search on the records in the track thus selected, a serial by bit comparison being performed in the module for high, low or equal under control of the computer apprised of the progress of the search by status bytes transmitted from the module. Each record has three portions. The first portion identifies the disc surface, track and access mechanism (associative search may be done on these bytes) and specifies the lengths of the key and data fields. The second and third portions contain the key and data fields respectively. Associative search may be done on either of them. Particular bytes are skipped during this associative search if the bytes supplied by the computer at the corresponding times for comparison are special " skip " characters. Each portion also contains burst check bytes, an accumulating shift register being provided for checking purposes. Parity bits are also mentioned. A decrementable control counter, presettable from the length fields, is used to delineate the various record fields. Communication with the computer is serial by parallel byte, serial to parallel and parallel to serial conversion being performed as necessary. Ring counters are provided for gating purposes. Each track also starts with various identifying indicia.