-
公开(公告)号:US4592011A
公开(公告)日:1986-05-27
申请号:US547268
申请日:1983-10-31
CPC分类号: G06F12/0684 , G06F12/0653
摘要: In a data processing system wherein a memory is comprised of an unknown plurality of memory blocks of a basic capacity, arranged in an unknown plurality of modules which have an unknown capacity multiple of the basic capacity, a method addresses the memory location which involves the selection of the module containing such locations by use of a directory having a plurality of addressable locations. The initial loading of the directory with codes corresponding to the real constituent of the memory is performed by writing into the directory locations a binary code assigning the related memory blocks to a hypothetical first module, writing test codes into memory locations each belonging to a different block, reading out the contents of the same memory locations and comparing such contents with the test codes to determine if a first module is present and if such memory locations and the pertaining blocks belong to the first module, writing into the directory locations whose related memory block do not belong to the first module a binary code assigning the related memory blocks to a hypothetical second module, writing test codes into memory locations each belonging to a different block assigned to the second module, reading out the contents of the same memory locations and comparing such contents with the test codes to determine if a second module is present and if such memory locations and related memory blocks belong to the second module, and repeating the above operations for further subsequent modules.
摘要翻译: 在一种数据处理系统中,其中存储器由未知的具有基本容量的多个存储块组成,其布置在具有未知容量倍数的基本容量的未知多个模块中,一种寻址涉及选择的存储器位置的方法 通过使用具有多个可寻址位置的目录来包含这些位置的模块。 通过向目录位置写入将相关存储块分配给假想的第一模块的二进制代码,将测试代码写入每个属于不同块的存储器位置来执行具有与存储器的实际组成部分对应的代码的目录的初始加载 读出相同存储器位置的内容,并将这些内容与测试代码进行比较以确定第一模块是否存在,并且如果这样的存储器位置和相关块属于第一模块,则写入相关存储块 不属于第一模块,将相关存储器块分配给假想的第二模块的二进制代码,将测试代码写入每个属于分配给第二模块的不同块的存储器位置,读出相同存储器位置的内容并比较 这些内容带有测试代码,以确定是否存在第二个模块,并且是否存在这样的存储器位置 ns和相关的存储器块属于第二个模块,并对后续的后续模块重复上述操作。