公开(公告)号：US08694755B1

公开(公告)日：2014-04-08

申请号：US12725899

申请日：2010-03-17

Applicant: Kathirgamar Aingaran ,  Leslie D. Kohn ,  Robert C. Kunz ,  Jenn-Yuan Tsai

Inventor： Kathirgamar Aingaran ,  Leslie D. Kohn ,  Robert C. Kunz ,  Jenn-Yuan Tsai

IPC: G06F12/10

CPC classification number: G06F12/0284 ,  G06F12/10 ,  G06F12/1009 ,  G06F12/1027 ,  G06F2212/651

Abstract: An apparatus comprising an arbiter circuit, a translation circuit and a controller circuit. The arbiter circuit may be configured to generate one or more first control signals and a data write signal in response to an input signal and a read data signal. The translation circuit may be configured to generate a one or more second control signals in response to the one or more first control signals and the write address signal. The controller circuit may be configured to generate an address signal in response to the one or more second control signals.

Abstract translation: 一种包括调节器电路，平移电路和控制器电路的装置。 仲裁器电路可以被配置为响应于输入信号和读取数据信号而产生一个或多个第一控制信号和数据写入信号。 翻译电路可以被配置为响应于一个或多个第一控制信号和写入地址信号而产生一个或多个第二控制信号。 控制器电路可以被配置为响应于一个或多个第二控制信号而产生地址信号。

公开(公告)号：US06609249B2

公开(公告)日：2003-08-19

申请号：US09986882

申请日：2001-11-13

Applicant: Robert C. Kunz ,  Peter J. Dahl

Inventor： Robert C. Kunz ,  Peter J. Dahl

IPC: G06F945

CPC classification number: G06F8/441

Abstract: The present invention is a method and apparatus for compiler optimization that determines the maximum number of live computer registers, or pressure point. The present invention improves the productivity of a software developer by reducing compilation time of a computer program. More particularly, the overhead required during compilation to search information to determine the maximum number of live registers is reduced. The present invention records the relevant events related to the execution of a computer program, as opposed to a comprehensive history of the read instructions and write instructions. Also, the present invention maintains information about the maximum number of live registers for any partition related to the execution of a computer program. The present invention may bound the required system resources required to determine the maximum number of live registers to the number of registers associated with the number of partitions.

Abstract translation: 本发明是一种用于编译器优化的方法和装置，其确定最大数量的实时计算机寄存器或压力点。 本发明通过减少计算机程序的编译时间来提高软件开发人员的生产率。 更具体地，降低了编译期间所需的开销以搜索信息以确定最大数量的实时寄存器。 本发明记录与执行计算机程序相关的相关事件，而不是读取指令和写入指令的综合历史。 此外，本发明保持关于与计算机程序的执行有关的任何分区的最大数量的实时寄存器的信息。 本发明可以将确定最大数量的实时寄存器所需的系统资源限制为与分区数量相关联的寄存器数量。

公开(公告)号：US09600412B1

公开(公告)日：2017-03-21

申请号：US13008287

申请日：2011-01-18

Applicant: Kathirgamar Aingaran ,  Leslie D. Kohn ,  Robert C. Kunz ,  Jenn-Yuan Tsai

Inventor： Kathirgamar Aingaran ,  Leslie D. Kohn ,  Robert C. Kunz ,  Jenn-Yuan Tsai

IPC: G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F12/02 ,  G06F12/10

CPC classification number: G06F12/0284 ,  G06F12/10 ,  G06F12/1009 ,  G06F12/1027 ,  G06F2212/651

Abstract: An arbiter circuit and a translation circuit. The arbiter circuit may be configured to generate a first address signal in a virtual memory space by arbitrating among a plurality of clients to access a physical memory space. The clients may be classified as either privileged clients or non-privileged clients. The physical memory space may comprise at least one secure space. The secure space may be used to protect data of the privileged clients from being accessed by the non-privileged clients. The translation circuit may be configured to generate a second address signal by translating a page in the virtual memory space into the physical memory space. The page may correspond to a particular one of the clients that won the arbitration. The page may translate into the secure space if the particular client is one of the privileged clients. The page may also translate outside the secure space if the particular client is one of the non-privileged clients.

公开(公告)号：US06317876B1

公开(公告)日：2001-11-13

申请号：US09328043

申请日：1999-06-08

Applicant: Robert C. Kunz ,  Peter J. Dahl

Inventor： Robert C. Kunz ,  Peter J. Dahl

IPC: G06F944

CPC classification number: G06F8/441

Abstract: The present invention is a method and apparatus for compiler optimization that determines the maximum number of live computer registers, or pressure point. The present invention improves the productivity of a software developer by reducing compilation time of a computer program. More particularly, the overhead required during compilation to search information to determine the maximum number of live registers is reduced. The present invention records the relevant events related to the execution of a computer program, as opposed to a comprehensive history of the read instructions and write instructions. Also, the present invention maintains information about the maximum number of live registers for any partition related to the execution of a computer program. The present invention may bound the required system resources required to determine the maximum number of live registers to the number of registers associated with the number of partitions.

Abstract translation: 本发明是一种用于编译器优化的方法和装置，其确定最大数量的实时计算机寄存器或压力点。 本发明通过减少计算机程序的编译时间来提高软件开发人员的生产率。 更具体地，降低了编译期间所需的开销以搜索信息以确定最大数量的实时寄存器。 本发明记录与执行计算机程序相关的相关事件，而不是读取指令和写入指令的综合历史。 此外，本发明保持关于与计算机程序的执行有关的任何分区的最大数量的实时寄存器的信息。 本发明可以将确定最大数量的实时寄存器所需的系统资源限制为与分区数量相关联的寄存器数量。