首页> 外国专利> DATA PROCESSING SYSTEM HAVING IMPROVED PROGRAM ALLOCATION AND SEARCH TECHNIQUE

DATA PROCESSING SYSTEM HAVING IMPROVED PROGRAM ALLOCATION AND SEARCH TECHNIQUE

机译:改进了程序分配和搜索技术的数据处理系统

摘要

1491692 Data processing HONEYWELL INFORMATION SYSTEMS Inc 8 Nov 1974 [8 Nov 1973] 48398/74 Heading G4A A data processing system comprises a main memory 108 (Fig. 1) containing routines, each consisting of a sequence of commands to be carried out in response to an instruction received on line 100 and a search table 106 containing, for each routine, an entry identifying the routine and including an address in main memory. If no entry is found for an instruction, the routine with the lowest activity is replaced by the requested routine. The six most significant bits of the instruction are fed by mask 102 to a start table point 104 which has 64 locations each with an address for entry in the table 106 (which has more than 64 locations). The entries are queued so that most recently used and least recently used entries are at opposite ends. Each entry in table 106 includes 5 parameters, (1) a search argument 110; (2) a P-pointer 111; (3) a link pointer 112; (4) H-pointer 113, and (5) a T-pointer 114. The search argument is used to indicate if there is a "hit" between an instruction received and the addressed entry. If there is the P-pointer is used to address the program memory 108. The link pointer indicates the next entry in a linked family of entries, the last member of the family having a zero link pointer. The H- and T- pointers indicate respectively the next more recently and the next less recently used entries. Head and tail pointers 118, 116 indicate the most recently used and least recently used entries in the table. If there is no hit and if the link pointer of the access entry is not zero the entry indicated by the link pointer is accessed to see if there is a hit, in which case its address is put in the table 104 of the initial address link family. This process is continued if there is no hit until the link pointer is zero when an entry is inserted in table 106 of the address indicated by the tail pointer unless the associated program is still active, the head pointer then being up-dated to indicate this entry.
机译:1491692数据处理霍尼韦尔信息系统公司1974年11月8日[1973年11月8日] 48398/74标题G4A数据处理系统包括一个包含例程的主存储器108(图1),每个例程均包含要响应执行的一系列命令在行100上接收到的指令和搜索表106包含针对每个例程的条目,该条目标识该例程并且在主存储器中包括地址。如果未找到指令条目,则活动最少的例程将替换为所请求的例程。指令的六个最高有效位由掩码102馈送到起始表点104,该起始表点104具有64个位置,每个位置都有一个要在表106中输入的地址(具有64个以上的位置)。条目排队,以便最近使用和最少使用的条目位于相反的两端。表106中的每个条目包括5个参数,(1)搜索参数110; (2)P指针111; (3)链接指针112; (4)H指针113,(5)T指针114。搜索参数用于指示在接收到的指令和寻址的条目之间是否存在“命中”。如果存在P指针,则用于对程序存储器108进行寻址。链接指针指示链接的条目族中的下一个条目,该族的最后一个成员具有零链接指针。 H指针和T指针分别指示最近使用的下一个条目和最近使用的下一个条目。头和尾指针118、116指示表中最近使用和最少使用的条目。如果没有命中,并且访问条目的链接指针不为零,则访问链接指针所指示的条目以查看是否存在命中,在这种情况下,其地址将放置在初始地址链接的表104中家庭。如果没有命中,则继续该过程,直到链接指针为零(当在尾指针所指示的地址的表106中插入一个条目时),除非关联的程序仍处于活动状态,然后对头部指针进行更新以指示该情况。条目。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号