USRE27251E - Memory protection system - Google Patents

Abstract

IN A DATA PROCESSING SYSTEM, BLOCKS OF ADDRESSES IN A MAIN MEMORY ARE RESERVED TO PREDETERMINED USERS. AN AUXILIARY MEMORY HOLDS A KEY FOR EACH BLOCK OF THE MAIN MEMORY. DURING A MEMORY ACCESSING OPERATION, THE KEY THAT CORRESPONDS TO THE ADDRESSED BLOCK IN MAIN MEMORY IS READ FROM THE AUXILIARY MEMORY AND COMPARED WITH THE KEY ASSIGNED TO THE USER. IN THE EVENT OF A MISMATCH, THE USER IS PREVENTED FROM ALTERING THE CONTENTS AT THE ADDRESSED LOCATION IN THE MAIN MEMORY. THE INVENTION PROVIDES A SIMPLE AND DIRECT RELATIONSHIP BETWEEN EACH ADDRESS IN THE AUXILIARY MEMORY AND THE CORRESPONDING BLOCK OF ADDRESSES IN THE MAIN MEMORY. IN THE EMBODIMENT OF THE INVENTION TO BE DESCRIBED IN DETAIL, THE MAIN MEMORY INCLUDES FERRITE CORES THAT ARE SELECTED BY THE COINCIDENCE OF CURRENTS ON X AND Y DIMENSION WIRES. IN THE AUXILIARY MEMORY, A SINGLE WORK WIRE IS ENERGIZED TO SELECT CORES OF AN ADDRESSED WORD. EACH X DIMENSION WIRE OF THE MAIN MEMORY IS CONNECTED

TO CONDUCT IN SERIES WITH AN INDIVIDUAL WORD WIRE OF THE AUXILIARY MEMORY. THUS, ENERGIZING AN X DIMENSION WIRE TO SELECT ANY OF THE ADDRESSES REPRESENTED BY THE CORES ON THE WIRE SIMULTANEOUSLY ENERGIZES THE APPROPRIATE WORD WIRE IN THE AUXILIARY MEMORY FOR READING THE MEMORY PROTECT KEY.

Description

' DeG. 21, 1971 G. M. AMDAHL El-AL MEMORY PROTECTION SYSTEM Original Filed Dec. 31, 1963 2 Sheets-Sheet 1 XIZB Z1 52 Z2 53 Z3 54 16' 1| CPU CONTROL LINES 15 ZERO CPU TEST FIG. 2 TAG I6 T ZTAGERIVERS RECODE MEM a TAG REG ZERO RESET T TEST l RETAIN C0DE & Y 21 CPU DATA 12 i 10 a s A M A TAG A 18 19 11 20 s M 1/0 x 5 TAG B A a D H/ c TAG c o TAG o STROBE i i l Co z TAG Z A A Q N V DRIVERS DRIVERS NVENTORS GENE M. AMDAHL EDWIN D. COUNCILL ROBERT J. FLAHEHTY JOSEPH J. ZAGURSKY A TTOR E Y United States Patent 27,251 MEMORY PROTECTION SYSTEM Gene M. Amdahl, Saratoga, Calif., Edwin D. Counclll, Wappingers Falls, N.Y., Robert J. Flaherty, Pleasant Valley, N.J., and Joseph J. Zagursky, Shelburne, Vt., assignors to International Business Machines Corporation, New York, N.Y.

Original No. 3,328,765, dated June 27, 1967, Ser. No. 334,714, Dec. 31, 1963. Application for reissue June 23, 1969, Ser. No. 846,984

Int. Cl. G06f 9/18 US. Cl. 340-1725 8 Claims Matter enclosed in heavy brackets appears in the original patent but forms no part of this reissue specification; matter printed in italics indicates the additions made by reissue.

ABSTRACT OF THE DISCLOSURE In a data processing system, blocks of addresses in a main memory are reserved to predetermined users. An auxiliary memory holds a key for each block of the main memory. During a memory accessing operation, the key that corresponds to the addressed block in main memory is read from the auxiliary memory and compared with the key assigned to the user. In the event of a mismatch, the user is prevented from altering the contents at the addressed location in the main memory.

The invention provides a simple and direct relationship between each address in the auxiliary memory and the corresponding block of addresses in the main memory. In the embodiment of the invention to be described in detail, the main memory includes ferrite cores that are selected by the coincidence of currents on X and Y dimension wires. In the auxiliary memory, a single word wire is energized to select cores of an addressed word. Each X dimension wire of the main memory is connected to conduct in series with an individual word wire of the auxiliary memory. Thus, energizing an X dimension wire to select any of the addresses represented by the cores on the wire simultaneously energizes the appropriate word wire in the auxiliary memory for reading the memory protect key.

Electronic data handling apparatus utilizes a memory for storing data. A memory usually comprises a plurality of addressable storage locations, each adapted to store an item of data generally called a word, in the form of a plurality of binary bits. Each word location has an address which defines its position in the memory and access to that location for the purposes of storing a word therein or reading out a word previously stored is gained by specifying the proper address along with a command or instruction specifying the operation to be performed at the specified address. It often happens that there may be stored in memory two or more independent programs at the same time. These programs may 'be operated at different times by one or by different persons. There may be interference between two programs whereby one program may cause changes or deletions of information stored for use under another program. It might be, for instance, that one program would call for storage of information in a block of memory registers overlapping a block already in use and containing information intended for use with the other program. The present invention provides a system "ice whereby such interference is prevented. To better illustrate this concept, let us consider the following situation:

For the purpose of simplicity, let it be assumed that programs A and B designed to be noninterfering are stored in the main memory. It is intended then that during the operation of program A only those locations assigned to program A be accessed and that words at these locations be altered or not only in accordance with program A. The same is true of program B. If through some error, possibly a programming error, during the operation of program A a location assigned to program B is accessed, means must be provided to prevent the alteration of the word stored in this program B location by the execution of program A. It is precisely to such a means that this invention is directed. For the purposes of this specification and claims, it should be considered that the main memory is effectively divided into a plurality of blocks, each of the blocks comprising a plurality of words. Under the influence of the master control program, a plurality of blocks may be assigned to a particular program.

With the above in mind it may be stated that the main object of the present invention is, in general, achieved in accordance with the present invention by providing an electronic data handling apparatus comprising a main memory for storing blocks of words therein, each block being associated with a particular program to be executed by said apparatus, an auxiliary memory, means to store in said auxiliary memory individual first codes identifying each of said blocks of words, means to access a word in said main memory, means responsive to accessing of said word to access the first code associated therewith, means to store a second code indicative of the program under execution by said apparatus, means to monitor said first and second codes and means responsive to said monitoring to control the alteration of said accessed word. More specifically, the present invention provides an X-Y select memory comprising a main memory and an auxiliary memory, said auxiliary memory comprising a matrix of cores divided into groups, one group for each block of words in. main memory, each group storing a first code identifying the program to which its associated block has 'been assigned, means to store a second code identifying the program currently being executed, means to access a word in main memory and to simultaneously access the group of cores associated with said word to (1) read out the first code from said group of cores and (2) read out the accessed word, means to compare said first and second cores and means responsive to a favorable or an unfavorable comparison therebetween to control the alteration of said accessed word. Provided a favorable comparison is indicated, the accessed word may be altered by the program. If an unfavorable comparison is indicated, the accessed word is protected against such alteration and is effectively restoredin its original location in main memory.

It is therefore the main object of the present invention to provide a memory protect feature for electronic data handling apparatus whereby addressable locations in the apparatus memory are protected from improper use.

More specifically, it is an object of the present invention to provide a system whereby interference between various programs simultaneously stored in memory may be prevented.

Another object of the present invention is to provide means in such a system whereby the protective feature is achieved by a code comparison scheme in which accessing a word in memory generates a code associated therewith which code is compared with a code identifying the program currently being executed and the result of said comparison controls the alteration of said accessed word.

Another object of the invention is to accomplish the memory protection function without sacrifice of memory speed.

These and other objects of this invention will become parent from a more detailed description of the accomrnying drawings.

In the drawings: FIG. 1 is a view of a special core plane comprising plurality of groups of cores each of the groups storing code or tag associated with a particular coordinate main memory;

FIG. 2 is a diagrammatic representation of the means r which the memory protection feature is achieved in :cordance with the present invention; and

FIG. 3 is a diagrammatic representation showing more ecifically the code comparison feature and memory 'otection feature constructed in accordance with the 'esent invention.

FIG. 4 is a waveform chart showing basic timings. Referring to FIGS. 1 and 2, there is shown in diagramatic form an X-Y select main memory 10, which may 2 in the form of a three-dimensional core array, to- ;ther with a special core plane 11. It should be under- 30d that for the purposes of illustration only the agrammatic representations of the three-dimensional re array the X, Y and Z drivers and peripheral rcuitry associated therewith are shown. Reading and ."iting into the memory is done in conventional fashion cept for those provisions which are essential to the emory protection feature. A conventional pulse proam uses a staggered read feature in which the X Ilse is applied earlier than the Y pulse. The special core ane 11 is shown in association with the X drive conrctors of the main memory 10 in FIG. 2. Referring to [G. 1, there is shown a more detailed illustration of is special core plane. In FIG. 1, it may be assumed that the three-dimen- Jnal matrix is effectively a 128 by 256 by 36 array, e 128 being along the X coordinate and the 256 along e Y coordinate and the 36 along the Z coordinate. ich an array may store 32,768 words (128 times 256), .ch word having 36 bits. The memory would then have .,768 word addresses. Each X coordinate would be immon to 256 word addresses. In FIG. 1, the X codinate lines are identified from X through X The ecial core plane is to store memory tags. These tags ill be in the form of individual four bit codes. Each X 1e in this special core plane is associated with four lres. Taking the X line for example, a particular binary de or memory tag will be stored in the four cores sociated therewith and consequently each of the 256 3rd addresses associated with the X line will therere be associated with this same four bit binary code. )r simplicity sake let it be assumed that the master |ntrol program which is stored in section M (see FIG. of main memory has assigned the X and X word ldresses (512 word addresses in all) to program A. gain in FIG. 2, program A is shown as stored in the ock identified by A. Means are provided for storing the four cores associated with the X line andthe ur cores associated with the X line the same four t binary code. During the execution of program A, ock A will be accessed by coordinate addresses includg various Y lines and the X or the X lines. When ock A is accessed during the execution of program A, word address in block A is accessed and the four bit Ide associated with program A is read out from the ecial core plane. Note the fact that all of the X lines the special core plane are threaded back through the ur cores. These X lines carry one-half select current hich by virtue of this threading provides full select curnt to the four cores in the special core plane and llf select current for main memory. The four bit code read out to the sense amplifiers 12 and the gate 13 the memory tag register 14, at X pulse time, slightly .rlier than the readout of the main memory, which :curs at Y pulse time. The sense lines associated with e cores in the special core plane are identified as S S S and S During the execution of program A, the CPU stores in the CPU tag register 15 the code or tag which has been assigned to program A. The contents of registers 14 and 15 are monitored by compare circuit 16, zero test circuit 16' and zero test circuit 16". The zero test circuits may be as simple as AND circuits. If the tag stored in register 14 is the same as that stored in register 15 the compare circuit indicates a favorable comparison which here is identified as YES. If the tag stored in register 15 is zero, or if the tag stored in register 14 is zero, comparison is unnecessary and the YES signal is forced. If the comparison is unfavorable, it is indicated here as NO. Let us assume, for instance, that during the execution of program A an X line is addressed which is associated with block B. This would result in storage in memory tag register 14 of the code associated with block B in memory 10 which of course is different than the code associated with block A stored in register 15. Consequently, there would be a NO answer given by the comparison circuit 16. This would condition gate 17 and decondition gate 21. The word accessed in memory 10 would then be gated from the sense amplifier 18 at-strobing time to the memory data register 19. The contents of register 19 then would be gated out by gate 20 at C time, causing the Z drivers 60 to restore the erroneously accessed word in the addressed word location at write time. Therefore, the accessed word under these conditions would not be altered but would be protected from alteration. If, however, during the execution of program A, the X line were accessed, the proper tag for program A would be read out to the memory tag register 14 and the comparison circuit 16 would provide a YES answer. This, then, would condition AND gate 21 and decondition AND gate 17. Now, under these circumstances, it is seen that the word which is accessed is blocked at strobing time by AND gate 17 and the CPU data is gated through AND gate 21 to MDR 19. At C time this CPU data is read back into the accessed word location and consequently the previous information stored therein is altered.

Thus, the overall general operation of the system is achieved as explained above. The main object of the invention is to prevent interference between two programs. The block M of main memory 10 is used to identify the memory registers which store the master control program. If programmer A requires ten blocks of registers for the execution of program A, master control will assign ten unused blocks and will in addition assign to this program an unused code or tag. Then, under control of master control, a store tag instruction is executed. This is best illustrated by FIG. 2. The gate 22 is conditioned by a =RECODE signal and the gate 15 is deconditioned by a RETAIN CODE signal, both signals being generated responsive to this instruction. All of the X lines associated with block A are sequently addressed along with any Y line also associated with block A. On the read cycle, one-half select read current supplied to the X line results in full select current being applied to the four cores, associated therewith. This causes read out of any previously stored code in these four cores, if any, which code or tag is sensed by the sense lines 8 -8 and supplied to the sense amplifiers 12. However, AND gate 13 blocks this code from the memory tag register because the RETAIN code line is down. Effectively then these four cores have been reset. Since gate 22 is conditioned, the code or tag supplied by the CPU to gate 22 is gated into the memory tag register 14. On the write cycle, the contents of register 14 are stored in these four cores through the functioning of the Z drivers 53. Since during write time the current on the X line is full select write current, the Z drivers effectively function to provide inhibit current or no current as the case may be, depending on whether a 1 or 0 is to be stored in a given core. Each one of the X lines associated with program A and with block A are similarly addressed until all of these X lines store the code assigned to program A. The same is done for the other programs B, C, and D. Of course, the memory tag register 14 is reset after the execution of the store tag instruction associated with a given program.

Reference is now made to FIG. 3 to show in more detail the means by which the CPU tag and the memory tag are compared and the results of this comparison on the memory data register (MDR). In discussing the logic associated with this circuitry, it will be assumed that binary ones give a plus voltage and binary zeros a minus voltage. In this figure, the four sense amplifiers 23-26 are those which are identified by numeral 12 in FIG. 2. Each of the four stages in the memory tag register 14 of FIG. 2 includes as shown in FIG. 3 the three AND gates 22, 13 and 27. AND gate 27 is not shown in FIG. 2. but it is of course associated as can be seen here with the RESET line. To reset any particular stage in the memory tag register the RESET line is driven minus. During a RECODE mode, AND gate 22 is conditioned by the RECODE signal to admit on the CODE line the bits supplied by the CPU. As previously explained during this RECODE mode, the memory tag register stores the tag which is to be stored in the respective X lines in the special core plane. During the RETAIN code mode, the RETAIN code line conditions AND gate 13- to permit entry into the memory tag register of the code or tag read out from an accessed X line and stored in the four cores associated with that line in the special core plane. 2 8 is a logical block which functions as an OR-INVERT circuit. Its output is minus when any one of the AND gates 13, 22 and 27 are unblocked and plus when all of these gates are blocked. The AND gates of course provide plus outputs therefrom only when a coincidence of plus inputs are provided thereto. If, now we assume a one input to sense amplifier 23, the output therefrom will be minus to the inverter 30 which provides at the output a plus to condition AND gate 13. If we are in the retain code mode then AND gate 13 is unblocked to provide a plus input to block 28. The output from the OR-INVERT 28 is then minus. Connection through line 34 is made to the appropriate Z driver 53 associated with a special core plane. At write time then this particular Z driver will restore a one back in the associated core in the special core plane. The output from inverter 29 is plus which in cooperation with the reset line being a plus unblocks AND gate 27 to latch this particular stage in the one state.

The compare circuit 16 of FIG. 2 essentially consists of two AND gates 35 and 36, their outputs being connected to the input to the OR-INVERT circuit 37. Assuming that the latch 38 stores a one and the corresponding stage of the CPU tag register 15 is a one, then it can be seen that AND gate 36 is blocked as is AND gate 35. The CPU tag register 15 consists of four stages each having complementary outputs therefrom. Consequently if a particular stage stores a one, AND gate 36 is conditioned and if it stores a zero, AND gate 35 is conditioned. Under the circumstances which we are assuming here, that is, a one from the register 15 and a one from the register 14, then both gates 35 and 36 are blocked. The output from these gates provides a negative input to 37 and a plus output therefrom. Consequently, when a comparison between two digits provides a favorable comparison, the output from 37 will be plus. Assuming now that there is a favorable comparison from all four stages of the registers 14 and 15, it can be seen that AND-INVERT circuit 39 will provide a minus output therefrom. The output from 39 is fed to the inputs to the AND- INVERT circuits 40 and 41. Under the control of the CPU, the decision available and store signals are generated to raise their respective lines. The decision available line is fed to the input to circuit 40 and the input to AND-INVERT circuit 42. The store signal is fed to the inputs to circuits 42 and 43. Assuming now a favorable comparison and therefore the output of 39 is minus, it can be seen that the outputs from circuits 4(] and 41 are both plus. The output from AND-INVERT 43 will be minus, the output from circuit 42 will be minus and the output from inverter 44 will be plus. Consequently, when all four bits of the memory tag compare favorably with all four bits from the CPU tag, the output on line 45 will be minus and on 46 will be plus. AND gate 47 will be blocked and AND gate 48 will be conditioned. AND gates 47, 48 and 49 together with OR-INVERT 50 and INVERT 51 comprise each stage of the memory data register 19. There are for a 36 bit word, 36 such stages. Shown here in this figure is simply one stage which can accommodate one bit of the 36 supplied from the sense amplifier output of the memory 10 or one bit of the 36 data bits supplied by the CPU. AND gate 37 corresponds to AND gate 17 in FIG. 2. and AND gate 48 corresponds to AND gate 21 in FIG. 2. Again, the reset line goes negative on reset and is supplied to AND gate 49. The reset line here is the same as the reset line to the MDR in FIG. 2. Therefore, under these conditions, that is, a favorable comparison, AND gate 48 is unblocked so that the memory data register 19 of FIG. 2 stores the CPU data. Each stage is essentially a latch which is similar to the latches which comprise the stages of the memory tag register, one stage of which is identified at 38 in this figure. When this particular latch 52 in the MDR stores a one, the output from INVERT 51 is a plus and the input thereto is a minus. The Z driver which is connected to the line between circuits 50 and 51 is one of the Z drivers associated with the drivers in FIG. 2. The Z driver lines such a line 34 associated with the memory tag register is one of the Z drivers 53 associated with the special core plane.

If any bit position in the comparison circuit gives an unfavorable comparison, gate 47 is unblocked and gate 48 is blocked. The accessed word from memory 10 is then gated into MDR and finally restored back into the accessed location in memory.

FIG. 4 shows the timings for memory operation. Normal read selection in main memory is by an X half select pulse on line 53 followed after a small delay by a Y half select pulse shown on line 54. Normal write selection is by write half select pulses shown on lines 53 and 54 and a coincident inhibit half select pulse shown on line 55, applied selectively to control the 1 or 0 value.

During the read operation, the X read half select pulse alone, because of the two turns, is sufficient to provide output from the auxi'iary memory, as shown on line 56. The later applied Y read half select pulse completes selection of the word in main memory toprovide output as shown on line 57. A strobe timing as shown on line 58 is useful in defining main memory output signals over memory noise.

While there have been shown and described and pointed out the fundamental novel features of the invention as applied to the preferred embodiment, it will be understood that various omissions and substitutions and changes in the form and details of the device illustrated and in its operation may be made by those skilled in the art Without departing from the spirit of the invention. It is the intention, therefore, to be limited only as indicated by the scope of the following claims.

What is claimed is:

1. An electronic data handling apparatus comprising a main memory for storing blocks of words therein and including a plurality of X and a plurality of Y drive lines, one of said plurality of drive lines for accessing blocks of words and the other for accessing words within said blocks, each block being associated with a particular program to be executed by said apparatus, an auxiliary memory including a plurality of groups of cores, each group being traversed by one of said one plurality of drive lines and each of said groups storing individual first codes each identifying a block of words whereby :cessing a word in said main memory accesses a group cores associated therewith to read out said accessed ord and said first code, means to store a second code entifying the program being executed by said appatus, means to access a Word in said main memory, id access means energizing one of said drive lines .ghtly ahead of the other whereby said first code is ad out ahead of a word in said main memory, means compare said first and second codes and means reonsive to said comparison to control the alteration of id accessed word. 2. An electronic data handling apparatus comprising 1 XY select main core memory for storing blocks of ulti'bit words therein, each block being associated with particular program to be executed by said apparatus, plurality of X and a plurality of Y drive lines, one F said plurality of drive lines for accessing blocks of ards and the other for accessing words within said ocks, an auxiliary memory including a plurality of cups of cores each group being traversed by one of id plurality of drive lines and each of said group Jring individual first codes each identifying a block 3 words, means to access a word in said main memory rd the first code associated therewith by selection of e XY coordinate drive lines for said word, said access cans energizing one of said drive lines slightly ahead the other whereby said first code is read out ahead a word in said main memory a multi-bit data register r storing said accessed word, a gate controlling the my of said accessed word into said register, means store a second code identifying the program being :ecuted by said apparatus, means to compare said first 1d second codes and means responsive to said comparison control the operation of said gate. 3. An electronic data handling apparatus as claimed claim 2 further including a second gate, a source F multi-bit data, said second gate controlling the storage said multi-bit data in said register, said means responl6 to said comparison of said first and second codes lergizing one of said gates and de-energizing the other F said gates to control the storage in said register of id multi-bit data or said accessed Word. 4. Apparatus as claimed in claim 2 wherein each of id drive lines is twice threaded through its associated cup of cores.

5. Apparatus as claimed in claim 2 further including register to store said accessed first code.

'6. An XY select memory comprising a main memory 1d an auxiliary memory, said auxiliary memory comising a matrix of cores divided into groups, one group r each block of words in main memory, each group Bring a first code identifying the program to which its sociated block has been assigned, means to store a cond code identifying the program currently being exelted, means to provide a first half select current to a ock of words in main memory and to simultaneously 'ovide full select current to the group of cores associated ith said word to read out the first code from said cup of cores, means to provide a second half select trrent, slightly delayed from said first half select current, hich together with said first half select current is effec- 16 to read out the accessed word, means to compare id first and second codes, and means responsive to a vorable or an unfavorable comparison therebetween control the alteration of said accessed Word.

7. An electronic data handling apparatus comprising a main memory for storing blocks of words therein, each block being defined by a predetermined number of high order bits of a main memory address and associated with a particular program to be executed by said apparatus,

an auxiliary memory comprising an array of storage elements forming word locations and having means for addressing an individual word from said predetermined number of bits, whereby each word location of said auxiliary memory corresponds to a particular block of said main memory,

means to store in said auxiliary memory individual first codes identifying programs associated with each of said blocks of words,

means to access a word in said main memory,

means responsive to accessing of said word in said main memory to access simultaneously the first code associated therewith in said auxiliary memory,

means to store a second code indicative of the program under execution by said apparatus,

means to compare said first and second codes, and

means responsive to said comparison to control the alteration of said accessed word.

8. In an electronic data handling apparatus including a main memory and means for assigning to programs using said apparatus blocks of main memory locations defined by a portion of an address supplied to the memory, wherein the improvement comprises,

an auxiliary memory comprising an array of storage elements for storing first codes identifying said programs,

means for accessing said auxiliary memory according to a portion of a main memory address to access a code defining a program to which the associated block is assigned,

means for storing a second code identifying the program using said memory,

means for comparing said first and second codes, and

means responsive to the comparison of said codes to control accessing said main memory.

References Cited The following references, cited by the Examiner, are of record in the patented file of this patent or the original patent.

UNITED STATES PATENTS 3,263,218 7/1966 Anderson 340-1725 3,264,615 8/1966 Case et a1. 340-172.5 3,284,776 11/1966 Freedman 340-1725 2,948,885 8/1960 Stuart-Williams 340-194 3,016,521 1/1962 McGuigan 340174 3,049,692 8/1962 Hunt 340146.1 3,069,658 12/1962 Kramskoy. 3,108,256 10/1963 Buchholz 340172.5 3,108,257 10/1963 Buchholz 340-172.5 3,292,'151 12/1966 Barnes et a1. 340172.5

FOREIGN PATENTS 3,114,049 9/1961 Germany.

RAULFE B. ZACHE, Primary Examiner 0 S. R. CHI RLIN, Assistant Examiner

Images