中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

13 records (took 0.017 seconds)

    Non-uniform memory access (NUMA) enhancements for shared logical partitions
    1.
    发明授权
    Non-uniform memory access (NUMA) enhancements for shared logical partitions 失效
    共享逻辑分区的非均匀内存访问（NUMA）增强功能

    公开(公告)号：US08490094B2

    公开(公告)日：2013-07-16

    申请号：US12394669

    申请日：2009-02-27

    Applicant: Vaijayanthimala K. Anand ,  Mark R. Funk ,  Steven R. Kunkel ,  Mysore S. Srinivas ,  Randal C. Swanberg ,  Ronald D. Young

    Inventor： Vaijayanthimala K. Anand ,  Mark R. Funk ,  Steven R. Kunkel ,  Mysore S. Srinivas ,  Randal C. Swanberg ,  Ronald D. Young

    IPC: G06F9/50 ,  G06F13/00

    CPC classification number: G06F9/5077 ,  G06F2212/2542

    Abstract: In a NUMA-topology computer system that includes multiple nodes and multiple logical partitions, some of which may be dedicated and others of which are shared, NUMA optimizations are enabled in shared logical partitions. This is done by specifying a home node parameter in each virtual processor assigned to a logical partition. When a task is created by an operating system in a shared logical partition, a home node is assigned to the task, and the operating system attempts to assign the task to a virtual processor that has a home node that matches the home node for the task. The partition manager then attempts to assign virtual processors to their corresponding home nodes. If this can be done, NUMA optimizations may be performed without the risk of reducing the performance of the shared logical partition.

    Abstract translation: 在包含多个节点和多个逻辑分区的NUMA拓扑计算机系统中，其中一些可能是专用的，其他的可以是共享的，而在共享逻辑分区中启用了NUMA优化。 这是通过在分配给逻辑分区的每个虚拟处理器中指定家庭节点参数来完成的。 当由共享逻辑分区中的操作系统创建任务时，将家庭节点分配给该任务，并且操作系统尝试将该任务分配给具有与该任务的家庭节点匹配的家庭节点的虚拟处理器 。 然后，分区管理器尝试将虚拟处理器分配给其对应的家庭节点。 如果可以这样做，可以执行NUMA优化，而不会降低共享逻辑分区的性能。

    ADJUSTING MEMORY ALLOCATION OF A PARTITION USING COMPRESSED MEMORY PAGING STATISTICS
    2.
    发明申请
    ADJUSTING MEMORY ALLOCATION OF A PARTITION USING COMPRESSED MEMORY PAGING STATISTICS 有权
    使用压缩内存分页统计调整分区的记忆分配

    公开(公告)号：US20120084531A1

    公开(公告)日：2012-04-05

    申请号：US12894666

    申请日：2010-09-30

    Applicant: Mark R. FUNK ,  Vernon R. PAHL ,  Ronald D. YOUNG

    Inventor： Mark R. FUNK ,  Vernon R. PAHL ,  Ronald D. YOUNG

    IPC: G06F12/02 ,  G06F12/00

    CPC classification number: G06F12/0223 ,  G06F12/08 ,  G06F2212/401

    Abstract: Acceptable memory allocation for a partition is determined during and with minimal impact on normal operation of the partitioned system. The approach includes: collecting, by a processor, statistics on a rate at which pages are transferred between uncompressed and compressed memory spaces of the partition's memory; adjusting size of the uncompressed memory space; and subsequent to the adjusting, continuing with collecting of the statistics, and referencing the resultant statistics in determining an acceptable memory allocation for the partition. In one implementation, the adjusting includes stepwise decreasing size of the uncompressed memory space by reallocating uncompressed memory space to compressed memory space, and repeating the collecting of statistics for a defined measurement period for each adjusted uncompressed memory space size until performance of the partition is negatively impacted by the reallocation of uncompressed memory space to compressed memory space.

    Abstract translation: 在分区系统的正常操作影响期间确定分区的可接受的内存分配。 该方法包括：由处理器收集在分区的存储器的未压缩和压缩的存储空间之间传送页面的速率的统计数据; 调整未压缩存储空间的大小; 并且在调整之后，继续收集统计数据，并参考所得到的统计数据来确定分区的可接受的存储器分配。 在一个实现中，调整包括通过将未压缩的存储器空间重新分配到压缩存储器空间来逐步减小未压缩存储器空间的大小，并且重复对于每个经调整的未压缩存储器空间大小的定义的测量周期的统计信息的收集，直到分区的执行为负 受到将未压缩内存空间重新分配给压缩内存空间的影响。

    Real Address Accessing in a Coprocessor Executing on Behalf of an Unprivileged Process
    3.
    发明申请
    Real Address Accessing in a Coprocessor Executing on Behalf of an Unprivileged Process 有权
    在执行非特权进程的协处理器中的真实地址访问

    公开(公告)号：US20120066474A1

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

    申请号：US12880787

    申请日：2010-09-13

    Applicant: Mark R. Funk

    Inventor： Mark R. Funk

    IPC: G06F12/10 ,  G06F12/00

    CPC classification number: G06F12/1027 ,  G06F2212/683

    Abstract: A coprocessor performs operations on behalf of processes executing in processors coupled thereto, and accesses data operands in memory using real addresses. A process executing in a processor generates an effective address for a coprocessor request, invokes the processor's address translation mechanisms to generate a corresponding real address, and passes this real address is the coprocessor. Preferably, the real address references a block of additional real addresses, each for a respective data operand. The coprocessor uses the real address to access the data operands to perform the operation. An address context detection mechanism detects the occurrence of certain events which could alter the context of real addresses used by the coprocessor or the real addresses themselves.

    Abstract translation: 协处理器代表在与其耦合的处理器中执行的进程执行操作，并使用实际地址访问存储器中的数据操作数。 在处理器中执行的进程生成协处理器请求的有效地址，调用处理器的地址转换机制以生成相应的实际地址，并且通过该实际地址是协处理器。 优选地，实际地址引用附加实地址的块，每一个用于相应的数据操作数。 协处理器使用实际地址访问数据操作数来执行操作。 地址上下文检测机制检测可能改变协处理器或实际地址本身使用的实际地址的上下文的某些事件的发生。

    Method and apparatus for protecting encryption keys in a logically partitioned computer system environment
    4.
    发明授权
    Method and apparatus for protecting encryption keys in a logically partitioned computer system environment 失效
    用于在逻辑分区的计算机系统环境中保护加密密钥的方法和装置

    公开(公告)号：US08477946B2

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

    申请号：US12038038

    申请日：2008-02-27

    Applicant: Mark R. Funk ,  Jeffrey E. Remfert

    Inventor： Mark R. Funk ,  Jeffrey E. Remfert

    IPC: H04L9/00 ,  G06F13/00

    CPC classification number: H04L9/088 ,  G06F12/1408

    Abstract: In a logically partitioned computer system, a partition manager maintains and controls master encryption keys for the different partitions. Preferably, processes executing within a partition have no direct access to real memory, addresses in the partition's memory space being mapped to real memory by the partition manager. The partition manager maintains master keys at real memory addresses inaccessible to processes executing in the partitions. Preferably, a special hardware register stores a pointer to the current key, and is read only by a hardware crypto-engine to encrypt/decrypt data. The crypto-engine returns the encrypted/decrypted data, but does not output the key itself or its location.

    Abstract translation: 在逻辑分区的计算机系统中，分区管理器维护并控制不同分区的主加密密钥。 优选地，在分区内执行的处理不能直接访问实际存储器，分区的存储空间中的地址被分区管理器映射到实际存储器。 分区管理器将主密钥维护在分区中执行的进程无法访问的实际内存地址。 优选地，特殊硬件寄存器存储指向当前密钥的指针，并且仅由硬件加密引擎读取以加密/解密数据。 加密引擎返回加密/解密的数据，但不输出密钥本身或其位置。

    Real address accessing in a coprocessor executing on behalf of an unprivileged process
    5.
    发明授权
    Real address accessing in a coprocessor executing on behalf of an unprivileged process 有权
    在代表非特权进程执行的协处理器中的真实地址访问

    公开(公告)号：US08359453B2

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

    申请号：US12880787

    申请日：2010-09-13

    Applicant: Mark R. Funk

    Inventor： Mark R. Funk

    IPC: G06F12/00

    CPC classification number: G06F12/1027 ,  G06F2212/683

    Abstract: A coprocessor performs operations on behalf of processes executing in processors coupled thereto, and accesses data operands in memory using real addresses. A process executing in a processor generates an effective address for a coprocessor request, invokes the processor's address translation mechanisms to generate a corresponding real address, and passes this real address is the coprocessor. Preferably, the real address references a block of additional real addresses, each for a respective data operand. The coprocessor uses the real address to access the data operands to perform the operation. An address context detection mechanism detects the occurrence of certain events which could alter the context of real addresses used by the coprocessor or the real addresses themselves.

    Abstract translation: 协处理器代表在与其耦合的处理器中执行的进程执行操作，并使用实际地址访问存储器中的数据操作数。 在处理器中执行的进程生成协处理器请求的有效地址，调用处理器的地址转换机制以生成相应的实际地址，并且通过该实际地址是协处理器。 优选地，实际地址引用附加实地址的块，每一个用于相应的数据操作数。 协处理器使用实际地址访问数据操作数来执行操作。 地址上下文检测机制检测可能改变协处理器或实际地址本身使用的实际地址的上下文的某些事件的发生。

    Character generator
    8.
    发明授权
    Character generator 失效
    字符发生器

    公开(公告)号：US4648069A

    公开(公告)日：1987-03-03

    申请号：US582654

    申请日：1984-02-23

    Applicant: Mark R. Funk ,  Paul R. Herrold ,  Toru Nohzawa

    Inventor： Mark R. Funk ,  Paul R. Herrold ,  Toru Nohzawa

    IPC: G06F3/153 ,  G06F17/21 ,  G06K15/02 ,  G09G1/02 ,  G09G5/24 ,  G06F3/14

    CPC classification number: G06F17/214 ,  G06K15/02 ,  G09G1/02 ,  G09G5/24 ,  G06K2215/002 ,  G06K2215/0022

    Abstract: A character generator uses a first memory having a permanent resident area and an overlay area. A second memory stores patterns of all characters. The permanent resident area stores character patterns having the highest frequency of use. The overlay area is not permanent and stores a subset of character patterns known to have high frequency use, but of lesser frequency than in the permanent area. A directory is provided for accessing character patterns in the overlay area. Characters are accessed using character code points. Each character code point represented in the directory has a usage count field and an address pointer field for enabling the character to be chained in a logical sequence with the other characters in accordance with their respective frequencies of use. The directory is searched serially and the search time will be shorter for the characters having highest frequency of use. The characters are accessed in the directory by their code points. Since the permanent area does not change, no directory is needed for accessing the characters in it. When a character is not found in the first memory, it is accessed from the second memory (which may be disk) and is stored in the overlay area and is represented in the directory by overlaying an existing entry of lowest frequency, e.g. zero usage.

    Abstract translation: 字符发生器使用具有永久驻留区域和覆盖区域的第一存储器。 第二个内存存储所有字符的模式。 永久居民区域存储具有最高使用频率的字符图案。 覆盖区域不是永久性的，并且存储已知具有高频率使用但具有比永久区域更小的频率的字符模式的子集。 提供了一个用于访问覆盖区域中的字符模式的目录。 使用字符代码点访问字符。 目录中表示的每个字符代码点具有使用计数字段和地址指针字段，用于使字符能够根据其各自的使用频率与其他字符以逻辑顺序链接。 连续搜索目录，对于具有最高使用频率的字符，搜索时间会更短。 字符在目录中通过其代码点进行访问。 由于永久性区域不会更改，因此不需要目录来访问其中的字符。 当在第一存储器中没有找到字符时，从第二存储器（其可以是磁盘）访问并存储在覆盖区域中并且通过覆盖最低频率的现有条目（例如， 零使用。

    Adjusting memory allocation of a partition using compressed memory paging statistics
    9.
    发明授权
    Adjusting memory allocation of a partition using compressed memory paging statistics 有权
    使用压缩内存分页统计调整分区的内存分配

    公开(公告)号：US08904145B2

    公开(公告)日：2014-12-02

    申请号：US12894666

    申请日：2010-09-30

    Applicant: Mark R. Funk ,  Vernon R. Pahl ,  Ronald D. Young

    Inventor： Mark R. Funk ,  Vernon R. Pahl ,  Ronald D. Young

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

    CPC classification number: G06F12/0223 ,  G06F12/08 ,  G06F2212/401

    Abstract: Acceptable memory allocation for a partition is determined during and with minimal impact on normal operation of the partitioned system. The approach includes: collecting, by a processor, statistics on a rate at which pages are transferred between uncompressed and compressed memory spaces of the partition's memory; adjusting size of the uncompressed memory space; and subsequent to the adjusting, continuing with collecting of the statistics, and referencing the resultant statistics in determining an acceptable memory allocation for the partition. In one implementation, the adjusting includes stepwise decreasing size of the uncompressed memory space by reallocating uncompressed memory space to compressed memory space, and repeating the collecting of statistics for a defined measurement period for each adjusted uncompressed memory space size until performance of the partition is negatively impacted by the reallocation of uncompressed memory space to compressed memory space.

    Abstract translation: 在分区系统的正常操作影响期间确定分区的可接受的内存分配。 该方法包括：由处理器收集在分区的存储器的未压缩和压缩的存储空间之间传送页面的速率的统计数据; 调整未压缩存储空间的大小; 并且在调整之后，继续收集统计数据，并参考所得到的统计数据来确定分区的可接受的存储器分配。 在一个实现中，调整包括通过将未压缩的存储器空间重新分配到压缩存储器空间来逐步减小未压缩存储器空间的大小，并且重复对于每个调整的未压缩存储器空间大小的定义的测量周期的统计信息的收集，直到分区的执行为负 受到将未压缩内存空间重新分配给压缩内存空间的影响。

Patent Agency Ranking