会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明授权
    • Route planning using location/time encoded data from location aware snowplows
    • 路线规划使用位置/时间编码数据从位置感知积雪车
    • US08880329B2
    • 2014-11-04
    • US13179985
    • 2011-07-11
    • Thomas M. Gooding
    • Thomas M. Gooding
    • G01C21/36G06F7/70G06F19/00G06G7/00G06G7/76G08G1/09H04M11/04G01C21/34
    • G01C21/3407G01C21/3461G01C21/3691
    • 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.
    • 描述了使用积雪机的地理位置数据来更新与表面街道的一部分相关联的雪深的技术。 可以连续跟踪除雪机的路线,这样可以实时地重置街道的雪深。 然后可以使用更新的雪深来产生在街上行驶的费用。 然后可以使用旅行成本来规划通过该地区的路线。 或者,成本可以以图形方式显示在地图上,以允许用户确定要避免的表面街道。 在另一个实施例中,在特定街道上行驶的费用可以通过将在雪覆盖的道路,驾驶员的体验或道路的地理地形上导航的车辆的属性来改变。 然后可以使用这种新的成本,例如,计划路线或显示要避免的道路。
    • 23. 发明授权
    • Hierarchical debug information collection
    • 分层调试信息收集
    • US07954012B2
    • 2011-05-31
    • US12258989
    • 2008-10-27
    • Thomas M. Gooding
    • Thomas M. Gooding
    • G06F11/00
    • G06F11/3636G06F11/3656
    • Embodiments of the invention are generally related to retrieving debug data from a plurality of nodes of a parallel computer system. To retrieve debug data, a message may be broadcast from a service node of the system to each of the plurality of nodes via a first network, the message indicating a debug operation that is to be performed. A node of the plurality of nodes may transfer an interrupt signal to the rest of the plurality of nodes via a second network. Upon receiving the interrupt signal, the plurality of nodes may perform the debug operation comprising transferring the debug data to the service node via a third network.
    • 本发明的实施例通常涉及从并行计算机系统的多个节点检索调试数据。 为了检索调试数据,可以经由第一网络将消息从系统的服务节点广播到多个节点中的每一个,该消息指示要执行的调试操作。 多个节点的节点可以经由第二网络将中断信号传送到多个节点的其余部分。 在接收到中断信号时,多个节点可以执行调试操作,包括经由第三网络将调试数据传送到服务节点。
    • 24. 发明申请
    • HEAP/STACK GUARD PAGES USING A WAKEUP UNIT
    • HEAP / STACK GUARD页面使用唤醒单元
    • US20110119445A1
    • 2011-05-19
    • US12696817
    • 2010-01-29
    • Thomas M. GoodingDavid L. SatterfieldBurkhard Steinmacher-Burow
    • Thomas M. GoodingDavid L. SatterfieldBurkhard Steinmacher-Burow
    • G06F12/08G06F12/00G06F13/24
    • G06F15/17381G06F9/30072
    • A method and system for providing a memory access check on a processor including the steps of detecting accesses to a memory device including level-1 cache using a wakeup unit. The method includes invalidating level-1 cache ranges corresponding to a guard page, and configuring a plurality of wakeup address compare (WAC) registers to allow access to selected WAC registers. The method selects one of the plurality of WAC registers, and sets up a WAC register related to the guard page. The method configures the wakeup unit to interrupt on access of the selected WAC register. The method detects access of the memory device using the wakeup unit when a guard page is violated. The method generates an interrupt to the core using the wakeup unit, and determines the source of the interrupt. The method detects the activated WAC registers assigned to the violated guard page, and initiates a response.
    • 一种用于在处理器上提供存储器访问检查的方法和系统,包括以下步骤:使用唤醒单元检测对包括一级高速缓存的存储设备的访问。 该方法包括使对应于保护页面的1级缓存范围失效,以及配置多个唤醒地址比较(WAC)寄存器以允许访问所选择的WAC寄存器。 该方法选择多个WAC寄存器中的一个,并建立与保护页相关的WAC寄存器。 该方法配置唤醒单元在所选WAC寄存器访问时中断。 当防护页被违反时,该方法使用唤醒单元检测存储设备的访问。 该方法使用唤醒单元为内核生成中断,并确定中断源。 该方法检测分配给违规保护页面的激活的WAC寄存器,并发起响应。
    • 25. 发明申请
    • HIERARCHICAL DEBUG INFORMATION COLLECTION
    • 分层调查信息收集
    • US20100107012A1
    • 2010-04-29
    • US12258989
    • 2008-10-27
    • Thomas M. Gooding
    • Thomas M. Gooding
    • G06F11/00
    • G06F11/3636G06F11/3656
    • Embodiments of the invention are generally related to retrieving debug data from a plurality of nodes of a parallel computer system. To retrieve debug data, a message may be broadcast from a service node of the system to each of the plurality of nodes via a first network, the message indicating a debug operation that is to be performed. A node of the plurality of nodes may transfer an interrupt signal to the rest of the plurality of nodes via a second network. Upon receiving the interrupt signal, the plurality of nodes may perform the debug operation comprising transferring the debug data to the service node via a third network.
    • 本发明的实施例通常涉及从并行计算机系统的多个节点检索调试数据。 为了检索调试数据,可以经由第一网络将消息从系统的服务节点广播到多个节点中的每一个,该消息指示要执行的调试操作。 多个节点的节点可以经由第二网络将中断信号传送到多个节点的其余部分。 在接收到中断信号时,多个节点可以执行调试操作,包括经由第三网络将调试数据传送到服务节点。
    • 27. 发明申请
    • Configuring Compute Nodes In A Parallel Computer Using Remote Direct Memory Access ('RDMA')
    • 使用远程直接内存访问(“RDMA”)配置并行计算机节点
    • US20130185381A1
    • 2013-07-18
    • US13351419
    • 2012-01-17
    • Michael E. AhoJohn E. AttinellaThomas M. GoodingMichael B. Mundy
    • Michael E. AhoJohn E. AttinellaThomas M. GoodingMichael B. Mundy
    • G06F15/16
    • Configuring compute nodes in a parallel computer using remote direct memory access (‘RDMA’), the parallel computer comprising a plurality of compute nodes coupled for data communications via one or more data communications networks, including: initiating, by a source compute node of the parallel computer, an RDMA broadcast operation to broadcast binary configuration information to one or more target compute nodes in the parallel computer; preparing, by each target compute node, the target compute node for receipt of the binary configuration information from the source compute node; transmitting, by each target compute node, a ready message to the target compute node, the ready message indicating that the target compute node is ready to receive the binary configuration information from the source compute node; and performing, by the source compute node, an RDMA broadcast operation to write the binary configuration information into memory of each target compute node.
    • 使用远程直接存储器访问(“RDMA”)来配置并行计算机中的计算节点,所述并行计算机包括经由一个或多个数据通信网络耦合用于数据通信的多个计算节点,包括:由源计算节点 并行计算机,RDMA广播操作以将二进制配置信息广播到并行计算机中的一个或多个目标计算节点; 由每个目标计算节点准备用于从源计算节点接收二进制配置信息的目标计算节点; 由所述目标计算节点向所述目标计算节点发送就绪消息,所述就绪消息指示所述目标计算节点准备好从所述源计算节点接收所述二进制配置信息; 并且由源计算节点执行RDMA广播操作以将二进制配置信息写入每个目标计算节点的存储器中。
    • 29. 发明申请
    • Messaging In A Parallel Computer Using Remote Direct Memory Access ('RDMA')
    • 使用远程直接内存访问(“RDMA”)的并行计算机中的消息传递
    • US20120331065A1
    • 2012-12-27
    • US13167911
    • 2011-06-24
    • Michael E. AhoThomas M. GoodingMichael B. MundyAndrew T. Tauferner
    • Michael E. AhoThomas M. GoodingMichael B. MundyAndrew T. Tauferner
    • G06F15/16
    • G06F15/167G06F15/17331
    • Messaging in a parallel computer using remote direct memory access (‘RDMA’), including: receiving a send work request; responsive to the send work request: translating a local virtual address on the first node from which data is to be transferred to a physical address on the first node from which data is to be transferred from; creating a local RDMA object that includes a counter set to the size of a messaging acknowledgment field; sending, from a messaging unit in the first node to a messaging unit in a second node, a message that includes a RDMA read operation request, the physical address of the local RDMA object, and the physical address on the first node from which data is to be transferred from; and receiving, by the first node responsive to the second node's execution of the RDMA read operation request, acknowledgment data in the local RDMA object.
    • 使用远程直接内存访问(RDMA)在并行计算机中进行消息传递,包括:接收发送工作请求; 响应于所述发送工作请求:将要从其传送数据的第一节点上的本地虚拟地址转换为要从其传送数据的第一节点上的物理地址; 创建本地RDMA对象,其包括设置为消息收发确认字段的大小的计数器; 从第一节点中的消息单元向第二节点中的消息单元发送包括RDMA读操作请求,本地RDMA对象的物理地址以及第一节点上的物理地址的消息,数据为 被转移 以及响应于所述第二节点执行所述RDMA读取操作请求的所述第一节点接收所述本地RDMA对象中的确认数据。
    • 30. 发明申请
    • THREAD SPECULATIVE EXECUTION AND ASYNCHRONOUS CONFLICT EVENTS
    • 螺旋线性执行和异常冲突事件
    • US20110209154A1
    • 2011-08-25
    • US12711328
    • 2010-02-24
    • Thomas M. GoodingJohn Kevin O'BrienKai-Ting Amy WangXiaotong Zhuang
    • Thomas M. GoodingJohn Kevin O'BrienKai-Ting Amy WangXiaotong Zhuang
    • G06F9/46
    • G06F11/1469G06F9/3834G06F9/3842G06F9/3851G06F9/3861G06F9/467
    • 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.
    • 在一个实施例中,在先前的回滚期间期间接收到异步冲突事件。 每个异步冲突事件表示由第一多个工作单元的推测性执行而遇到的冲突,并且可以被无序地接收。 在当前回滚期间,确定第一工作单元,其推测执行引起异步冲突事件中的一个,并且第一工作单元比第一多个工作单元中的所有其他工作单元老。 确定第二多个作业单元,其年龄等于或小于第一工作单元,其中第二多个作业单元中的每一个分配给相应的执行螺纹。 执行第二多个工作单元的回滚。 在执行第二多个工作单元的回滚之后,第二个多个工作单元的推测性执行以年龄从最早到最小的顺序启动。