会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明专利
    • DE3751540T2
    • 1996-05-15
    • DE3751540
    • 1987-06-04
    • HITACHI LTD
    • KAGIMASA TOYOHIKOMATSUDA YOSHIKITAKAHASHI KIKUOYOSHIZUMI SEIICHI
    • G06F9/355G06F9/34G06F7/48
    • A data processor of this invention specifies (16, 17) either of a predetermined maximum length of an address (a bits) and the length of an address less than the former length and at least one register (7) having the number or length of bits of the maximum address length or greater (r bits). The data processor reads out lower-order d bits of said at least one register (7) specified by a first instruction to perform arithmetic operations, and writes the arithmetic result into a register element contained in said at least one register (7). Moreover, the processor reads out bits from a register element contained in said at least one register (7) specified in a second instruction to generate an a-bit address, and reads out d bits from a storage device (5) in response to the thus-generated address to write the d bits into either the storage device (5) or said register element. Accordingly, since the data length is consistently d bits irrespective of specified effective length of an address, direct data transfer is enabled between programs each having a different effective length of an address. Facilitating extension of the length of a storage address and assuring compatibility with conventional data processor.
    • 4. 发明专利
    • DE3751540D1
    • 1995-11-02
    • DE3751540
    • 1987-06-04
    • HITACHI LTD
    • KAGIMASA TOYOHIKOMATSUDA YOSHIKITAKAHASHI KIKUOYOSHIZUMI SEIICHI
    • G06F9/355G06F9/34G06F7/48
    • A data processor of this invention specifies (16, 17) either of a predetermined maximum length of an address (a bits) and the length of an address less than the former length and at least one register (7) having the number or length of bits of the maximum address length or greater (r bits). The data processor reads out lower-order d bits of said at least one register (7) specified by a first instruction to perform arithmetic operations, and writes the arithmetic result into a register element contained in said at least one register (7). Moreover, the processor reads out bits from a register element contained in said at least one register (7) specified in a second instruction to generate an a-bit address, and reads out d bits from a storage device (5) in response to the thus-generated address to write the d bits into either the storage device (5) or said register element. Accordingly, since the data length is consistently d bits irrespective of specified effective length of an address, direct data transfer is enabled between programs each having a different effective length of an address. Facilitating extension of the length of a storage address and assuring compatibility with conventional data processor.
    • 7. 发明专利
    • DE69033064T2
    • 1999-12-23
    • DE69033064
    • 1990-07-13
    • HITACHI LTD
    • TAKAHASI KIKUOKAGIMASA TOYOHIKOMATSUDA YOSHIKIMORI TOSHIAKI
    • G06F12/08G06F12/10G06F12/12G06F12/14
    • In a real storage allocation method, a real storage containing a plurality of real pages to which storage keys used for a storage protection purpose should be stored is allocated to a plurality of virtual pages of a virtual storage in accordance with the real pages. The real storage allocation method includes the steps of: (a) allocating one of plural split regions each having a first size which is obtained by subdividing one of plural real pages each having a second size equal to a value "n" ("n" being a positive integer) times higher than the first size, and which is provided with the real storage, to one virtual page having the first size employed to the virtual storage, and (b) repeating the step (a) in such a manner that one of plural split regions each having a first size which is obtained by subdividing other split regions within the one real page, or other real pages having the second sizes, is allocated to other virtual pages having the first pages. Furthermore, the real storage allocation method includes the steps of: (c) among a plurality of first sort of virtual pages each having a first size and a plurality of second sort of virtual pages each having a second size 1/n ("n" being a positive integer) times the first size, which have been previously prepared, when the real storage is allocated to the first sort of virtual page, allocating to the first sort of virtual page, a real page group constructed of one of the first sort of real pages, or "n" pieces of the second sort of continuous real pages which have not yet been allocated to the virtual page among a plurality of first sort of real storages each having the first virtual pages previously employed in the real storage and also a plurality of second sort of real pages each having the second size; and (b) when the real storage is allocated to the second sort of virtual page, allocating one of "n" pieces of split regions obtained by dividing one of the first sort of real page, or one of the second sort of real page.
    • 8. 发明专利
    • DE69033064D1
    • 1999-05-27
    • DE69033064
    • 1990-07-13
    • HITACHI LTD
    • TAKAHASI KIKUOKAGIMASA TOYOHIKOMATSUDA YOSHIKIMORI TOSHIAKI
    • G06F12/08G06F12/10G06F12/12G06F12/14
    • In a real storage allocation method, a real storage containing a plurality of real pages to which storage keys used for a storage protection purpose should be stored is allocated to a plurality of virtual pages of a virtual storage in accordance with the real pages. The real storage allocation method includes the steps of: (a) allocating one of plural split regions each having a first size which is obtained by subdividing one of plural real pages each having a second size equal to a value "n" ("n" being a positive integer) times higher than the first size, and which is provided with the real storage, to one virtual page having the first size employed to the virtual storage, and (b) repeating the step (a) in such a manner that one of plural split regions each having a first size which is obtained by subdividing other split regions within the one real page, or other real pages having the second sizes, is allocated to other virtual pages having the first pages. Furthermore, the real storage allocation method includes the steps of: (c) among a plurality of first sort of virtual pages each having a first size and a plurality of second sort of virtual pages each having a second size 1/n ("n" being a positive integer) times the first size, which have been previously prepared, when the real storage is allocated to the first sort of virtual page, allocating to the first sort of virtual page, a real page group constructed of one of the first sort of real pages, or "n" pieces of the second sort of continuous real pages which have not yet been allocated to the virtual page among a plurality of first sort of real storages each having the first virtual pages previously employed in the real storage and also a plurality of second sort of real pages each having the second size; and (b) when the real storage is allocated to the second sort of virtual page, allocating one of "n" pieces of split regions obtained by dividing one of the first sort of real page, or one of the second sort of real page.
    • 10. 发明专利
    • OPERATING PROGRAM CONDITION DISPLAY METHOD AND DEVICE
    • JP2000200188A
    • 2000-07-18
    • JP2000048907
    • 2000-02-21
    • HITACHI LTD
    • FUTAKI SEIJIKOJIMA KEIJIMATSUDA YOSHIKI
    • G06F9/06
    • PROBLEM TO BE SOLVED: To provide a display method easy to obtain the operating condition of a program by changing the display of an icon corresponding to the progress condition of a processing means regardless of the presence/absence of the change of a display position in the icon. SOLUTION: The icon showing the operating condition of the program is displayed on a display means. Then, a prescribed processing procedure is executed in response to an instruction to the icon. In this case, regardless of the presence/absence of the change of the display position in the icon, the display of the icon is changed corresponding to the progress condition of the processing means. For instance, in a display device 101, on an object display screen 102, three-dimensional graphics at the time of viewing various furniture inside an office space, a telephone 3104, a desk 3105, a terminal 3106 and a human body 3102 for instance, from a virtual TV camera are displayed beforehand. Objects are defined to the respective graphics. The graphics are utilized as the icons of the respectively corresponding objects.