Thread speculative execution and asynchronous conflict
    41.
    发明授权
    Thread speculative execution and asynchronous conflict 有权
    线程推测执行和异步冲突

    公开(公告)号:US08438571B2

    公开(公告)日:2013-05-07

    申请号:US12711328

    申请日:2010-02-24

    IPC分类号: G06F9/46

    摘要: In an embodiment, asynchronous conflict events are received during a previous rollback period. Each of the asynchronous conflict events represent conflicts encountered by speculative execution of a first plurality of work units and may be received out-of-order. During a current rollback period, a first work unit is determined whose speculative execution raised one of the asynchronous conflict events, and the first work unit is older than all other of the first plurality of work units. A second plurality of work units are determined, whose ages are equal to or older than the first work unit, wherein each of the second plurality of work units are assigned to respective executing threads. Rollbacks of the second plurality of work units are performed. After the rollbacks of the second plurality of work units are performed, speculative executions of the second plurality of work units are initiated in age order, from oldest to youngest.

    摘要翻译: 在一个实施例中,在先前的回滚期间期间接收到异步冲突事件。 每个异步冲突事件表示由第一多个工作单元的推测性执行而遇到的冲突,并且可以被无序地接收。 在当前回滚期间,确定第一工作单元,其推测执行引起异步冲突事件中的一个,并且第一工作单元比第一多个工作单元中的所有其他工作单元老。 确定第二多个作业单元,其年龄等于或小于第一工作单元,其中第二多个作业单元中的每一个分配给相应的执行螺纹。 执行第二多个工作单元的回滚。 在执行第二多个作业单元的回滚之后,第二个多个作业单元的推测性执行以年龄从最早到最小的顺序发起。

    ROUTE PLANNING USING LOCATION/TIME ENCODED DATA FROM LOCATION AWARE SNOWPLOWS
    43.
    发明申请
    ROUTE PLANNING USING LOCATION/TIME ENCODED DATA FROM LOCATION AWARE SNOWPLOWS 有权
    路线规划使用位置/时间编码数据从位置AWARE SNOWPLOWS

    公开(公告)号:US20130018577A1

    公开(公告)日:2013-01-17

    申请号:US13179985

    申请日:2011-07-11

    申请人: Thomas M. Gooding

    发明人: Thomas M. Gooding

    IPC分类号: G01C21/34

    摘要: Techniques are described for using geographic location data of snowplows to update a snow depth associated with a section of a surface street. The route of the snowplow may be tracked continuously which allows the snow depth of the street to be reset in real-time. The updated snow depth may then be used to generate a cost of travelling on the street. The travelling cost may then be used to plan a route through the region. Alternatively, the cost may be graphically displayed on a map to permit a user to determine which surface streets to avoid. In another embodiment, the cost of travelling on a particular street may be changed by the attributes of the vehicle that will navigate the snow-covered roads, driver's experience, or the geographic terrain of a road. This new cost may then be used, for example, to plan a route or display roads to avoid.

    摘要翻译: 描述了使用积雪机的地理位置数据来更新与表面街道的一部分相关联的雪深的技术。 可以连续跟踪除雪机的路线,这样可以实时地重置街道的雪深。 然后可以使用更新的雪深来产生在街上行驶的费用。 然后可以使用旅行成本来规划通过该地区的路线。 或者,成本可以以图形方式显示在地图上,以允许用户确定要避免的表面街道。 在另一个实施例中,在特定街道上行驶的费用可以通过将在雪覆盖的道路,驾驶员的体验或道路的地理地形上导航的车辆的属性来改变。 然后可以使用这种新的成本,例如,计划路线或显示要避免的道路。

    Remote Direct Memory Access ('RDMA') In A Parallel Computer
    44.
    发明申请
    Remote Direct Memory Access ('RDMA') In A Parallel Computer 审中-公开
    并行计算机中的远程直接存储器访问('RDMA')

    公开(公告)号:US20120331243A1

    公开(公告)日:2012-12-27

    申请号:US13167950

    申请日:2011-06-24

    IPC分类号: G06F12/00

    摘要: Remote direct memory access (‘RDMA’) in a parallel computer, the parallel computer including a plurality of nodes, each node including a messaging unit, including: receiving an RDMA read operation request that includes a virtual address representing a memory region at which to receive data to be transferred from a second node to the first node; responsive to the RDMA read operation request: translating the virtual address to a physical address; creating a local RDMA object that includes a counter set to the size of the memory region; sending a message that includes an DMA write operation request, the physical address of the memory region on the first node, the physical address of the local RDMA object on the first node, and a remote virtual address on the second node; and receiving the data to be transferred from the second node.

    摘要翻译: 并行计算机中的远程直接存储器访问(RDMA),所述并行计算机包括多个节点,每个节点包括消息传送单元,包括:接收RDMA读取操作请求,其包括虚拟地址,所述虚拟地址表示用于接收数据的存储器区域 从第二节点传送到第一节点; 响应于RDMA读取操作请求:将虚拟地址转换为物理地址; 创建本地RDMA对象,其包括设置为存储器区域的大小的计数器; 发送包括DMA写入操作请求的消息,第一节点上的存储器区域的物理地址,第一节点上的本地RDMA对象的物理地址以及第二节点上的远程虚拟地址; 并从第二节点接收要传送的数据。

    Temperature threshold application signal trigger for real-time relocation of process
    45.
    发明授权
    Temperature threshold application signal trigger for real-time relocation of process 失效
    温度阈值应用信号触发用于实时重定位过程

    公开(公告)号:US08250383B2

    公开(公告)日:2012-08-21

    申请号:US12109579

    申请日:2008-04-25

    IPC分类号: G06F1/26 G06F11/00

    CPC分类号: G06F1/206

    摘要: A method of managing a process relocation operation in a computing system is provided and includes determining respective operating temperatures of first, second and additional nodes of the system, where the first node has an elevated operating temperature and the second node has a normal operating temperature, notifying first and second kernels respectively associated with the first and second nodes, of a swapping condition, initially managing the first and second kernels to swap an application between the first and the second nodes while the swapping condition is in effect, and secondarily managing the first and second kernels to perform a barrier operation to end the swapping condition.

    摘要翻译: 提供了一种管理计算系统中的处理重定位操作的方法,并且包括确定系统的第一,第二和附加节点的相应操作温度,其中第一节点具有升高的工作温度,并且第二节点具有正常工作温度, 通知交换条件分别与第一和第二节点相关联的第一和第二内核,最初管理第一和第二内核以在交换条件有效的同时在第一和第二节点之间交换应用,并且其次管理第一和第二内核 和第二内核执行屏障操作以结束交换条件。

    Call stack protection
    46.
    发明授权
    Call stack protection 失效
    调用堆栈保护

    公开(公告)号:US08245002B2

    公开(公告)日:2012-08-14

    申请号:US12247497

    申请日:2008-10-08

    IPC分类号: G06F12/14

    CPC分类号: G06F12/1441

    摘要: Call stack protection, including executing at least one application program on the one or more computer processors, including initializing threads of execution, each thread having a call stack, each call stack characterized by a separate guard area defining a maximum extent of the call stack, dispatching one of the threads of the process, including loading a guard area specification for the dispatched thread's call stack guard area from thread context storage into address comparison registers of a processor; determining by use of address comparison logic in dependence upon a guard area specification for the dispatched thread whether each access of memory by the dispatched thread is a precluded access of memory in the dispatched thread's call stack's guard area; and effecting by the address comparison logic an address comparison interrupt for each access of memory that is a precluded access of memory in the dispatched thread's guard area.

    摘要翻译: 调用堆栈保护,包括在一个或多个计算机处理器上执行至少一个应用程序,包括初始化执行线程,每个线程具有调用堆栈,每个调用堆栈的特征在于定义呼叫堆栈的最大范围的单独保护区域, 调度进程的一个线程,包括将调度线程的调用堆栈保护区域的保护区域规范从线程上下文存储加载到处理器的地址比较寄存器中; 通过使用地址比较逻辑,根据被调度的线程的保护区域规范来确定被调度线程的每个存储器的访问是否是被调度的线程的调用堆栈的保护区域中的存储器的被阻止的访问; 并且通过地址比较逻辑执行地址比较中断,用于存储器的每次存取,这是存储在调度线程的保护区域中的被阻止的访问。

    Method and apparatus to debug an integrated circuit chip via synchronous clock stop and scan
    47.
    发明授权
    Method and apparatus to debug an integrated circuit chip via synchronous clock stop and scan 失效
    通过同步时钟停止和扫描来调试集成电路芯片的方法和装置

    公开(公告)号:US08140925B2

    公开(公告)日:2012-03-20

    申请号:US11768791

    申请日:2007-06-26

    IPC分类号: G01R31/28 G06F1/12

    CPC分类号: G06F11/2236

    摘要: An apparatus and method for evaluating a state of an electronic or integrated circuit (IC), each IC including one or more processor elements for controlling operations of IC sub-units, and each the IC supporting multiple frequency clock domains. The method comprises: generating a synchronized set of enable signals in correspondence with one or more IC sub-units for starting operation of one or more IC sub-units according to a determined timing configuration; counting, in response to one signal of the synchronized set of enable signals, a number of main processor IC clock cycles; and, upon attaining a desired clock cycle number, generating a stop signal for each unique frequency clock domain to synchronously stop a functional clock for each respective frequency clock domain; and, upon synchronously stopping all on-chip functional clocks on all frequency clock domains in a deterministic fashion, scanning out data values at a desired IC chip state. The apparatus and methodology enables construction of a cycle-by-cycle view of any part of the state of a running IC chip, using a combination of on-chip circuitry and software.

    摘要翻译: 一种用于评估电子或集成电路(IC)的状态的装置和方法,每个IC包括用于控制IC子单元的操作的一个或多个处理器元件,以及每个支持多个时钟域的IC。 该方法包括:根据确定的定时配置,产生与一个或多个IC子单元相对应的用于开始一个或多个IC子单元的操作的同步的使能信号组; 计数,响应于同步的一组使能信号的一个信号,多个主处理器IC时钟周期; 并且在获得期望的时钟周期数时,产生用于每个唯一频率时钟域的停止信号以同步地停止每个相应频率时钟域的功能时钟; 并且在确定性地同时停止所有频率时钟域上的所有片上功能时钟时,以期望的IC芯片状态扫描数据值。 该装置和方法使得能够使用片上电路和软件的组合来构建运行中的IC芯片的状态的任何部分的逐周期视图。

    SPECULATIVE THREAD EXECUTION WITH HARDWARE TRANSACTIONAL MEMORY
    48.
    发明申请
    SPECULATIVE THREAD EXECUTION WITH HARDWARE TRANSACTIONAL MEMORY 有权
    具有硬件交互式存储器的线性螺纹执行

    公开(公告)号:US20110209155A1

    公开(公告)日:2011-08-25

    申请号:US12711352

    申请日:2010-02-24

    IPC分类号: G06F9/46 G06F12/08 G06F12/00

    摘要: In an embodiment, if a self thread has more than one conflict, a transaction of the self thread is aborted and restarted. If the self thread has only one conflict and an enemy thread of the self thread has more than one conflict, the transaction of the self thread is committed. If the self thread only conflicts with the enemy thread and the enemy thread only conflicts with the self thread and the self thread has a key that has a higher priority than a key of the enemy thread, the transaction of the self thread is committed. If the self thread only conflicts with the enemy thread, the enemy thread only conflicts with the self thread, and the self thread has a key that has a lower priority than the key of the enemy thread, the transaction of the self thread is aborted.

    摘要翻译: 在一个实施例中,如果自线程具有多于一个冲突,则自线程的事务被中止并重新启动。 如果自线程只有一个冲突,并且自线程的敌方线程有多个冲突,则自线程的事务被提交。 如果自线程只与敌方线程冲突,敌方线程只与自线程冲突,自线程的密钥优先级高于敌方线程的密钥,则自线程的事务被提交。 如果自线程只与敌方线程相冲突,敌方线程只会与自身线程冲突,自线程的密钥优先级低于敌方线程的密钥,自身线程的事务中止。

    Call Stack Protection
    50.
    发明申请
    Call Stack Protection 失效
    呼叫堆栈保护

    公开(公告)号:US20100088705A1

    公开(公告)日:2010-04-08

    申请号:US12247497

    申请日:2008-10-08

    IPC分类号: G06F12/02 G06F9/46

    CPC分类号: G06F12/1441

    摘要: Call stack protection, including executing at least one application program on the one or more computer processors, including initializing threads of execution, each thread having a call stack, each call stack characterized by a separate guard area defining a maximum extent of the call stack, dispatching one of the threads of the process, including loading a guard area specification for the dispatched thread's call stack guard area from thread context storage into address comparison registers of a processor; determining by use of address comparison logic in dependence upon a guard area specification for the dispatched thread whether each access of memory by the dispatched thread is a precluded access of memory in the dispatched thread's call stack's guard area; and effecting by the address comparison logic an address comparison interrupt for each access of memory that is a precluded access of memory in the dispatched thread's guard area.

    摘要翻译: 调用堆栈保护,包括在一个或多个计算机处理器上执行至少一个应用程序,包括初始化执行线程,每个线程具有调用堆栈,每个调用堆栈的特征在于定义呼叫堆栈的最大范围的单独保护区域, 调度进程的一个线程,包括将调度线程的调用堆栈保护区域的保护区域规范从线程上下文存储加载到处理器的地址比较寄存器中; 通过使用地址比较逻辑,根据被调度的线程的保护区域规范来确定被调度线程的每个存储器的访问是否是被调度的线程的调用堆栈的保护区域中的存储器的被阻止的访问; 并且通过地址比较逻辑执行地址比较中断,用于存储器的每次存取,这是存储在调度线程的保护区域中的被阻止的访问。