利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

20 条记录 (耗时 0.04 秒)

    Proximity-based memory allocation in a distributed memory system
    1.
    发明授权
    Proximity-based memory allocation in a distributed memory system 有权
    分布式存储系统中基于接近度的内存分配

    公开(公告)号：US08150946B2

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

    申请号：US11409205

    申请日：2006-04-21

    申请人： Yuguang Wu ,  Christopher A. Vick ,  Michael H. Paleczny ,  Bo Yang ,  Olaf Manczak ,  Jay R. Freeman ,  Phyllis E. Gustafson ,  Miguel-Angel Lujan Moreno

    发明人： Yuguang Wu ,  Christopher A. Vick ,  Michael H. Paleczny ,  Bo Yang ,  Olaf Manczak ,  Jay R. Freeman ,  Phyllis E. Gustafson ,  Miguel-Angel Lujan Moreno

    IPC分类号： G06F15/177

    CPC分类号： H04L67/10 ,  H04L12/00

    摘要： A system and method for allocating the nearest available physical memory in a distributed, shared memory system. In various embodiments, a processor node may broadcast a memory request to a first subset of nodes connected to it via a communication network. In some embodiments, if none of these nodes is able to satisfy the request, the processor node may broadcast the request to additional subsets of nodes. In some embodiments, each node of the first subset of nodes may be removed from the processor node by one network hop and each node of the additional subsets of nodes may be removed from the processor node by no more than an iteratively increasing number of network hops. In some embodiments, the processor node may send an acknowledgment to one node that can fulfill the request and a negative acknowledgement to other nodes that can fulfill the request.

    摘要翻译： 一种用于在分布式共享存储器系统中分配最近的可用物理存储器的系统和方法。 在各种实施例中，处理器节点可以经由通信网络向连接到其的节点的第一子集广播存储器请求。 在一些实施例中，如果这些节点都不能满足该请求，则处理器节点可以将该请求广播到附加的节点子集。 在一些实施例中，节点的第一子集的每个节点可以通过一个网络跳从处理器节点移除，并且可以通过不超过迭代增加的网络跳数来从处理器节点移除附加子节点的每个节点 。 在一些实施例中，处理器节点可以向可以满足请求的一个节点发送确认，并向可以满足该请求的其他节点发送否定的确认。

    Method and system for enabling a synchronization-free and parallel commit phase
    2.
    发明授权
    Method and system for enabling a synchronization-free and parallel commit phase 有权
    实现无同步和并行提交阶段的方法和系统

    公开(公告)号：US07797329B2

    公开(公告)日：2010-09-14

    申请号：US11450763

    申请日：2006-06-09

    申请人： Miguel Angel Lujan Moreno ,  Phyllis E. Gustafson ,  Michael H. Paleczny ,  Christopher A. Vick ,  Jay R. Freeman ,  Olaf Manczak

    发明人： Miguel Angel Lujan Moreno ,  Phyllis E. Gustafson ,  Michael H. Paleczny ,  Christopher A. Vick ,  Jay R. Freeman ,  Olaf Manczak

    IPC分类号： G06F7/00 ,  G06F17/30 ,  G06F9/44 ,  G06F9/45

    CPC分类号： G06F9/528

    摘要： A method for committing memory transactions in an application that includes executing a plurality of sections of the application in parallel, logging a plurality of memory transactions that occur while executing the plurality of sections to obtain a plurality of logs and a plurality of temporary results, wherein the plurality of memory transactions that includes a plurality of writes to at least one memory location, comparing the plurality of logs to identify an optimal list of writes from the plurality of writes, and committing memory transactions corresponding to a subset of the plurality of temporary results, wherein the subset of the plurality of temporary results is identified by the optimal list of writes.

    摘要翻译： 一种在应用程序中提交内存事务的方法，包括并行执行应用程序的多个部分，记录在执行多个部分时发生的多个存储器事务，以获得多个日志和多个临时结果，其中 所述多个存储器事务包括对至少一个存储器位置的多个写入，比较所述多个日志以识别来自所述多个写入的最佳写入列表，以及提交与所述多个临时结果的子集相对应的存储器事务 ，其中所述多个临时结果的子集由最佳写入列表识别。

    Method and system for enabling a synchronization-free and parallel commit phase
    5.
    发明申请
    Method and system for enabling a synchronization-free and parallel commit phase 有权
    实现无同步和并行提交阶段的方法和系统

    公开(公告)号：US20080005498A1

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

    申请号：US11450763

    申请日：2006-06-09

    申请人： Miguel Angel Lujan Moreno ,  Phyllis E. Gustafson ,  Michael H. Paleczny ,  Christopher A. Vick ,  Jay R. Freeman ,  Olaf Manczak

    发明人： Miguel Angel Lujan Moreno ,  Phyllis E. Gustafson ,  Michael H. Paleczny ,  Christopher A. Vick ,  Jay R. Freeman ,  Olaf Manczak

    IPC分类号： G06F13/00

    CPC分类号： G06F9/528

    摘要： A method for committing memory transactions in an application that includes executing a plurality of sections of the application in parallel, logging a plurality of memory transactions that occur while executing the plurality of sections to obtain a plurality of logs and a plurality of temporary results, wherein the plurality of memory transactions that includes a plurality of writes to at least one memory location, comparing the plurality of logs to identify an optimal list of writes from the plurality of writes, and committing memory transactions corresponding to a subset of the plurality of temporary results, wherein the subset of the plurality of temporary results is identified by the optimal list of writes.

    摘要翻译： 一种在应用程序中提交内存事务的方法，包括并行执行应用程序的多个部分，记录在执行多个部分时发生的多个存储器事务，以获得多个日志和多个临时结果，其中 所述多个存储器事务包括对至少一个存储器位置的多个写入，比较所述多个日志以识别来自所述多个写入的最佳写入列表，以及提交与所述多个临时结果的子集相对应的存储器事务 ，其中所述多个临时结果的子集由最佳写入列表识别。

    Metadata management for scalable process location and migration
    7.
    发明授权
    Metadata management for scalable process location and migration 有权
    用于可扩展的进程位置和迁移的元数据管理

    公开(公告)号：US08234260B1

    公开(公告)日：2012-07-31

    申请号：US11158750

    申请日：2005-06-22

    申请人： Yuguang Wu ,  Christopher A. Vick ,  Michael H. Paleczny ,  Olaf Manczak ,  Jay R. Freeman ,  Phyllis E. Gustafson

    发明人： Yuguang Wu ,  Christopher A. Vick ,  Michael H. Paleczny ,  Olaf Manczak ,  Jay R. Freeman ,  Phyllis E. Gustafson

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F9/4856

    摘要： A method for metadata management for scalable processes, involving creating a process by a first home processor, wherein the process is associated with a process identification (ID), storing the processor ID and information identifying the first home processor in a global process look-up data structure (GPLD), requesting metadata associated with the process, searching the GPLD to obtain the first home processor of the process using the process ID, and retrieving the metadata associated with the process from the first home processor.

    摘要翻译： 一种用于可扩展处理的元数据管理的方法，涉及由第一家庭处理器创建过程，其中所述过程与进程标识（ID）相关联，将处理器ID和标识第一家庭处理器的信息存储在全局处理查找 数据结构（GPLD），请求与该过程相关联的元数据，搜索GPLD以使用进程ID获得该进程的第一家庭处理器，以及从第一家庭处理器检索与该进程相关联的元数据。

    Method and system for memory protection by processor carrier based access control
    8.
    发明授权
    Method and system for memory protection by processor carrier based access control 有权
    基于处理器载体的访问控制的存储器保护方法和系统

    公开(公告)号：US08555013B1

    公开(公告)日：2013-10-08

    申请号：US11158774

    申请日：2005-06-22

    申请人： Christopher A. Vick ,  Michael H. Paleczny ,  Jay R. Freeman ,  Olaf Manczak ,  Phyllis E. Gustafson ,  Yuguang Wu

    发明人： Christopher A. Vick ,  Michael H. Paleczny ,  Jay R. Freeman ,  Olaf Manczak ,  Phyllis E. Gustafson ,  Yuguang Wu

    IPC分类号： G06F13/00 ,  G06F13/28

    CPC分类号： G06F13/28

    摘要： A method for memory protection in a multiprocessor system, involving receiving a request at a first carrier to perform a memory operation at a memory address, wherein the first carrier receives the request from a processor, determining by the first carrier whether the processor is permitted to access memory at the memory address using a carrier identification (ID) of a second carrier, wherein the second carrier is associated with a memory controller used to access the memory, and sending the request to the second carrier, if the processor is permitted to access the memory.

    摘要翻译： 一种用于多处理器系统中的存储器保护的方法，包括在第一载波处接收请求以在存储器地址执行存储器操作，其中所述第一载波从处理器接收所述请求，由所述第一载体确定所述处理器是否被允许 使用第二载体的载波标识（ID）在存储器地址处访问存储器，其中所述第二载体与用于访问所述存储器的存储器控​​制器相关联，并且如果所述处理器被允许访问则将所述请求发送到所述第二载体 记忆。

    Dynamic selection of memory virtualization techniques
    9.
    发明授权
    Dynamic selection of memory virtualization techniques 有权
    动态选择内存虚拟化技术

    公开(公告)号：US07752417B2

    公开(公告)日：2010-07-06

    申请号：US11447189

    申请日：2006-06-05

    申请人： Olaf Manczak ,  Christopher A. Vick ,  Michael H. Paleczny ,  Jay R. Freeman ,  Phyllis E. Gustafson

    发明人： Olaf Manczak ,  Christopher A. Vick ,  Michael H. Paleczny ,  Jay R. Freeman ,  Phyllis E. Gustafson

    IPC分类号： G06F12/00

    CPC分类号： G06F12/10 ,  G06F11/3419 ,  G06F11/3433 ,  G06F11/3466 ,  G06F12/023 ,  G06F12/1009 ,  G06F12/1027 ,  G06F12/1036 ,  G06F12/109 ,  G06F2201/81 ,  G06F2201/865 ,  G06F2201/88

    摘要： A computer system may be configured to dynamically select a memory virtualization and corresponding virtual-to-physical address translation technique during execution of an application and to dynamically employ the selected technique in place of a current technique without re-initializing the application. The computer system may be configured to determine that a current address translation technique incurs a high overhead for the application's current workload and may be configured to select a different technique dependent on various performance criteria and/or a user policy. Dynamically employing the selected technique may include reorganizing a memory, reorganizing a translation table, allocating a different block of memory to the application, changing a page or segment size, or moving to or from a page-based, segment-based, or function-based address translation technique. A selected translation technique may be dynamically employed for the application independent of a translation technique employed for a different application.

    摘要翻译： 计算机系统可以被配置为在应用的执行期间动态地选择存储器虚拟化和对应的虚拟到物理地址转换技术，并且动态地采用所选择的技术代替当前技术，而不需要重新初始化应用。 计算机系统可以被配置为确定当前地址转换技术对应用程序的当前工作负载产生高开销，并且可以被配置为根据各种性能标准和/或用户策略选择不同的技术。 动态地采用所选择的技术可以包括重新组织存储器，重组翻译表，向应用分配不同的存储器块，改变页面或段大小，或者移动到基于页面的，基于段的， 基于地址的翻译技术。 所选择的翻译技术可以独立于用于不同应用的翻译技术而被动态地用于应用。

    Dynamic selection of memory virtualization techniques
    10.
    发明申请
    Dynamic selection of memory virtualization techniques 有权
    动态选择内存虚拟化技术

    公开(公告)号：US20070283125A1

    公开(公告)日：2007-12-06

    申请号：US11447189

    申请日：2006-06-05

    申请人： Olaf Manczak ,  Christopher A. Vick ,  Michael H. Paleczny ,  Jay R. Freeman ,  Phyllis E. Gustafson

    发明人： Olaf Manczak ,  Christopher A. Vick ,  Michael H. Paleczny ,  Jay R. Freeman ,  Phyllis E. Gustafson

    IPC分类号： G06F12/00

    CPC分类号： G06F12/10 ,  G06F11/3419 ,  G06F11/3433 ,  G06F11/3466 ,  G06F12/023 ,  G06F12/1009 ,  G06F12/1027 ,  G06F12/1036 ,  G06F12/109 ,  G06F2201/81 ,  G06F2201/865 ,  G06F2201/88

    摘要： A computer system may be configured to dynamically select a memory virtualization and corresponding virtual-to-physical address translation technique during execution of an application and to dynamically employ the selected technique in place of a current technique without re-initializing the application. The computer system may be configured to determine that a current address translation technique incurs a high overhead for the application's current workload and may be configured to select a different technique dependent on various performance criteria and/or a user policy. Dynamically employing the selected technique may include reorganizing a memory, reorganizing a translation table, allocating a different block of memory to the application, changing a page or segment size, or moving to or from a page-based, segment-based, or function-based address translation technique. A selected translation technique may be dynamically employed for the application independent of a translation technique employed for a different application.

    摘要翻译： 计算机系统可以被配置为在应用的执行期间动态地选择存储器虚拟化和对应的虚拟到物理地址转换技术，并且动态地采用所选择的技术代替当前技术，而不需要重新初始化应用。 计算机系统可以被配置为确定当前地址转换技术对应用程序的当前工作负载产生高开销，并且可以被配置为根据各种性能标准和/或用户策略选择不同的技术。 动态地采用所选择的技术可以包括重新组织存储器，重组翻译表，向应用分配不同的存储器块，改变页面或段大小，或者移动到基于页面的，基于段的， 基于地址的翻译技术。 所选择的翻译技术可以独立于用于不同应用的翻译技术而被动态地用于应用。