公开(公告)号：US20130046998A1

公开(公告)日：2013-02-21

申请号：US13212027

申请日：2011-08-17

申请人： Alexander B. Brown ,  Neil A. Campbell ,  Ryan J. Cocks

发明人： Alexander B. Brown ,  Neil A. Campbell ,  Ryan J. Cocks

IPC分类号： G06F1/26

CPC分类号： G06F1/3234 ,  G06F1/3287 ,  H04L12/6418 ,  Y02D10/171

摘要： A system and computer program product allocates energy entitlement to a logical partition (LPAR) executing on a data processing system. An energy entitlement allocation (EEA) utility enables an administrator to specify a minimum and/or maximum energy entitlement and An LPAR priority. When the relevant LPARs utilize the respective minimum energy entitlement based on respective energy consumption, the EEA utility determines whether the LPAR (and other LPARs) has satisfied a respective maximum energy entitlement. When the LPAR has not satisfied its maximum energy entitlement, the EEA utility allocates unused energy entitlement from the data processing system to the LPAR, according to an allocation policy. Additionally, the EEA utility dynamically adjusts a priority level for the LPAR to efficiently control resource allocation, according to the LPAR's energy consumption relative to its energy entitlement. In addition, the EEA utility is able to transfer unused energy entitlement to other data processing systems requiring further allocation of energy entitlement.

摘要翻译： 系统和计算机程序产品将能量权利分配给在数据处理系统上执行的逻辑分区（LPAR）。 能源权利分配（EEA）实用程序使管理员能够指定最小和/或最大能量权利和LPAR优先级。 当相关LPAR基于相应的能量消耗利用相应的最小能量权利时，EEA实用程序确定LPAR（和其他LPAR）是否已经满足相应的最大能量权利。 当LPAR尚未满足其最大能源权限时，EEA实用程序根据分配策略将数据处理系统中的未使用的能源权利分配给LPAR。 此外，根据LPAR相对于其能源权益的能耗，EEA实用程序可动态调整LPAR的优先级，以有效控制资源分配。 此外，EEA实用程序能够将未使用的能源权利转移到需要进一步分配能源权利的其他数据处理系统。

公开(公告)号：US20130047006A1

公开(公告)日：2013-02-21

申请号：US13621223

申请日：2012-09-15

申请人： Alexander B. Brown ,  Neil A. Campbell ,  Ryan J. Cocks

发明人： Alexander B. Brown ,  Neil A. Campbell ,  Ryan J. Cocks

IPC分类号： G06F1/26

CPC分类号： G06F1/3234 ,  G06F1/3287 ,  H04L12/6418 ,  Y02D10/171

摘要： A method allocates energy entitlement to a logical partition (LPAR) executing on a data processing system. An energy entitlement allocation (EEA) utility enables an administrator to specify a minimum and/or maximum energy entitlement and an LPAR priority. When the relevant LPARs utilize the respective minimum energy entitlement based on a respective energy consumption, the EEA utility determines whether the LPAR(s) has satisfied a respective maximum energy entitlement. When the LPAR has not satisfied its maximum energy entitlement, the EEA utility allocates unused energy entitlement from the data processing system to the LPAR, according to an allocation policy. Additionally, the EEA utility dynamically adjusts a priority level for the LPAR to efficiently control resource allocation, according to the LPAR's energy consumption relative to its energy entitlement. In addition, the EEA utility is able to transfer unused energy entitlement to other data processing systems requiring further allocation of energy entitlement.

摘要翻译： 一种方法将能量权利分配给在数据处理系统上执行的逻辑分区（LPAR）。 能源权利分配（EEA）实用程序使管理员能够指定最小和/或最大能量权利和LPAR优先级。 当相关LPAR利用相应的能量消耗的相应的最小能量权利时，EEA实用程序确定LPAR是否已经满足相应的最大能量权利。 当LPAR尚未满足其最大能源权限时，EEA实用程序根据分配策略将数据处理系统中的未使用的能源权利分配给LPAR。 此外，根据LPAR相对于其能源权益的能耗，EEA实用程序可动态调整LPAR的优先级，以有效控制资源分配。 此外，EEA实用程序能够将未使用的能源权利转移到需要进一步分配能源权利的其他数据处理系统。

公开(公告)号：US08954765B2

公开(公告)日：2015-02-10

申请号：US13621223

申请日：2012-09-15

申请人： Alexander B. Brown ,  Neil A. Campbell ,  Ryan J. Cocks

发明人： Alexander B. Brown ,  Neil A. Campbell ,  Ryan J. Cocks

IPC分类号： G06F1/00 ,  G06F1/32 ,  H04L12/64

CPC分类号： G06F1/3234 ,  G06F1/3287 ,  H04L12/6418 ,  Y02D10/171

摘要： A method allocates energy entitlement to a logical partition (LPAR) executing on a data processing system. An energy entitlement allocation (EEA) utility enables an administrator to specify a minimum and/or maximum energy entitlement and an LPAR priority. When the relevant LPARs utilize the respective minimum energy entitlement based on a respective energy consumption, the EEA utility determines whether the LPAR(s) has satisfied a respective maximum energy entitlement. When the LPAR has not satisfied its maximum energy entitlement, the EEA utility allocates unused energy entitlement from the data processing system to the LPAR, according to an allocation policy. Additionally, the EEA utility dynamically adjusts a priority level for the LPAR to efficiently control resource allocation, according to the LPAR's energy consumption relative to its energy entitlement. In addition, the EEA utility is able to transfer unused energy entitlement to other data processing systems requiring further allocation of energy entitlement.

摘要翻译： 一种方法将能量权利分配给在数据处理系统上执行的逻辑分区（LPAR）。 能源权利分配（EEA）实用程序使管理员能够指定最小和/或最大能量权利和LPAR优先级。 当相关LPAR利用相应的能量消耗的相应的最小能量权利时，EEA实用程序确定LPAR是否已经满足相应的最大能量权利。 当LPAR尚未满足其最大能源权限时，EEA实用程序根据分配策略将数据处理系统中的未使用的能源权利分配给LPAR。 此外，根据LPAR相对于其能源权益的能耗，EEA实用程序可动态调整LPAR的优先级，以有效控制资源分配。 此外，EEA实用程序能够将未使用的能源权利转移到需要进一步分配能源权利的其他数据处理系统。

公开(公告)号：US20080209175A1

公开(公告)日：2008-08-28

申请号：US11904601

申请日：2007-09-27

申请人： Alexander B. Brown

发明人： Alexander B. Brown

IPC分类号： G06F9/30

CPC分类号： G06F9/30127 ,  G06F9/45504

摘要： A target computing system 10 is adapted to support a register window architecture, particularly for use when converting non-native subject code 17 instead into target code 21 executed by a target processor 13. A subject register stack data structure (an “SR stack”) 400 in memory has a plurality of frames 410 each containing a set of entries 401 corresponding to a subset of subject registers 502 of one register window 510 in a subject processor 3. The SR stack 400 is accessed by the target code 21 executing on the target processor 13. The SR stack 400 stores a large plurality of such frames 410 and thereby avoids overhead such as modelling automatic spill and fill operations from the windowed register file of the subject architecture. In one embodiment, a target computing system 10 having sixteen general purpose working registers is adapted to support a register window architecture reliant upon a register file containing tens or hundreds of subject registers 502.

摘要翻译： 目标计算系统10适于支持寄存器窗口体系结构，特别是用于在将非本地主题代码17转换成由目标处理器13执行的目标代码21时使用。 存储器中的主体寄存器堆栈数据结构（“SR堆栈”）400具有多个帧410，每个帧410包含与对象处理器3中的一个寄存器窗口510的主题寄存器502的子集相对应的条目集401。 SR堆栈400由目标处理器13上执行的目标代码21访问。 SR堆栈400存储大量这样的帧410，从而避免诸如从主体架构的窗口化寄存器文件建模自动溢出和填充操作的开销。 在一个实施例中，具有十六个通用工作寄存器的目标计算系统10适于支持依赖于包含数十或数百个主体寄存器502的寄存器文件的寄存器窗口架构。

公开(公告)号：US08381168B2

公开(公告)日：2013-02-19

申请号：US13180024

申请日：2011-07-11

申请人： Alexander B. Brown

发明人： Alexander B. Brown

IPC分类号： G06F9/44

CPC分类号： G06F9/30127 ,  G06F9/45504

摘要： A target computing system 10 is adapted to support a register window architecture, particularly for use when converting non-native subject code 17 instead into target code 21 executed by a target processor 13. A subject register stack data structure (an “SR stack”) 400 in memory has a plurality of frames 410 each containing a set of entries 401 corresponding to a subset of subject registers 502 of one register window 510 in a subject processor 3. The SR stack 400 is accessed by the target code 21 executing on the target processor 13. The SR stack 400 stores a large plurality of such frames 410 and thereby avoids overhead such as modelling automatic spill and fill operations from the windowed register file of the subject architecture. In one embodiment, a target computing system 10 having sixteen general purpose working registers is adapted to support a register window architecture reliant upon a register file containing tens or hundreds of subject registers 502.

摘要翻译： 目标计算系统10适用于支持寄存器窗口体系结构，特别是用于在将非本地主题代码17转换成由目标处理器13执行的目标代码21时使用。将主体寄存器堆栈数据结构（SR堆栈）400 存储器具有多个帧410，每个帧410包含对应于主体处理器3中的一个寄存器窗口510的主题寄存器502的子集的条目401的集合.SR堆栈400被目标处理器13上执行的目标代码21访问 SR堆栈400存储大量这样的帧410，从而避免诸如从主体架构的窗口寄存器文件建模自动溢出和填充操作的开销。 在一个实施例中，具有十六个通用工作寄存器的目标计算系统10适于支持依赖于包含数十或数百个主体寄存器502的寄存器文件的寄存器窗口架构。

公开(公告)号：US08091076B2

公开(公告)日：2012-01-03

申请号：US12237945

申请日：2008-09-25

申请人： Alexander B. Brown ,  Geraint M. North ,  Frank Thomas Weigel ,  Gareth Anthony Knight

发明人： Alexander B. Brown ,  Geraint M. North ,  Frank Thomas Weigel ,  Gareth Anthony Knight

IPC分类号： G06F9/45

CPC分类号： G06F9/45516 ,  G06F8/52 ,  G06F9/4484 ,  G06F9/4486

摘要： A native binding technique is provided for insetting calls to native functions during translation of subject code to target code, such that function calls in the subject program to subject code functions are replaced in target code with calls to native equivalents of the same functions. Parameters of native function calls are transformed from target code representations to be consistent with native code representations, native code calling conventions, and native function prototypes.

摘要翻译： 提供本机绑定技术，用于在将主题代码转换为目标代码期间对本地函数进行调用，以使主题程序中的主题代码函数的函数调用在目标代码中被替换为具有相同功能的本机等价物的调用。 本机函数调用的参数从目标代码表达式转换为与本地代码表示，本地代码调用约定和本机函数原型一致。

公开(公告)号：US20110271080A1

公开(公告)日：2011-11-03

申请号：US13180024

申请日：2011-07-11

申请人： Alexander B. Brown

发明人： Alexander B. Brown

IPC分类号： G06F9/06

CPC分类号： G06F9/30127 ,  G06F9/45504

摘要： A target computing system 10 is adapted to support a register window architecture, particularly for use when converting non-native subject code 17 instead into target code 21 executed by a target processor 13. A subject register stack data structure (an “SR stack”) 400 in memory has a plurality of frames 410 each containing a set of entries 401 corresponding to a subset of subject registers 502 of one register window 510 in a subject processor 3. The SR stack 400 is accessed by the target code 21 executing on the target processor 13. The SR stack 400 stores a large plurality of such frames 410 and thereby avoids overhead such as modelling automatic spill and fill operations from the windowed register file of the subject architecture. In one embodiment, a target computing system 10 having sixteen general purpose working registers is adapted to support a register window architecture reliant upon a register file containing tens or hundreds of subject registers 502.

摘要翻译： 目标计算系统10适于支持寄存器窗体结构，特别是用于在将非本地主题代码17转换成由目标处理器13执行的目标代码21时使用。主体寄存器堆栈数据结构（“SR堆栈”） 400在存储器中具有多个帧410，每个帧410包含与主体处理器3中的一个寄存器窗口510的主体寄存器502的子集相对应的一组条目401.SR堆栈400由目标代码21在目标上执行 处理器13.SR堆栈400存储大量这样的帧410，从而避免诸如从主体架构的窗口寄存器文件建模自动溢出和填充操作的开销。 在一个实施例中，具有十六个通用工作寄存器的目标计算系统10适于支持依赖于包含数十或数百个主体寄存器502的寄存器文件的寄存器窗口架构。

公开(公告)号：US08001535B2

公开(公告)日：2011-08-16

申请号：US11904601

申请日：2007-09-27

申请人： Alexander B. Brown

发明人： Alexander B. Brown

IPC分类号： G06F9/45

CPC分类号： G06F9/30127 ,  G06F9/45504

摘要： A target computing system 10 is adapted to support a register window architecture, particularly for use when converting non-native subject code 17 instead into target code 21 executed by a target processor 13. A subject register stack data structure (an “SR stack”) 400 in memory has a plurality of frames 410 each containing a set of entries 401 corresponding to a subset of subject registers 502 of one register window 510 in a subject processor 3. The SR stack 400 is accessed by the target code 21 executing on the target processor 13. The SR stack 400 stores a large plurality of such frames 410 and thereby avoids overhead such as modelling automatic spill and fill operations from the windowed register file of the subject architecture. In one embodiment, a target computing system 10 having sixteen general purpose working registers is adapted to support a register window architecture reliant upon a register file containing tens or hundreds of subject registers 502.

摘要翻译： 目标计算系统10适于支持寄存器窗体结构，特别是用于在将非本地主题代码17转换成由目标处理器13执行的目标代码21时使用。主体寄存器堆栈数据结构（“SR堆栈”） 400在存储器中具有多个帧410，每个帧410包含与主体处理器3中的一个寄存器窗口510的主体寄存器502的子集相对应的一组条目401.SR堆栈400由目标代码21在目标上执行 处理器13.SR堆栈400存储大量这样的帧410，从而避免诸如从主体架构的窗口寄存器文件建模自动溢出和填充操作的开销。 在一个实施例中，具有十六个通用工作寄存器的目标计算系统10适于支持依赖于包含数十或数百个主体寄存器502的寄存器文件的寄存器窗口架构。

公开(公告)号：US08468552B2

公开(公告)日：2013-06-18

申请号：US11906531

申请日：2007-10-02

申请人： Alexander B. Brown

发明人： Alexander B. Brown

IPC分类号： G06F3/00 ,  G06F9/26

CPC分类号： G06F9/44521 ,  G06F9/45516

摘要： A technique is provided for handling dynamically linked subject function calls arranged pass subject control flow to an intermediate control structure such as a procedure linkage table, then to subject linker code for modifying link information associated with the subject function calls during translation of subject code into target code in a dynamic binary translator. The subject code for execution on a subject processor is received by a translator, and corresponding target code for execution on the target processor is generated. The translator is arranged to build a function linkage table containing an entry giving the location of each function called by the subject code, so that code can be generated by the translator in which subject function calls are associated with code for performing the function, without generating target code corresponding to the intermediate control structure.

公开(公告)号：US20130024675A1

公开(公告)日：2013-01-24

申请号：US13479026

申请日：2012-05-23

申请人： William O. Lovett ,  Alexander B. Brown

发明人： William O. Lovett ,  Alexander B. Brown

IPC分类号： G06F9/38

CPC分类号： G06F9/322 ,  G06F9/30054 ,  G06F9/3806 ,  G06F9/455 ,  G06F9/4552

摘要： A dynamic code translator with isoblocking uses a return trampoline having branch instructions conditioned on different isostates to optimize return address translation, by allowing the hardware to predict that the address of a future return will be the address of trampoline. An IP relative call is inserted into translated code to write the trampoline address to a target link register and a target return address stack used by the native machine to predict return addresses. If a computed subject return address matches a subject return address register value, the current isostate of the isoblock is written to an isostate register. The isostate value in the isostate register is then used to select the branch instruction in the trampoline for the true subject return address. Sufficient code area in the trampoline instruction set can be reserved for a number of compare/branch pairs which is equal to the number of available isostates.