Claims Analysis
Total Claims: 2
Claim 1
Independent Claim
421 words
A memory mapping method in a data processing system wherein the memory comprises a variable number of modules (MO, M1, M2, M3) up to a maximum of P modules, each module including a plurality of addressable locations whose number may very by multiples of a basic capacity so that said memory may be considered as comprised of a variable number of addressable locations partitioned in a plurality of memory blocks, whose number may range up to a maximum number of possible blocks, each memory block having a number of locations equal to said basic capacity, each of said memory blocks belonging to one of said modules, said modules comprising a number of memory blocks which may differ from module to module, the addressing of a memory location involving the selection of the module containing said location by a directory having a number of addressable locations at least equal to said maximum number of said possible blocks, each directory location being related to a possible block and loaded with a binary code identifying the one of said modules to which the related block belongs, said binary code, when read out, generating a signal selecting the pertinent module, characterized in that the method comprises the following steps: (a) storing into said directory locations a first binary code identifying a first module as the module to which the related possible block belongs; (b) storing of test codes into predetermined memory locations each belonging to a different possible block; (c) reading out the contents of said predetermined locations to determine by comparison of said contents with at least one of said test codes whether or not said predetermined locations and the related blocks are present and belong to said first module; (d) storing a second binary code into the directory locations related to the possible blocks not belonging to said first module; (e) storing of test codes into a set of predetermined memory locations, each belonging to a different possible block of said blocks not belonging to said first module; (f) checking by reading said predetermined locations of said set and by comparison of their contents with at least one of said test codes whether or not said predetermined locations and the pertinent blocks are present and belong to said second module; (g) repeating in successive order steps (d), (e), (f), for all the subsequent P-2 modules; and (h) storing into directory locations related to possible blocks identified as not belonging to any module of a binary code, which when read, generates an overflow signal.
Claim 2
Dependent Claim
421 words
A memory mapping method in a data processing system wherein the memory comprises a variable number of modules (MO, M1, M2, M3) up to a maximum of P modules, each module including a plurality of addressable locations whose number may very by multiples of a basic capacity so that said memory may be considered as comprised of a variable number of addressable locations partitioned in a plurality of memory blocks, whose number may range up to a maximum number of possible blocks, each memory block having a number of locations equal to said basic capacity, each of said memory blocks belonging to one of said modules, said modules comprising a number of memory blocks which may differ from module to module, the addressing of a memory location involving the selection of the module containing said location by a directory having a number of addressable locations at least equal to said maximum number of said possible blocks, each directory location being related to a possible block and loaded with a binary code identifying the one of said modules to which the related block belongs, said binary code, when read out, generating a signal selecting the pertinent module, characterized in that the method comprises the following steps: (a) storing into said directory locations a first binary code identifying a first module as the module to which the related possible block belongs; (b) storing of test codes into predetermined memory locations each belonging to a different possible block; (c) reading out the contents of said predetermined locations to determine by comparison of said contents with at least one of said test codes whether or not said predetermined locations and the related blocks are present and belong to said first module; (d) storing a second binary code into the directory locations related to the possible blocks not belonging to said first module; (e) storing of test codes into a set of predetermined memory locations, each belonging to a different possible block of said blocks not belonging to said first module; (f) checking by reading said predetermined locations of said set and by comparison of their contents with at least one of said test codes whether or not said predetermined locations and the pertinent blocks are present and belong to said second module; (g) repeating in successive order steps (d), (e), (f), for all the subsequent P-2 modules; and (h) storing into directory locations related to possible blocks identified as not belonging to any module of a binary code, which when read, generates an overflow signal.