会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Method of processing a plurality of code systems
    • 处理多个代码系统的方法
    • US4692896A
    • 1987-09-08
    • US752853
    • 1985-07-08
    • Kousuke SakodaMasahiro KainagaHidehiko AkitaFumiya MurataYoshitake Nakaosa
    • Kousuke SakodaMasahiro KainagaHidehiko AkitaFumiya MurataYoshitake Nakaosa
    • G06F3/00G06F3/01G06F5/00G06F9/45
    • G06F3/018G06F5/00
    • A method of processing a plurality of different code systems for an information processing apparatus including an operating system, comprises a step of inputting a source program, and a compiling step of analyzing meaning of the source program to thereby create a series of instructions and data required for executing a processing equivalent to the meaning of the source program. The compiling step includes a sub-step of transforming character type constants to a first code system occupying region including a first number of bits and transforming character string constants to a second code system occupying a region including a number of bits which is equal to product of a sum of the number of characters of the character string constants plus one and multiplied with the first bit number so that character type variables designated in the source program correspond, respectively, to the region of the first bit number while a character type array corresponds to a region including a number of bits which is equal to a product resulting from multiplication of the first bit number with the number of elements of the array.
    • 一种用于处理包括操作系统的信息处理设备的多个不同代码系统的方法,包括输入源程序的步骤和分析源程序的含义的编译步骤,从而创建一系列指令和数据 用于执行等同于源程序含义的处理。 编译步骤包括将字符类型常数转换为包括第一位数的第一代码系统占用区和将字符串常数变换到占用包括多个位的位的区域的第二代码系统的子步骤,该位数等于 字符串常数加1的字符数与乘以第一位数的字符数之和,使得在源程序中指定的字符类型变量分别对应于第一位数的区域,而字符类型数组对应于 包括多个比特的区域,该比特数等于由第一比特数乘以阵列的元素的数目而产生的乘积。
    • 5. 发明授权
    • Method and apparatus for assigning processors in parallel computer system
    • 用于在并行计算机系统中分配处理器的方法和装置
    • US5485612A
    • 1996-01-16
    • US830673
    • 1992-02-04
    • Hiroshi OtaKousuke SakodaTetsuo SaitoEiichiro MaedaToshiyuki Yamamoto
    • Hiroshi OtaKousuke SakodaTetsuo SaitoEiichiro MaedaToshiyuki Yamamoto
    • G06F9/44G06F9/45G06F15/16G06F15/177G06F13/00G06F7/38
    • G06F8/456G06F8/45
    • A computer system has a plurality of processors, each having a local memory. An expression is represented by operands and operations and is expressed in a form of a tree. The operands are assigned to leaf nodes of the tree and the operations are assigned to interior nodes. Processors which store an operand represented by a leaf node are assigned to the leaf node. The tree is traced in a bottom-up fashion to determine a set of candidate processors to be assigned to each of the interior nodes. The candidate processors are determined from processors which are assigned to children nodes of each interior node in accordance with a majority method. The majority method is based on a rule that a processor which is most frequently assigned to the children nodes of an interior node is determined as a candidate processor. A root processor is assigned to a root node of the interior nodes from the candidate processors. The tree is then traced in a top-down fashion to determine definitely one processor to be assigned to each interior node from the candidate processors determined for the corresponding interior node.
    • 计算机系统具有多个处理器,每个处理器具有本地存储器。 表达式由操作数和操作表示,并以树的形式表示。 操作数分配给树的叶节点,并将操作分配给内部节点。 存储由叶节点表示的操作数的处理器被分配给叶节点。 树以自下而上的方式进行跟踪,以确定要分配给每个内部节点的一组候选处理器。 根据多数方法,从分配给每个内部节点的子节点的处理器确定候选处理器。 多数方法基于将内部节点的最常被分配给子节点的处理器确定为候选处理器的规则。 根处理器从候选处理器分配给内部节点的根节点。 然后以自顶向下的方式跟踪树,以确定从为相应的内部节点确定的候选处理器分配给每个内部节点的一个处理器。
    • 8. 发明授权
    • Data processing system with improved microsubroutine facility
    • 数据处理系统具有改进的微型程序设施
    • US4491912A
    • 1985-01-01
    • US358676
    • 1982-03-16
    • Masahiro KainagaKousuke SakodaHiroaki Nakanishi
    • Masahiro KainagaKousuke SakodaHiroaki Nakanishi
    • G06F9/22G06F9/26
    • G06F9/265
    • A data processing system having a first storage for storing therein microprograms; an address register for supplying an instruction address of a microprogram to be executed into said first storage; a stack unit having a stack area for storing therein a return address of the microprogram; a first control unit responsive to a microinstruction for instructing a microsubroutine call to store the return address of the microinstruction in the stack unit, and responsive to a microinstruction for instructing return from the microsubroutine to restore the return address of the microinstruction from said stack unit; a second control unit for monitoring an interrupt request; a second storage for saving therein the content of said stack unit; a status register having a field for indicating the acceptance of the interrupt request in the course of the execution of the microprogram, and a third control unit responsive to the detection of the interrupt request by the second control unit in the course of the execution of the microprogram to indicate the acceptance of the interrupt request by the status register and save the content of the stack unit in said second storage, and responsive to the presence of the indication in the status register indicating the acceptance of the interrupt request at the end of the execution of an interrupt processing program to restore the content of the second storage to said stack unit.
    • 一种数据处理系统,具有用于存储微程序的第一存储器; 地址寄存器,用于提供要执行的微程序的指令地址到所述第一存储器中; 堆叠单元,具有用于在其中存储微程序的返回地址的堆栈区域; 第一控制单元,响应于微指令,用于指示微程序调用将微指令的返回地址存储在堆栈单元中,并且响应于微指令指示从微程序返回以从所述堆栈单元恢复微指令的返回地址; 用于监视中断请求的第二控制单元; 用于在其中保存所述堆叠单元的内容的第二存储器; 状态寄存器,其具有用于在执行微程序的过程中指示接受中断请求的字段;以及第三控制单元,响应于在执行该程序的过程中由第二控制单元检测到中断请求 指示状态寄存器接受中断请求的微程序,并将堆栈单元的内容保存在所述第二存储器中,并且响应于在状态寄存器中是否存在指示中断请求的接受, 执行中断处理程序以将第二存储器的内容恢复到所述堆栈单元。