中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

179 records (took 0.068 seconds)

    DATA PROCESSOR
    101.
    发明专利
    DATA PROCESSOR 失效

    公开(公告)号：JPS63247836A

    公开(公告)日：1988-10-14

    申请号：JP7965787

    申请日：1987-04-02

    Applicant: HITACHI LTD

    Inventor： HIRAYAMA YOICHI ,  KUROSAWA KENICHI ,  BANDO TADAAKI ,  NAKANISHI HIROAKI

    IPC: G06F9/44

    Abstract: PURPOSE:To perform the state recovery at high speed by designating one of two register files containing the same number of registers set in 1:1 correspondence as a master file according to the value of a selectable flag. CONSTITUTION:An instruction executing unit 215 contains a master register file 305 and a saving register file 310 which contain the same number of registers set in 1:1 correspondence. While a master buffer selection signal generator 315 contains a selectable flag to give an instruction for selection of the one of both files 305 and 310 that is first read out for each of those registers set opposite to each other. Then an executing environment set at a certain prolog time point is saved into the file 310 and said flag is set again to secure a state where the file 310 is read out as long as the processing is carried out with use of the file 305. Thus the executing environment is recovered at high speed.

    PROLOGUE PROCESSOR
    103.
    发明专利
    PROLOGUE PROCESSOR 失效

    公开(公告)号：JPS6275736A

    公开(公告)日：1987-04-07

    申请号：JP21487585

    申请日：1985-09-30

    Applicant: HITACHI LTD

    Inventor： KIRIYAMA KAORU ,  ABE SHIGEO ,  KUROSAWA KENICHI ,  BANDO TADAAKI ,  NAKANISHI HIROAKI

    IPC: G06F9/44

    Abstract: PURPOSE:To speed up the processing speed of a prologue processor by selecting an optimum argument by deciding the kinds of the argument and determining the address of the next executing sentence in accordance with the selected argument. CONSTITUTION:A tag discriminating/converting section 145 decides the kind of the argument and converts the argument into a previously fixed constant in accordance with the decision results. An arithmetic unit 146 receives the constant as an input B and the content of an operand data register 121 as another input A and sums both the inputs A and B. The summed result is inputted to a memory control unit 60 through an output signal line 50 and gate 51. Then the first address of an executing sentence having a head which is coincident with the kind of the argument of an inquiring sentence is read out from a tag index table 71 in a memory 70 by reading out the summed result and using the summed result as an address signal.

    PROLOGUE PROCESSOR
    104.
    发明专利
    PROLOGUE PROCESSOR 失效

    公开(公告)号：JPS6226543A

    公开(公告)日：1987-02-04

    申请号：JP16599885

    申请日：1985-07-29

    Applicant: HITACHI LTD

    Inventor： ABE SHIGEO ,  KUROSAWA KENICHI ,  HIRASAWA KOTARO

    IPC: G06F9/44 ,  C07C237/42 ,  G06F9/45

    Abstract: PURPOSE:To optimize the generation of an object program by showing a sending/receiving relation of an augument of a prologue program sentence by an oriented graph, checking a sequence relation between connected partial graph, and minimizing a saving operation of a register for storing the argument. CONSTITUTION:A prologue program 3 is converted to a connected partial graph 5 by a developing means 4, and from its graph 5, a sequencing table 7 is generated by a sequencing means 6 and an execution sequency of an instruction corresponding to each partial graph is indicated clearly, and in accordance with a sequence of the table 7, an instruction series (object program) 9 is generated by an instruction developing means 8. When the same variable exists in head or a body goal of the program, the means 4 converts a graph corresponding to a variable to one graph, and also collects graphs containing a variable and converts then to one graph, when plural variables exist, its oriented graph is processed in accordance with a prescribed sequency by the mans 6, a competition of a register of input/output parameters is eliminated and the number of instruction steps is reduced.

    HASH TREATMENT OF PROLOGUE MACHINE
    105.
    发明专利
    HASH TREATMENT OF PROLOGUE MACHINE 失效

    公开(公告)号：JPS61199123A

    公开(公告)日：1986-09-03

    申请号：JP3880585

    申请日：1985-03-01

    Applicant: HITACHI LTD

    Inventor： KIRIYAMA KAORU ,  ABE SHIGEO ,  KUROSAWA KENICHI ,  BANDO TADAAKI ,  NAKANISHI HIROAKI

    IPC: G06F9/44 ,  G06F17/30

    Abstract: PURPOSE:To perform hashing in a high speed to improve efficiency by reading out a hash value from a data storage area and allowing a function to act upon this hash value to obtain a value and indexing a table with an address obtained by adding the start address of the hash table to this obtained value. CONSTITUTION:A constant in a prologue program is expressed with constant information 1 consisting of a tag part 11 indicating the attribute and a data part 12 indicating the pointer address, and a hash value peculiar to the constant and an actual value 22 of the constant are stored in a data storage area 2 indicated by the pointer address of the data part 12. The hash value 21 is read out from the area 2 by the pointer address of the data part 12, and a prescribed function Fi is allowed to act upon the value 21 to obtain a value, and the start address of a hash table 3 is added to this obtained value to obtain an address on the table 3, and the table 3 is indexed by this address. Thus, hashing is performed in a high speed.

    Prologue machine
    106.
    发明专利
    Prologue machine 失效
    造型机

    公开(公告)号：JPS6155736A

    公开(公告)日：1986-03-20

    申请号：JP17680084

    申请日：1984-08-27

    Applicant: Hitachi Ltd

    Inventor： KIRIYAMA KAORU ,  ABE SHIGEO ,  KUROSAWA KENICHI ,  BANDO TADAAKI ,  NAKANISHI HIROAKI

    IPC: G06F9/44

    Abstract: PURPOSE: To eliminate the need for mapping at a separate area at release of a stack by setting a tag undefinition of an area of an unstable variable of an argument register to be set when a goal except the final goal of a clause has no separate solution.
    CONSTITUTION: A data is read from a memory 190 to an MRR180, a tag part is segmented through ALU120, 140 so as to discriminate whether a goal is the final goal or not. When the goal is not the final goal, a clause taking a predicate equal to the predicate of the goal as a head is searched. Whether or not another solution exists in the searched clause is discriminated. This operation is executed at each number to discriminate the tag part. When the tag is atom, the data corresponding to the tag is set as it is in the argument register 150 and when the tag is a variable vaf, the address of a large area variable provided on a local stack LS enters a data part of the register 150 as a pointer and when the tag is an unstable variable, undf is set to the register 150 and when the tag is the undf, the content of the register 150 is set with the undf.
    COPYRIGHT: (C)1986,JPO&Japio

    Abstract translation: 目的：为了消除在堆栈释放时在单独区域映射的需要，通过设置一个变量寄存器的不稳定变量的区域的标签未定义，除非子句的最终目标没有单独的解决方案 。 构成：将数据从存储器190读取到MRR180，通过ALU120,140分割标签部分，以便区分目标是否是最终目标。 当目标不是最终​​目标时，搜索一个将谓词等同于目标的谓词作为头的条款。 在所搜索的子句中是否存在另一个解决方案。 在每个数字处执行该操作以区分标签部分。 当标签是原子时，对应于标签的数据被设置在参数寄存器150中，并且当标签是变量vaf时，在本地堆叠LS上提供的大面积变量的地址输入到 寄存器150作为指针，并且当标签是不稳定变量时，undf被设置到寄存器150，并且当标签是undf时，寄存器150的内容被设置为undf。

Patent Agency Ranking