United States Patent: 3593299

[US Patent & Trademark Office, Patent Full Text and Image Database]

( 1777 of 1777 )

United States Patent	3,593,299
Driscoll , et al.	July 13, 1971

INPUT-OUTPUT CONTROL SYSTEM FOR DATA PROCESSING APPARATUS

Abstract

An input-output system which is effectively a satellite computer that performs normal input-output functions for other data processing apparatus components, i.e., the central processing unit and peripheral input and output devices; that exercises supervisory control over the aforesaid apparatus components such as by arranging processing task queues and allocating storage space; that buffers transmissions between remote terminals and devices and the central computing units; and that controls periodic diagnostic analyses of the entire data processing apparatus.

Inventors:	Driscoll; Graham C. (Yorktown Heights, NY), Sussenguth; Edward H. (Los Altos, CA)
Assignee:	International Business Machine Corporation (Armonk, NY)
Appl. No.:	04/653,499
Filed:	July 14, 1967

Current U.S. Class: 710/46

Current International Class: G06F 13/12 (20060101); G06f 015/00 ()

Field of Search: 340/172.5 235/157

References Cited [Referenced By]

U.S. Patent Documents


3283308	November 1966	Klein et al.
3344410	October 1967	Collins et al.
3406380	October 1968	Bradley et al.
3061192	October 1962	Terzian
3245045	April 1966	Randlev
3266023	August 1966	Werme
3462741	August 1969	Bush et al.

Primary Examiner: Henon; Paul J.
Assistant Examiner: Springborn; Harvey E.

Claims

What we claim is:

1. An input-output control apparatus for a data processing system wherein said system includes a central processor, central processor storage, bulk storage, and a plurality of input-output devices comprising:

a plurality of first units for controlling transmission of data between said central processor and said input-output devices, said first units being provided in an array to constitute respective pluralities of rows and columns of first units;

a plurality of second units for controlling each of said rows and columns of said first units respectively, said second units including;

means for initiating first unit sequences, said sequences being for input-output device selection, command, data transmission, and ending,

means for storing data in said processor storage and bulk storage,

means for fetching data from said processor storage and said bulk storage,

means for controlling record search operations including means for updating addresses, means for updating counts, means for generating parity checks, means for generating redundancy checks, means for verifying parity checks, and means for verifying redundancy checks; and scanning means for causing said second units to continually scan said first units respectively controlled by them to ascertain those of said first units which require service.

2. An input-output control system as defined in claim 1 wherein there is further included means to control said scanning means, said last-named control means comprising:

an a control component for determining whether a particular first unit requires service;

a u control component for determining whether said particular first unit urgently requires service; and

a p control component for determining whether the second units controlling said particular first unit are permitted to service said particular first unit.

3. An input-output control system as defined in claim 2 and further including tie-breaking means responsive to the attempt of more than one second unit to concurrently control a first unit, to thereby prevent the controlling of a first unit by more than one second unit.

4. An input-output control system as defined in claim 2 wherein there is further included means associated with said p control component to limit the scan of a second unit to those first units controlled by said second unit.

Description

BACKGROUND OF INVENTION

This invention relates to an input-output control system which effects the expeditious input into and output from the central processing units of data processing apparatus of information to be processed, and of the resulting processed information respectively.

With the progressively increasing size, complexity and speed of operation of data processing apparatus, to insure that such apparatus is availed of in a most efficient manner, multiprogramming and time sharing techniques have been utilized. To enable optimization in the use of such techniques, the control of input to and output from such apparatus has become commensurately increasingly complex. Thus, for example, general purpose data processing apparatus may be called upon to handle a variety of time-shared programs for concurrent execution for many diverse types of input-output devices such as magnetic tapes and drums, high speed printers, display units, punched card translators, etc. and different pluralities of each type of such input-output devices whereby it is enabled to fulfill many different requirements.

Accordingly, it is an important object of this invention to provide for use in data processing apparatus which may include a plurality of central processing units and a multiplicity of different types of input-output devices, an input-output control system which exercises supervisory and monitoring control over the routing of information and data streams between the central processing units and the peripheral input-output devices of the apparatus.

It is another object to provide an input-output system which is capable of the setting of access priorities of peripheral input-output devices to a central processing unit in data processing apparatus, the scheduling of information processing tasks, the allocation of memory space, and the performing of all normal input-output functions for programs being currently and concurrently executed.

It is still another object to provide an input-output system in accordance with the preceding objects which is capable of the buffering of transmissions between the central processing unit and peripheral devices and remote terminals.

It is a further object to provide an input-output system in accordance with the preceding objects which also serves as a dynamic diagnostic control by continuously monitoring fault-locating circuitry and by periodically scheduling diagnostic programs for the other components of the apparatus.

SUMMARY OF THE INVENTION

In accordance with the invention, there is provided in a data processing system comprising central processing means, a plurality of storage means, and a plurality of input-output devices, an input-output control system. The system comprises an input-output control arrangement which controls data transmissions between the storage devices and the input-output devices and the selection of input-output devices for communication with the storage devices. The system further includes a supervisory control arrangement which is operative to effect the scheduling, preparing and queuing of jobs for the central processing means and assignment of storage and input-output devices to each job.

There is further included in the system, a remote terminal control arrangement for directing the transmission of data to and from remote terminals.

The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular description of a preferred embodiment of the invention, as illustrated in the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

In the drawings:

FIG. 1 is a block diagram of a data processing system wherein there is shown the relationship of the input-output control system of the invention to the other components;

FIG. 2 is a block diagram of the input-output system in some detail;

FIG. 2A is a table which sets forth the interrelated operations of the input-output control system and the storage devices in the data processing system;

FIG. 3 is a block diagram which conceptually depicts the interrelationship of the A and B units of the input-output control stage of the input-output control system;

FIGS. 4A--4F, taken together as in FIG. 4, is a block diagram of an illustrative embodiment of an arrangement for effecting a "processor seek" operation according to the invention;

FIG. 5 is a block diagram of an arrangement suitable for use in determining the busy or nonbusy states of A units;

FIG. 6 is a block diagram of an arrangement suitable for use as the "processor seek" clock;

FIG. 7 is a diagram of an arrangement suitable for use as the "B unit scan" clock;

FIGS. 8A--8C, taken together as in FIG. 8, is a block diagram of an arrangement suitable for use in a B unit;

FIG. 9 is a block diagram of an arrangement suitable for use in an A unit;

FIG. 10 is a flow chart which depicts a column B unit scan microprogram;

FIG. 11 is a flow chart which depicts a row B unit scan microprogram;

FIG. 12 is a block diagram of an arrangement suitable for use in carrying out chosen input-output instructions relative to the B unit;

FIG. 13 is a block diagram of an arrangement similarly utilized as that shown in FIG. 12;

FIGS. 14A and 14B, taken together as in FIG. 14, is an arrangement suitable for use in carrying out chosen instructions relative to the A unit;

FIGS. 15A and 15B, taken together as in FIG. 15, is a block diagram of an arrangement suitable for use as an A unit buffer;

FIG. 16 is a depiction of an A unit input and output register;

FIGS. 17A and 17B, taken together as in FIG. 17, is an arrangement suitable for use in carrying out chosen input-output instructions and microprograms employing a B unit;

FIG. 18 is a block diagram of an arrangement employed in carrying out chosen instructions and microprograms and utilizing an A unit;

FIG. 19 is a block diagram of another arrangement utilized in conjunction with an A unit;

FIG. 20 is a block diagram of still another arrangement utilized in conjunction with an A unit;

FIG. 21 is a block diagram of a further arrangement utilized in conjunction with an A unit;

FIG. 22 is a block diagram of a still further arrangement utilized in conjunction with an A unit;

FIG. 23 is a block diagram of yet another arrangement utilized in conjunction with an A unit;

FIG. 24 is a block diagram of an arrangement utilized in conjunction with an A unit;

FIG. 25 is a block diagram of a further arrangement utilized in conjunction with an A unit;

FIGS. 26A and 26B, taken together as in FIG. 26, is a flow chart of a "write" microprogram carried out according to the invention;

FIG. 27 is a portion of a flow chart of a "read" microprogram carried out according to the invention;

FIG. 28 is another portion of the flow chart of the "read" microprogram;

FIG. 29 is a further portion of the flow chart of the "read" microprogram;

FIG. 30 is a still further portion of the flow chart of the "read" microprogram;

FIG. 31 is still another portion of the flow chart of the "read" microprogram;

FIGS. 32A and 32B, taken together as in FIG. 32, is a flow chart of a "read a record" flow chart carried out according to the invention;

FIG. 33A is a diagram of a gating arrangement used in the "A unit test" microprogram;

FIG. 33B is a diagram of another gating arrangement employed in the "A unit test" microprogram;

FIG. 33C is a diagram of a decoding and gating arrangement employed in the "A unit test" microprogram;

FIG. 34 is a diagram of a logic arrangement used in the "A unit test" microprogram;

FIGS. 35A and 35B, taken together as in FIG. 35, is a flow chart of an "A unit test" microprogram carried out according to the invention;

FIG. 36 shows the format of the "read" instruction;

FIG. 37 shows a first possible condition of the A unit buffer upon the initial load operation of the "read" clock;

FIG. 38 shows a second possible condition of the A unit buffer upon the initial load operation of the "read" clock;

FIG. 39 shows a third possible condition of the A unit buffer upon the initial load operation of the "read" clock;

FIG. 40 shows a fourth possible condition of the A unit buffer upon the initial load operation of the "read" clock;

FIG. 41 shows the format of the "write" instruction;

FIG. 42 shows a first possible condition of the A unit buffer upon the initial load operation of the "write" clock;

FIG. 43 shows a second possible condition of the A unit buffer upon the initial load operation of the "write" clock;

FIG. 44 shows a third possible condition of the A unit buffer upon the initial load operation of the "write" clock;

FIG. 45 shows a fourth possible condition of the A unit buffer upon the initial load operation of the "write" clock;

FIG. 46 shows the format of the "read a record" instruction;

FIG. 47 shows a first possible condition of the A unit buffer when the B unit is first called; and

FIG. 48 shows a second possible condition of the A unit buffer when the B unit is first called.

DESCRIPTION OF A PREFERRED EMBODIMENT

Prior to the actual describing of the invention, at this point it is convenient to consider the type central processor or computer with which the input-output system according to the invention can be advantageously utilized.

Let it be assumed, for example, that the central processor essentially comprises a principal computing unit in which data processing operations are handled, a subsidiary computing unit which is in the main utilized for character handling and for compilation and interpretation of the various computer languages, and a memory system. These three essential components appear to the input-output processor as functional blocks having respective groups of distinct characteristics.

Thus, the principal computing unit appears to the input-output system as a relatively expensive functional block which is capable of extremely rapid calculating; which is scheduled in a batch processing mode, i.e., each job therein is run to completion without interruption; which by itself controls all accesses and queues to a portion of a high speed memory unit which has been assigned as exclusively belonging to it but which communicates with other memory units and auxiliary storage units only through requests to the input-output system; and which is to have no direct communication with a subsidiary computing unit such as one which performs compilation, or with remote terminals and devices.

Clearly, the expensiveness of such principal computing unit necessitates that its idle time be minimized as much as is possible. Such requirement in conjunction with its characteristics would optimally require that it is to have the highest priority for input-output requests; that it is not to be interrupted; that it is to be so scheduled that the setup times between jobs is minimized; and, preferably, that its request for input data be anticipated (suitably in the subsidiary computing unit, i.e., one which performs compilation) before such data is actually required.

The subsidiary computing unit which is preferably optimized for character-handling and for the compilation and interpretation of computer oriented languages is advantageously scheduled as a time-shared computer in which one of its programs, such as a background program, is a program compilation and the others of its programs, such as foreground programs, are compilations or interpretations of statements from users at remote terminals. Thus, the subsidiary computer or compiler preferably is to communicate only with remote terminals through the input-output system, and is to have no direct communication with the principal computing unit. Also, it is to communicate with the aforementioned other memory units and auxiliary storage units only through requests to the input-output system.

Eventually, the input-output processor has to schedule all jobs, both foreground and background, for the subsidiary computing unit, to perform all normal input-output functions therefor, to perform all input-output functions for programs running on the subsidiary computing unit, to perform all input-output functions for subsidiary computing unit programs which are not currently being processed but which have commenced input-output activity and are awaiting its completion, and to buffer transmissions between the subsidiary computing unit and remote terminals.

The memory system in the central processing unit in the data processing apparatus in which the inventive input-output system is employed may be assumed to comprise several distinct components. For example, it may comprise a main storage (the memory referred to hereinabove of which a given portion is designated as belonging only to the principal computer) whose use is in connection with programmed data, a bulk storage for storing data, a local storage for storing intermediate results, a read-only storage for microprogram control, and "fast" and "slow" auxiliary storage devices, the latter also being utilized to store data. Of the foregoing, of the devices other than the auxiliary storage devices, the local storage probably has the shortest access time and the smallest capacity whereas the bulk storage has the longest access time and the largest capacity. The main and read only storage components have relatively short access times and relatively large storage capacities.

Suitably, the auxiliary storage devices communicate only with the bulk storage which in turn communicates with the main storage, the respective communication paths being controlled by the input-output system.

Because of the need to give priority to the principal computing unit by virtue of its expensiveness as explained hereinabove, a portion of the main storage is exclusively designated therefor. Thus, the main storage is suitably divided into two portions, viz, a first portion for the principal computing unit and which is under its exclusive control except possibly for data transfers between it and the bulk storage which are suitably controlled by the input-output system and a second portion which is assigned to the subsidiary computing unit and the input-output processor. The second portion typically contains data for input-output programs, instructions and data for the background subsidiary computing unit program and instructions and data for several foreground subsidiary computing unit programs. The allocation of space in the second portion of main storage is dynamically controlled by the input-output system and the second portion is advantageously provided with both relocation and protection features, the latter features not necessarily being included in the first portion.

To fulfill its functional objectives as set forth hereinabove, the input-output system, according to the invention, may be considered, for convenience, as comprising three components, viz, an input-output unit, a remote terminal control unit, and a supervisory control unit, the units being designated with the letters I, R and S respectively.

Referring now to FIG. 1, it is seen that there is depicted therein the data flow as described hereinabove and as controlled by the input-output system according to the invention. The latter system, stage 2 in FIG. 1 communicates with a main computing unit 4, a subsidiary computing unit 6, each portion of the main storage, viz, main storage I designated with the numeral 8 and main storage II, designated with the numeral 10, local storage 12, read-only control storage 14, local storage 16 and read-only control storage 18.

Main computing unit 4 communicates with local storage 20, input-output system 2 and main storage I which is that portion of main storage assigned exclusively to it. Both of the main storage portions, viz, 8 and 10, communicate with bulk storage 22 which in turn also communicates with auxiliary storage 24.

FIG. 2 conceptually depicts the data flow and control paths in input-output system 2 shown in FIG. 1. It is seen in FIG. 2 that this system comprises a supervisory control unit 26, an input-output control unit 28 and a supervisory control unit 30. The solid communication lines are intended to depict data paths and the broken lines, control paths.

To more readily understand the operation of the arrangements shown in FIGS. 1 and 2 and the communications between the various stages therein, it is convenient to consider at this point the table shown in FIG. 2A.

In the table, the symbols have the following significance: ---------------------------------------------------------------------------

IF Register in main computing unit 4 communicating with input-output control 28. SF Register in main computing unit 4 communicating with supervisory control 28. IC Register in subsidiary computing unit 6 communicating with input-output control 28. SC Register in subsidiary computing unit 6 communicating with supervisory control 26. FI Register in input-output control 28 communicating with main computing unit 4. CI Register in input-output control communicating with subsidiary computing unit 8. SI Register in input-output control 28 communicating with supervisory control 26. RI Register in input-output control 28 communicating with remote terminal control 30. FS Register in supervisory control 26 communicating with main computing unit 4. CS Register in supervisory control 26 communicating with subsidiary computing unit 6. IS Register in supervisory control 26 communicating with input-output control 28. RS Register in supervisory control 26 communicating with remote terminal control 30. IR Register in remote terminal control 30 communicating with input-output control 28. SR Register in remote terminal control 30 communicating with supervisory control 26. __________________________________________________________________________

As may be seen from FIGS. 1 and 2 and the table, there are three types of connections between system components, viz, buses, registers and control lines. The buses, i.e., those communication paths depicted as solid lines transmit streams of data. The control lines, i.e., those depicted as broken lines permit direct intervention of one unit by another. The registers, as set forth in the table, contain command or status information. As will be further explained hereinbelow, the control lines are activated only by supervisory control unit 26 (FIG. 2).

Main storage I and its buses are controlled by main computing unit 4. Transfers between the latter storage and bulk storage 22 are initiated by input-output control unit 28 but under the queueing control of main computing unit 4. Unit 28 also has to be capable of reading input-output control commands from main storage I. Main storage II, bulk storage 22, auxiliary storage 24 and all their respective associated buses are controlled by input-output system 2.

In considering the table set forth hereinabove, it is assumed that two directly intercommunicating computing units are designated X and Y, and that two registers are assigned, viz, one designated XY for transmitting information from component X to component Y and one designated YX for transmitting information from component Y to component X. The information in the registers is used at the convenience of the receiver and the operation of the registers may be typified by the following operations outlining an input-output request by main computing unit 4.

1. Main computing unit 4 loads a register FI (in unit 28) with an input-output command and sets bit FI.sub.o (the first bit) to one.

2. Input-output control 28 recognizes signal FI.sub.o, begins to execute the command in register FI and resets bit FI.sub.o to zero thereby indicating the initiation of the execution of the command.

3. Once bit FI.sub.o is so reset, main computing unit 4 may issue another input-output command or inquire as to the status of an input-output operation in progress by reloading register FI with an appropriate command.

4. Upon the completion of an input-output command and at specified points during a sequence of input-output commands, input-output control 28 loads a register IF with status information and sets bit IF.sub.o of register IF to one.

5. Main computing unit 4 acknowledges receipt of information in register IF by setting bit IF.sub.o to zero.

INPUT-OUTPUT CONTROL SYSTEM 2

Input-Output Control 28

Input-output control 28 regulates the transmission of data between bulk storage 22 and auxiliary storage 24 and between bulk storage 22 and main storage I and II. Control 28 is a suitably microprogrammed computer controlled by a read-only memory and, generally speaking, performs routine functions of a housekeeping nature. The sequence of microprogram steps is controlled by commands issued by either main computing unit 4 or subsidiary computing unit 6 or by supervisory control 26 and remote terminal control 30 of input-output system 2. The principal functions of input-output control 28 are as follows:

1. The transforming of symbolic input-output control 28 designations to specific unit names;

2. The determining as to which channel(s) control 28 is connected;

3. The establishing of a data path from control 28 to bulk storage 22;

4. The updating of addresses and counts during data transfer;

5. The performing of data and command chaining;

6. The interpreting and transmitting of status information on the progress of input-output action;

7. The stacking of input-output requests to busy units;

8. The controlling of data transmission between bulk storage 22 and main storage I and II by performing functions analogous to the functions set forth immediately hereinabove and designated 3--6 respectively.

Remote Terminal Control 30

Remote terminal control 30 directs the transmission of data to and from the remote terminals. Users at the remote terminals time-share subsidiary computing unit 6 and input-output system 2 to debug programs and to execute short programs. Inasmuch as a terminal is an input-output device, remote terminal control unit 30 has to perform most of the functions required of input-output control 28. However, as the rate of information transfer in remote terminal control 30 is several orders of magnitude slower than that in input-output control 28, controls 28 and 30 are considered separately. Thus, input-output devices such as printers, punches, and readers are preferably connected to remote terminal control 30 whereas remote devices which require a relatively large data transfer rate to maintain displays are connected to input-output control 28. Remote terminal control 30 performs the following tasks:

1. It accepts and responds to terminals on a character by character basis;

2. It assembles characters into strings;

3. It detects when a string requires processing by subsidiary computing unit 6 or input-output system 2 and notifies supervisory control unit 26 of this condition;

4. It accepts strings from subsidiary computing unit 6 or input-output system 2 for transmission to terminals.

Supervisory Control 26

The principal functions of supervisory control 26 is to keep all of the other components of the computer working efficiently. This function essentially comprises two important tasks, viz:

1. The scheduling of jobs for main computing unit 4 and subsidiary computing unit 6.

2. The allocation of storage space in main storage I and II, and bulk storage 22.

As has been mentioned hereinabove, since main computing unit 4 is most advantageously operated in a batch processing mode, its scheduling is the relatively simple operation of minimizing the idle time between jobs by setting up the kth job while the (k-1) th job is still in progress.

The schedule for subsidiary computing unit 6, which is suitably operated on a time-shared basis may be more complex. The list of terminals requiring attention by subsidiary computing unit 6 at any given moment is suitably maintained by remote terminal control 30 but it is supervisory control 26 which determines which terminal is actually to be serviced. Factors influencing this choice include the priorities of requestors, the period that each of the latter has been waiting for service, the expected duration of service, and the current storage allocation.

Although supervisory control 26 communicates with other system components primarily by means of special registers, interruption lines are also suitably provided to connect supervisory control 26 to main computing unit 4 and subsidiary computing unit 6 and to input-output control 28 and supervisory control 26. Whereas the special registers provide information which is utilized at the convenience of the receiver, the interruption lines exercise positive control. Thus, for example, if main computing unit 4 has exceeded its allotted time for a particular job, supervisory control first signals main computing unit 4 via a register SF (in supervisory control 26) to terminate its job at a convenient point. If at this point, supervisory control 26 fails to receive a satisfactory response, it interrupts main computing unit 4 and stops the execution of the job. Suitably, the interruption inhibits the fetching of new instructions but permits all current operations and those in any look-ahead unit to be completed, thereby providing a smooth shutdown.

In addition to its two major tasks, i.e., the scheduling of jobs and the allocation of storage, supervisory control also serves as a dynamic diagnostic control by continuously monitoring fault locating circuitry and by periodically scheduling diagnostic programs for other system components. In carrying out the diagnostic control function, faulty equipment is logically disconnected, the remaining components are arranged in a new system configuration, and error messages are sent to service personnel.

In accordance with known data processing equipment constructions, interfaces, i.e., data, parity and control lines, for example, are provide between the input-output system and the input-output devices, i.e., tape drives, disks, drums, consoles, printers, etc.

The control by the input-output system of transmissions between the several storage units is according to the invention, accomplished by components conveniently designated as A and B units in input-output control 28 (FIG. 2). As will be further explained hereinbelow, the responsibilities assigned to each type of these units are as follows:

A Units

1. The buffering of byte-by-byte data transmission across the interface.

2. The monitoring of and the responding to interface control signals.

3. The verifying, filing and recording of identification marks.

B Units

1. The initiation of A unit sequences for device selection, command, data transmission and ending.

2. The storing and fetching of data in bulk or main (central processor) storage.

3. The updating of addresses and counts.

4. The generation and verification of parity and redundancy checks.

5. The controlling of record search operations.

In a complete input-output control stage there may be as much as 10 or 12 B units and a hundred or more A units. Each B unit may be connected to 10 to 20 A units and continually scans these units in a search for an A unit which requires service. Upon the servicing of an A unit, such as the emptying or refilling of its buffer, for example, the B unit continues to scan. Each A unit can be serviced by at least two B units, the servicing ratio being determined by a particular requirement. The B units are essentially program controlled (suitably by a microprogram) whereas the A units are controlled by the system hardware. With such arrangement, the processing capacity of a unit is matched with the actual processing done by such unit a majority of the time. Thus, simple, frequently occurring operations are performed by simple equipment and the idle time of complex equipment is reduced. For example, A units are constructed so as not to include means for updating addresses, an operation which need be carried out only once for about every eight or 10 bytes, such tasks being assigned to B units whose respective facilities are available to several A units.

Reference is now made to FIG. 3 wherein there is shown a conceptual arrangement of the A units and B units in rows and columns to illustrate how each row of A units is serviced by a "row" B unit and how each column of A units is serviced by a "column" B unit. With this arrangement, it is thus seen that it is possible for each A unit to be serviced by one of two B units. Of course, consistent with any particular requirements, there could be more than two B units for each row or column A units.

In the arrangement shown in FIG. 3, it is assumed that there are a plurality of processing or computer units and a plurality of input-output devices. It is further assumed that each input-output device has "appropriate" A units with which it is arranged to operate. In the legending of the A units in FIG. 3, the first number designates the conceptual row in which the particular A unit is located and the second number designates the conceptual column.

In the table shown immediately hereinbelow, there is given an example in which the system would contain seven input-output devices and five units.

I-O Device Appropriate A Unit __________________________________________________________________________ -1 -2 or -4 -2 -1 or -3 -3 -1 or -2 -4 -4 or -5 -5 -1 or -4 -6 -3 or -4 -7 -2 or -3 __________________________________________________________________________

The A units set forth in the above table could be scattered throughout the array of A units shown in FIG. 3. It is readily appreciated that a central processing unit can, by using tables showing current operations or by using more complicated logic involving "busy," "not busy" flip-flops, or other switching devices, choose an A unit so as to balance load or meet some other criterion.

To understand how the various processing units cooperate with the "appropriate" A units, reference can be made to FIGS. 4A--4F taken together as in FIG. 4 and FIG. 5 which is a detailed depiction of the box designated K in FIG. 4C. FIG. 4 illustrates the "Processor Seek" operation.

Referring to FIG. 4A, the flip-flops 31, 32, and 33 shown therein are initially set to "0" when the system is started. When a processor needs an input-output device, its "request I-O" line becomes active and the associated flip-flop 31, 32, or 33 is set to "1." The "Processor Seek" clock, designated by the legend PS1-7, et seq., continuously tests these flip-flops in ascending numerical order and, if any of these three flip-flops is at "1," it will effect the proper connection between the desired I-O device and the appropriate A unit provided that the I-O device is not busy and also provided that one of the appropriate A units is idle.

In FIG. 6 there is shown a suitable embodiment of a "Processor Seek" clock. It is seen in FIG. 6 that such clock comprises several stages legended PS numeral, these stages suitably being monostable multivibrators. Thus, for example, when monostable multivibrator 34, i.e., designated PS1 is in its astable or "on" condition, it provides a pulse on line 35 and when it goes from its "on" to its "off," i.e., its stable condition, it delivers a momentary pulse on line 36. Initially, if it is assumed that all of the monostable multivibrators are in their off or stable states, to initiate the operation of the clock, a short pulse is applied to line 37 which switches stage 34 to its astable or "on" state. Thus, if processor -1, for example, as shown in FIG. 4A requests an input-output device, the "Processor Seek" clock will branch through an AND circuit 38 to stage PS1-1.

The output pulse from stage PS1-1, i.e., pulse PS1-1 would thereby connect the proper input-output device to an appropriate A unit provided that both the input-output device and the A unit are idle and the clock will proceed to stage PS2 through AND circuit 39.

Referring back to FIG. 4A, clock pulse PS1 is applied to an AND circuit 40. If processor -1 requests an input-output action, AND circuit 40 will pass clock pulse PS1 to AND circuit 41 which gates the input-output device number and the address of the first instruction which are on cable 42, to a register 43. Upon the reverting of monostable multivibrator PS1 to its stable state, its fall is at that time applied to a gate 44 and, in this situation, the clock will branch to PS1-1 (FIG. 6). Gate 44 in FIG. 4A may be considered the equivalent of the two AND circuits 38 and 39 in FIG. 6.

Clock pulse PS1-1 next gates the input-output device number from register 43 to the decoder as shown in FIG. 4C. In this decoder, upon the gating of the PS1-1 clock pulse, one of lines 45--51 become active. Thus, if it is assumed that line 45 becomes active the latter is applied to the circuit contained in the box legended K and which is depicted in some detail in FIG. 5.

Referring to FIG. 5, it is seen therein that if the input-output device is busy, the pulse on line 45 will be blocked. If the input-output device is not busy and both A units i.e., unit A2 and A4 are busy, the pulse on line 45 will also be blocked.

If the input-output device is not busy and if unit A2 is also not busy, the pulse on line 45 will exit to appear on line 54 (FIG. 5). If the input-output device is not busy and unit A2 is busy, but unit A4 is not busy, the pulse on line 45 will exit to appear on line 56.

It is to be noted that while the embodiment which has been shown indicates how a processor can find an idle input-output device and an idle A unit, other arrangements could suitably be utilized. For example, the request could come from a queue of input-output requests rather than from the processor directly and then information as to how the request had been handled could be sent back to the processor.

Referring to FIGS. 4A, 4B, and 4C, an output on line 54 is effected through a delay circuit 78 to set a flip-flop 62 to its "1" state. Similarly, an output on line 56 is effected through a delay circuit 82 to set a flip-flop 64 to its "1" state and it is also operative through an OR gate 68 and a line 76 to gate the address of the first instruction to the instruction address register (IAR) located in unit A4. Alternatively, the instruction address register could be a location in some centralized control memory. Line 56 is also operative through a delay circuit 80 to set the "a" flip-flop in the A4 unit, an embodiment of an A unit being described in further detail hereinbelow. The function of delay stages such as stages 78 and 82 is to delay the setting of the flip-flops such as flip-flop 62 and 64 until the pulse has disappeared from line 45. Such operation is necessary because the changing of the states of flip-flops 62 and 64 will cause a change in the state of the "busy" and "not busy" signals which are applied to the circuit of FIG. 5. The purpose of a delay stage such as delay 80 is to delay the setting of the "a" flip-flop until after the interconnections have been made between an input-output device and the A unit.

When monostable multivibrator PS1-1 reverts to its stable state (FIG. 6), the "processor seek" clock proceeds to multivibrator PS2 through a delay stage 84, delay 84 being provided to insure that sufficient time is provided for the "busy" and "not busy" signals to become established as a result of the setting of either flip-flop 62 or 64 to its "1" state.

Because the "a" flip-flop in the desired A unit is now set to "1," such A unit is a candidate for service by either its associated column B unit or its associated row B unit. Every B unit, when idle, continually searches sequentially for an A unit that requires service. An A unit's need for service is evidenced by the "on" condition of its "a" or "u" flip-flop or both.

Each B unit is provided with its own set of a, u, and p vectors in the form of three sets of flip-flops respectively, one set for each vector. Thus, if the B unit is a row B unit, the vectors are row vectors and if the B unit is a column B unit, the vectors are column vectors. Consequently, a component in an A unit can be reproduced in two places, i.e., once in the row B unit and again in the column B unit. The a vector is set from the "a" flip-flops at the discretion of the B unit. The p vector is a masking vector and a zero component in the p vector causes the corresponding "a" and "u" components to be treated as zeros regardless of their true values.

The B units scan operation is described in conjunction with FIGS. 8, 9, 10, 11, and 14. FIG. 8 is a depiction of an embodiment of the circuitry contained in a B unit in order to enable it to accomplish a B unit's scan. The a, u, and p vectors are represented therein by the three horizontal rows of flip-flops legended a, u, and p. It is noted that no structures are shown for setting and resetting the "p" vector flip-flops as the latter are set arbitrarily and their function is only that of masking the a vector or u vector flip-flops. Since the circuitry shown in FIG. 9 represents a column B unit, it is conveniently examined together with FIG. 10 wherein there is depicted a flow chart for a column B unit scan.

Each B unit is provided with its own clock for the B unit scan and such clock is shown in FIG. 7. The a flip-flops in FIG. 8 can be set to the "1" state by an enabling gate 416 which transfers the a vector from the A unit through the B unit. The u vector is transferred by enabling a gate 418.

As seen in FIGS. 8A and 8B, the first B unit clock pulse, CL1 resets a flip-flop 86 to "0" and also sets flip-flops 100 to 106. A gate 88 is enabled to gate the u vector to a testing circuit whose initial stages are AND circuits 92 and 94. The clock pulse CL2 is next applied to an OR circuit 90 to ask the question "Is there anything in the u vector which is not masked out by the p vector?" If it is assumed that the leftmost u vector component, i.e., flip-flop 136 is in the "1" state and the corresponding p vector flip-flop is also in the "1" state, under these conditions, flip-flop 100 is set to a "1" and clock CL2 branches to clock CL9. It is to be noted that if there were no "1"'s in the u vector flip-flops, flip-flop 128 (FIG. 4B) would be set to a "1" and the clock would continue from CL2 to CL3. With the flip-flop 100 in the "1" state, a gate 420 is enabled. Gate 420 establishes the connection between the A unit which contains the u component represented by the flip-flop 136 which is in the "1" state and the column B unit. When clock pulse CL9 is applied to a gate 424, the active state of line 422 extends through gate 424 and is operative to reset flip-flop 136 and its corresponding a vector flip-flop to "0." With such arrangement, the component is removed from both the u and a vectors. A second function of clock pulse CL9 is to test the status of the "a" and "u" flip-flops which exist in the A unit as shown in FIG. 10 and, also, to test the status of the "response" flip-flop which is shown in FIG. 9. The four lines to gate 420, viz, lines 394, 396, 398 and 400 come from the "a" and "u" flip-flops which exist in the A unit (FIG. 14). The two lines to gate 420, viz, lines 404 and 406 comes from the "response" flip-flop (FIG. 9). If the "response" flip-flop is in the "1" state, it indicates that the A unit is being serviced by a B unit. Accordingly, clock pulse CL9 is applied to a gate 426 (FIG. 8C). If either the "a" or "u" flip-flop is in the "1" state, and the "response" flip-flop is in the "0" state, flip-flop II is set to the "1" state. If both the "a" and "u" flip-flops are in the "0" state and the "response" flip-flop is in the "1" state, flip-flop I is set to the "1" state.

Flip-flops I and II are employed to break a possible tie which might occur if both the column B unit and row B unit were to attempt to service the same A unit simultaneously, i.e., if the "a" flip-flop, the "u" flip-flop or the response flip-flop are in the process of being switched in state at the time that the clock pulse CL9 occurs, both flip-flops I and II might be switched to their respective "1" states. Clock pulse CL10 tests for such condition and if flip-flop I is in the same state as flip-flop II, the clock branches back to CL9 and this situation continues until the tie is broken. If flip-flop I is not in the same state as flip-flop II, the clock proceeds to CL12 which tests flip-flop II. If flip-flop II is in the "0" state, this signifies that either both of the "a" and "u" flip-flops had been switched to their "0" states (an A unit has been serviced by the other B unit) or that the A unit is accepting service from the other B unit, the other B unit being the row B unit. If in fact, the A unit is receiving service from the other and row B unit, the B unit scan clock returns to clock CL1 and the u vector is again interrogated for a next component requiring service. If clock pulse CL12 ascertains that flip-flop II is in the "1" state, it means that up to this point, if a tie or a near tie is occurring, the column B unit is ahead of row B unit in their competition for giving service to the A unit.

Clock pulse CL13 is next applied to line 408 which as seen in FIG. 10 sets the response flip-flop to its "1" state and flip-flop 144 to "col." The clock then proceeds to clock CL14 which functions as a delay. The latter delay is chosen to be of long enough duration to resolve any final conflict between the row and column B units. For example, the column B unit might set the response flip-flop to "1" and flip-flop 144 to "col." just slightly ahead of the time that the row B unit is setting the response flip-flop to "one" and flip-flop 144 to "row." In other words, flip-flop 144 might first be set to "col." and then to "row" if the clock pulse CL13 from the row B unit happens to have a slightly longer duration than the pulse from the column B unit. The conflict is resolved by the time that the CL15 clock pulse occurs. Clock pulse CL15 tests the lines 410 and 412 (FIG. 10). If flip-flop 144 is at "row," this signifies that the row B unit has won the race and the column B unit would then revert to clock CL1. If flip-flop 144 is at "col.," this signifies that the column B unit can go ahead and service the A unit. Clock pulse CL16 is applied to line 200 which resets the "a" and "u" flip-flops (FIG. 14B) to the "0" state and also to FIG. 9 wherein it is seen that it sets flip-flop 126 to the "1" state. Flip-flop 126 establishes the necessary gating between the A unit and the column B unit in order to enable the column B unit to service the A unit. The decay of clock pulse CL16 starts the IF clock (Information Fetch).

Referring back to clock CL2, if the interrogation of the u vector fails to produce any components in the "1" state, flip-flop 128 (FIG. 8B) is set to the "1" state whereby the decay of clock pulse CL2 is gated to clock CL3. Clock pulse CL3 is applied to gate 418 to respecify the u vector. The clock then proceeds to clock CL4 which in effect, is the same as clock CL1. Clock CL4 goes to clock CL5, clock pulse CL5 examining the u vector for "1" states and if a "1" state is found, the clock branches to CL9 as previously explained hereinabove. If there are no "1" states in the u vector, the clock proceeds to clock CL6 which enables gate 160 (FIG. 8A) and resets flip-flops 100 through 106 and flip-flop 128 (FIG. 8B) to their respective "0" states.

Clock pulse CL7 is next effective to test the a vector for the presence of "1" states. If there is a "1" state in the a vector, the clock branches to clock CL9 and proceeds as explained hereinabove. If there are only "0" states, in the a vector, the clock proceeds to clock CL8 to enable both of gates 416 and 418 (FIG. 8A) in order to respecify both the a and u vectors. The clock is chosen to be arranged such that only a single "1" state in the a vector is considered. If such "1" state is found, the B unit offers service to the A unit but the scan clock starts again at clock CL1 and the u vector is interrogated.

Instruction Fetch Clock (IF)

When a B unit has established a connection with an A unit in order to service it, at this point the B unit has to go to the memory to get the instruction which tells it what service it is to perform. It is recalled from the description of "Processor Seek" operation that the address of the first instruction is in the Instruction Address Register (IAR) of the A unit. In a computer system it is likely that there would probably be more than one instruction to execute and the addresses of the instructions in memory might exist in sequential order or they might be chained together. For convenience of description and purpose of clarity, let it be assumed that only one instruction at one time exists to be executed, i.e., after one instruction has been executed, the A unit is disconnected from the input-output device. It should be noted that the memory wherein the instruction is located could be of a special centralized control type which would be accessible to all of the B units.

There follows hereinbelow a description of three types of input-output instructions capable of being utilized in the embodiment according to the invention. A first of these instructions is a "Write-xxx Bytes." A second instruction is "Read-xxx Bytes," and the third instruction is "Read a Record."

It has been previously mentioned hereinabove that flip-flops 126 and 138 (FIG. 10) establish gates which accomplish the interconnection of the B unit to the A unit. Although such gates have not been shown in the drawing, it is to be understood that when a circuit extends from a B unit to an A unit and vice versa, it may go through a suitable gate.

Referring back to the "Instruction Fetch" (IF) clock, the clock pulse IF1 sets flip-flop 162 (FIG. 12) to its "1" state to activate line 164 which thereby gates the contents of the instruction address register (FIG. 14A) to the memory address register through cable 166 and also requests a memory access. When clock pulse IF1 decays, it turns on clock IF2 whereby clock pulse IF2 tests the condition of flip-flop 162. If flip-flop 162 is in the "1" state, it indicates that the memory access is not complete and the clock advances to clock IF3 which is used to provide a delay and only returns to clock pulse IF2. When the memory access is complete, flip-flop 162 is in the "0" state and the instruction will be in the instruction register (IR) (FIG. 12). The clock will then proceed to clock IF4 which gates the operation code to the decoder 168 (FIG. 12). As is seen in FIG. 12, decoder 168 has three outputs. With such arrangement, one of the three clocks viz, "Write," "Read" or "Record" is started.

Prior to describing the "Write" clock, at this point it is first necessary to describe some of the necessary structures that are included in this embodiment.

The A Unit Buffer

An embodiment suitable for use as an A unit buffer is shown in FIG. 15. The buffer itself is depicted therein as comprising a plurality of rows of flip-flops, each of these rows being capable of storing one byte of information. In the depicted embodiment, it is to be assumed that six bytes constitute a memory word. Although the embodiment shown in FIG. 15 is depicted as comprising flip-flops as the switching circuits therein, it is readily appreciated that the buffer could be constructed in other ways. For example, it could be a high-speed thin film memory.

The buffer comprises one input register 170 and two output registers 174 and 176. Registers 170 and 174 are for the use of the B unit and register 176 is for the use of the A unit.

The format of the bytes in one position of the buffer is shown in FIG. 16. Two counters are employed in conjunction with the buffer. The size of the counter determines the size of the buffer or vice versa. For example, if there are 64 positions in the buffer, they would be numbered from 0 to 63 and a suitable counter would be a 6-bit binary counter which would count from 0 to 63 in binary notation. If the positions in the buffer were to be numbered in binary notation from top to bottom, then the top position would be 000000 and the bottom position would be 111111.

If circuit components other than flip-flops were used for the implementation of the buffer, and simultaneous loading and unloading were not possible in such implementation, then additional equipment, readily provided by and within the knowledge of the individual skilled in the art would be required to police the use of the buffer in order to enable simultaneous requests to produce sequential accesses.

Referring now to FIG. 15, it is to be noted therein that data is loaded into a position in the buffer through a cable such as cable 178. Data is removed from a position in the buffer by a cable such as cable 180. Thus, one position in the buffer can be loaded at the same time that another position is unloaded. A gate such as gate 182 can be included to permit the information on an input bus 384 to be placed in the position in the buffer. If, instead of gate 182, a gate 184 is enabled, the contents of register 170 instead of the contents of bus 384 can be loaded into the same position in the buffer. To unload the same position of the buffer, a gate 186 can be employed to cause the contents of the position in the buffer to appear in register 174. If a gate 188 is enabled instead of gate 186, then the contents of the position of the buffer appear in the register 176 instead of register 174.

Gates such as gate 182 are controlled by leads contained in a cable 190. These same leads in cable 190 extend to gates such as gate 188. Only one of the leads in cable 190 can be active at any one time because these leads come from the decoder in the output of an A counter in the A unit. Therefore, the number in the A counter determines the position in the buffer that can be loaded from bus 384 or unloaded into register 176. The leads in a cable 192 come from the decoder in the output of a counter B in the B unit. The number in counter B determines the position of the buffer that can be loaded from register 170 or unloaded to register 174. As previously explained hereinabove, the detailed gating between an A unit and B unit has been omitted in the interests of clarity of explanation and exposition. However, in this connection, for a further understanding, the FIGS. that contain A unit circuitry can be placed to the right of the buffer shown in FIG. 15 and the FIGS. that contain B unit circuitry can be placed at the left of the buffer. For example, FIGS. 12 and 13 can be placed at the left of FIG. 15, and FIG. 14 can be placed at the right of FIG. 15. A B counter and its decoder are shown in FIGS. 12 and 13. An A counter and its decoder are shown in FIG. 14.

The A unit operates continuously, either unloading the buffer byte-by-byte in order to transmit the bytes to the input-output device in the case of a "write" instruction or loading the buffer byte-by-byte in the case of a "read" instruction. An A unit has to operate continuously and with no interruption until the execution of an instruction is completed. A B unit, however, operates at a rate substantially faster than that of an A unit and consequently means have to be provided to insure that a B unit does not override an A unit. The A unit "pointer," i.e., the active line in cable 190 which is the output cable of A counter decoder, should always be ahead of or, in the worst case, equal to the B unit pointer. Clearly, should the B pointer become equal to the A pointer, the B unit must stop operating at that time and disconnect itself. In addition, there are times, as will be further explained hereinbelow in greater detail, when it is necessary to know if there are two more slots or positions remaining in the buffer, i.e., counter A minus counter B equals 2, or if there are six slots or positions remaining in the buffer.

The arrangement utilized to determine the immediately foregoing facts can be illustrated with a simple example such as with 10 slots in the buffer respectively designated 0 to 9 from top to bottom. Both the A and B counters would count up to 9 and go to the zero count on the tenth count. Thus, if it is assumed that both counters, i.e., A and B counters, are initially set to zero, under such conditions, their contents are equal to each other. Let it be assumed now that the B pointer has moved to "1" position and before the B unit utilizes the "1" slot, it asks the question as to how many slots remain in the buffer. The number in the B counter is subtracted from the number in the A counter with a proviso that the 10th column, i.e., 1 subtracted from 0 gives a remainder of 9. Such scheme is always operative provided that the B pointer never gets ahead of the A pointer which, in fact in the arrangement outlined, it never does. If the A pointer, for example, were to be on 4 and the B pointer were to be on 9, the subtraction would result in the number 5 which is the correct number since the empty slots are the 9, 0, 1, 2, and 3 slots respectively.

When the B unit has loaded the buffer as far as it can without overriding the A unit, it sets the values for a and u. The a and u quantities determine how much buffer space remains when the B unit is called on for service. The a quantity obtains in the situation of an ordinary call and the u quantity in that of an urgent call. Preferably, the foregoing quantities are such that the B unit is called when the buffer is to be filled within a certain given period. To accomplish the latter end, the a and u quantities are related to the speed of the input-output device. It is readily appreciated that the a and u quantities could be determined before the input-output operation is begun and stored either in the A unit or with the instruction. The a quantity is obtained by decrementing the B counter 202 (FIG. 13) the a amount. The contents of the B counter are then transferred via cable 192 and a cable 204 (FIG. 14) to the register a which is designated with the reference numeral 206. The u value is obtained by again decrementing the B counter by the difference between the a and u quantities and then transferring the resulting contents of the B counter to a register u designated with the numeral 208 as shown in FIG. 14. The B counter is then restored to its original value by incrementing it with the u amount.

In the arrangement shown in FIG. 14, the answer to the question "Are the contents of the B counter equal to the contents of the A counter?" is provided by a compare unit 210. The answer to the question "Are six slots remaining in the buffer?" is provided by the output of a subtractor 212 and the answer to the question "Are there two slots left in the buffer?" is provided by the output of a subtractor 222 (FIG. 14).

The a and u component flip-flops are designated in FIG. 17 with the reference numerals 214 and 216 respectively. Flip-flops 214 and 216 are initially reset when the system is placed in operation and then are set by compare units 218 and 220, the outputs of which are clocked with one of the A unit clock pulses as will further be described hereinbelow. Flip-flops 214 and 216 are also reset during the operation of the "B unit scan" which has been described hereinabove. The settings in flip-flops 214 and 216 are transferred to the B units as previously mentioned above in connection with the "B unit scan" clock.

In the case of a "write" or "read" instruction, the number of bytes to be written or read is in the Q field of IR register (FIG. 12). Such number of bytes is a multiple of the number of memory words. The address in memory where the first word is to be found in the case of a "write" instruction or where the first word is to be stored in the case of a "read" instruction is in the R field of the IR. To convert words to bytes and vice versa, an "Assembly Register" is required and such register is shown in FIG. 20 and designated with the reference numeral 224. As shown in FIG. 17B, register 224 is shown to have a capacity of six bytes, for example, which requires the assumption that six bytes make up a memory word. During a "write" operation, words are loaded into register 224, one at a time, under control of the assembly register flip-flop 226 for a "write" operation. For a "write" operation, a flip-flop 228 (FIG. 17A) is set to its "1" state to enable a gate 230 (FIG. 17B) which when enabled permits the ring 232 to enable the gates 234--244. Thus, one byte at a time can be transmitted to a gate 246 and a cable 248 to the register 170 shown in FIG. 15A.

In the "read" operation, flip-flop 228 (FIG. 17A) is reset to its "0" state to thereby enable a gate 254 (FIG. 17B). The enabling of gate 254 permits ring 232 in turn to enable gates 256--266. Consequently, with such arrangement, a word can be assembled byte by byte through a gate 252 and a cable 268 which connects to register 174 (FIG. 17B).

A "service" flip-flop 270 is provided in the A unit and is shown in FIG. 18. It is necessary, in order to distinguish between the first time that a B unit services an A unit for one instruction and the succeeding time that a B unit services the A unit, in order to carry out and complete the execution of the same instruction. For implementing such distinguishing, flip-flop 270 is initially set to its "1" state at the juncture that the system is first placed into operation. Flip-flop 270 is then reset to the "0" at the first time that a B unit disconnects itself from an A unit and is then set to the "1" state when a B unit has completed an instruction.

A load counter 272 (FIG. 19) is employed to keep track of the number of bytes that have been loaded into the buffer by a B unit.

An "end load" flip-flop 274 (FIG. 20) is set to the "1" state at the start of an instruction and is reset to the "0" state when all of the bytes have been loaded by a B unit.

Orders or commands may be loaded into the field of register 170 (FIG. 15A) through a cable 276 which connects to the structures shown in FIG. 24. In FIG. 24 the blocks 278, 280, 284, and 286 and legended "Stop Aut," "End," "Read," and "Write," respectively, can be "read only" registers, each of which contains a byte number of a given amount such as the six assumed hereinabove, the latter being recognized as a command or order if it is preceded by an "01" or a "11" in the X and Y fields (as shown in FIG. 16).

The X and Y fields of register 170 in FIG. 15A can be loaded through a cable 288 which connects to the structures shown in FIG. 25. In FIG. 25, the four registers respectively designated with the numerals 290, 292, 294 and 296 contain the four possible combination of bits that can be loaded into the X and Y fields of register 170, viz, combinations 00, 01, 10 and 11.

There follows immediately hereinbelow an explanation of the mechanism of the buffer loading in order to execute the three instructions, "read," "write" and "read a record."

Execution of the "Read" Instruction

The format of the instruction register is shown in FIG. 36.

The OP field in the format shown in FIG. 36 contains the coded instruction "read." The Q field contains the number of bytes that are to be read. As has been done hereinabove for the purpose of convenience of explanation, it may be assumed that one word comprises six bytes. The R field of the format contains the address in the memory where the first word which is read is to be stored.

The initial load operation of the "read" clock will place the A unit buffer in one of four possible conditions as shown in FIGS. 37--40 respectively.

The example depicted in FIG. 37 is the condition where the number of bytes to be read is greater than the number of bytes that can be placed in the buffer at one time.

The example depicted in FIG. 38 is the condition in which the number of bytes to be read is less than the capacity of the buffer.

The example depicted in FIG. 39 may be relatively unusual since it is the situation where the buffer is exactly the right size and there is just the correct amount of space to place the two instructions at the bottom of the buffer, no slots or positions left over.

If the initial loading operation leaves the buffer in the condition as shown in FIG. 37, the "11 end" order and the "01 stop aut" command will be placed in two consecutive slots somewhere in the buffer during a later loading operation.

The example shown in FIG. 40 shows the situation where there is only one slot remaining in the buffer after all of the data bytes have been loaded thereinto.

Execution of a "Write" Instruction

The format of the instruction register for a "write" instruction is shown in FIG. 41.

In such format, the OP field contains the coded instruction "write." The Q field contains the number of bytes that are to be written, a suitable example again being six bytes per word. The R field in the format contains the address in memory where the first word is to be found.

The initial load operation of the "write" clock will leave the A unit buffer in one of the four possible conditions as shown in FIGS. 42--45 respectively. As is seen in these FIGS., the condition exemplified in FIG. 42 shows all of the positions being filled in the buffer. The condition as depicted in FIG. 43 shows all but three or more positions being filled in the buffer. The situation diagrammed in FIG. 44 indicates the condition wherein all but two of the positions in the buffer are filled and the condition shown in FIG. 45 is that one in which all but one of the positions in the buffer are filled.

Execution of a "Read A Record" Instruction

The format of the instruction register in a "read a record" instruction is shown in FIG. 46. In this format, the OP field contains the coded instruction "read a record." The Q field is not employed. The R field contains the address in memory where the first word is to be stored.

In the execution of this instruction, when a B unit is first called upon, it performs one loading operation and the A unit buffer is left in one of the two possible conditions as shown in FIGS. 47 and 48 respectively.

In considering FIGS. 47 and 48, it is to be noted that during the single loading operation a B unit will first insert the command "01BR-(A+4)," which is a command to the A unit for it to skip the next three slots, i.e., to branch to a value of the A counter which is equal to its present amount plus four. The B unit then inserts the command "11 end" which is an order to the input-output device to halt its operations. Simultaneously, the B unit stores the count in the B counter in a register .alpha. which is in the A unit. The B unit then inserts the command "stop aut" which is a command to the A unit ordering it to set the "a" flip-flop and permit the aut clock to halt. The B unit next inserts the order "11 read." The next command inserted by the B unit is "BR-.alpha.-EOR" which is a command to the A unit to cause it to replace the contents of the A counter with the contents of register .alpha. with the symbol "EOR" appearing in the buffer. It is seen that this will cause the A counter to point to the order "11 end" which will be executed and the A counter will next advance to the command "01 stop aut."

After the command "BR-.alpha.-EOR," a B unit inserts zeros into the X and Y fields of the next slot. The buffer is thereby filled up in this manner, slots containing "BR-.alpha.-EOR" alternating with slots containing zeros and X and Y fields. Thus, if a single slot remains at the bottom of the buffer, the command "01 " is inserted as shown in FIG. 47. This signifies that the slot is to be skipped and does not refer to the skipping of bytes from the input-output device. It is to be realized that in an embodiment incorporating other input-output operations or incorporating sequences of instructions in one operation, it may be necessary to provide for the loading of several branch instructions and, therefore, to refer to several branch addresses. Such requirements are readily complied with by one skilled in the art, e.g., there may be provided several registers such as the .alpha. registers and having each branch instruction indicate one of these registers. Alternatively, the branch address can be inserted into the slot or slots immediately following the branch instruction and accordingly altering the A unit interpretation of the branch instruction. Similarly, allowance can be made for branching upon the receipt of specified bytes other than the EOR, and thus the A unit can be chosen to select and read only records beginning with prescribed identifier bytes or to read parts of such records. At the end of the loading operation, the A counter is set to the value which points at the "11 read" command.

The following chart sets forth the relationship of the operations under the control of the "processor seek clock" shown in FIG. 6. ##SPC1## ##SPC2## ##SPC3## ##SPC4##

The "instruction fetch clock" (IF) is a clock similar to the "processor seek" clock and comprises four stages, IF1 to IF4, each of these stages suitably being monostable multivibrators whose set state is utilized to perform a given function in the instruction fetch operation. The termination or timing out of a set state of a clock monostable multivibrator sets the next succeeding monostable multivibrator in the clock. Since the arrangement of a microprogram clock is shown in FIG. 6, in the case of the "processor seek" clock, no further depiction of the instruction fetch clock is deemed necessary.

The following chart sets forth the relationship of the operations under the control of the "instruction fetch" clock. ##SPC5##

"Read" Microprogram

This program employs the "read" clock R which is a clock of monostable multivibrator stages similar to the "processor seek" and "instruction fetch" clocks in which the timing out of the set state of a multivibrator turns on a different multivibrator in the clock.

The following chart sets forth the relationship of the operations under the control of the "read" clock. This chart, together with the flow charts depicted in FIGS. 27--31, provide an explanation of the "read" operation. ##SPC6## ##SPC7## ##SPC8## ##SPC9## ##SPC10## ##SPC11## ##SPC12## ##SPC13## ##SPC14## ##SPC15## ##SPC16## ##SPC17## ##SPC18## ##SPC19## ##SPC20##

"Write" Microprogram

This program employs the "write" clock R which is a clock of monostable multivibrator stages similar to the "processor seek" "instruction fetch" and "read" clocks in which the timing out of a multivibrator sets a different multivibrator in the clock.

The following table sets forth the relationship of the operations under the control of the write clock. This chart together with the flow chart depicted in FIG. 26 provides an explanation of the "write" operation. ##SPC21## ##SPC22## ##SPC23## ##SPC24## ##SPC25## ##SPC26## ##SPC27## ##SPC28## ##SPC29## ##SPC30##

"Read A Record" Microprogram

This program employs the "read a record" clock RR which is a clock of monostable multivibrator stages similar to the "processor seek," the "instruction fetch," the "read," and the "write" clocks in which the timing out of the set state of a multivibrator turns on a different multivibrator in the clock.

The following table sets forth the relationship of the operations under the control of the "read a record" clock RR. This table together with the flow chart shown in FIG. 32 provides an explanation of the "read a record" operation. ##SPC31## ##SPC32## ##SPC33## ##SPC34## ##SPC35## ##SPC36## ##SPC37## ##SPC38## ##SPC39## ##SPC40## ##SPC41## ##SPC42##

"A Unit Test" (AUT) Microprogram

This program employs the "A unit test" clock (Aut) which is a clock comprised of monostable multivibrator stages similar to the "processor seek," the "instruction fetch," the "read," the "write," and the "read a record" clocks in which the timing out of the set state of a multivibrator turns on a different multivibrator in the clock.

The following table sets forth the relationship of the operations under the control of clock Aut. This table together with the flow chart depicted in FIG. 35 provides an explanation of the "A unit test" operation. ##SPC43## ##SPC44## ##SPC45## ##SPC46## ##SPC47## ##SPC48##

B Unit Scan (Column) Microprogram

This program employs the B unit scan clock CL which is a clock comprised of monostable multivibrator stages, similar to the "processor seek," the "instruction fetch," the "read," the "write," the "read a record" and the "A unit test" clocks in which the timing out of the set state of a multivibrator turns on a different multivibrator in the cock. ##SPC49## ##SPC50## ##SPC51## ##SPC52## ##SPC53##

B Unit Scan (Row) Microprogram

This program also employs the B unit scan clock CL. The following table sets forth the relationship of the operations under the control of clock CL. This table together with the flow chart depicted in FIG. 11 provides an explanation of the row B unit scan operation. ##SPC54## ##SPC55## ##SPC56## ##SPC57## ##SPC58##

While the invention has been particularly shown and described with reference to a preferred embodiment thereof, it will be understood by those skilled in the art that the foregoing and other changes in form and details may be made therein without departing from the spirit and scope of the invention.

* * * * *

Current U.S. Class:	710/46
Current International Class:	G06F 13/12 (20060101); G06f 015/00 ()
Field of Search:	340/172.5 235/157