CACHE MANAGEMENT
    1.
    发明申请
    CACHE MANAGEMENT 有权
    缓存管理

    公开(公告)号:US20140173221A1

    公开(公告)日:2014-06-19

    申请号:US13715526

    申请日:2012-12-14

    IPC分类号: G06F12/08

    摘要: The present disclosure provides techniques for cache management. A data block may be received from an IO interface. After receiving the data block, the occupancy level of a cache memory may be determined. The data block may be directed to a main memory if the occupancy level exceeds a threshold. The data block may be directed to a cache memory if the occupancy level is below a threshold.

    摘要翻译: 本公开提供了用于高速缓存管理的技术。 可以从IO接口接收数据块。 在接收到数据块之后,可以确定高速缓冲存储器的占用水平。 如果占用率超过阈值,则数据块可以被引导到主存储器。 如果占用水平低于阈值,则数据块可以被引导到高速缓冲存储器。

    ADAPTIVE PACKET DEFLECTION TO ACHIEVE FAIR, LOW-COST, AND/OR ENERGY-EFFICIENT QUALITY OF SERVICE IN NETWORK ON CHIP DEVICES
    2.
    发明申请
    ADAPTIVE PACKET DEFLECTION TO ACHIEVE FAIR, LOW-COST, AND/OR ENERGY-EFFICIENT QUALITY OF SERVICE IN NETWORK ON CHIP DEVICES 审中-公开
    适应性分组解决方案实现公平,低成本和/或能源效率的网络服务在芯片设备上的质量

    公开(公告)号:US20140092740A1

    公开(公告)日:2014-04-03

    申请号:US13631878

    申请日:2012-09-29

    IPC分类号: H04L12/70

    摘要: Methods and apparatus for provision of adaptive packet deflection to achieve fair, low-cost, and/or energy-efficient Quality of Service (QoS) in Network-on-Chip (NoC) devices are described. In some embodiments, it is determined whether a target port of a packet has reached a threshold utilization value and the packet is routed to an alternate port in response to a deflection probability value that is to be determined based on a utilization value of the target port and a priority level value of the packet. Other embodiments are also claimed and/or disclosed.

    摘要翻译: 描述了提供自适应分组偏转以在网络片上(NoC)设备中实现公平,低成本和/或节能的服务质量(QoS)的方法和装置。 在一些实施例中,确定分组的目标端口是否已经达到阈值利用值,并且响应于将基于目标端口的利用值确定的偏转概率值将分组路由到备用端口 和分组的优先级值。 还要求和/或公开其它实施例。

    ROUTER PARKING IN POWER-EFFICIENT INTERCONNECT ARCHITECTURES
    3.
    发明申请
    ROUTER PARKING IN POWER-EFFICIENT INTERCONNECT ARCHITECTURES 有权
    路由器驻留在功率有效的互联体系结构中

    公开(公告)号:US20140149766A1

    公开(公告)日:2014-05-29

    申请号:US13994780

    申请日:2012-01-10

    IPC分类号: G06F1/32

    摘要: A method and apparatus for selectively parking routers used for routing traffic in mesh interconnects. Various router parking (RP) algorithms are disclosed, including an aggressive RP algorithm where a minimum number of routers are kept active to ensure adequate network connectivity between active nodes and/or intercommunicating nodes, leading to a maximum reduction in static power consumption, and a conservative RP algorithm that favors network latency considerations over static power consumption while also reducing power. An adaptive RP algorithm is also disclosed that implements aspects of the aggressive and conservative RP algorithms to balance power consumption and latency considerations in response to ongoing node utilization and associated traffic. The techniques may be implemented in internal network structures, such as for single chip computers, as well as external network structures, such as computing clusters and massively parallel computer architectures. Performance modeling has demonstrated substantial power reduction may be obtained using the router parking techniques while maintaining Quality of Service performance objectives.

    摘要翻译: 一种用于选择性地停放用于在网状互连中路由业务的路由器的方法和装置。 公开了各种路由器驻留(RP)算法,包括侵略性RP算法,其中最少数量的路由器保持活动以确保活动节点和/或互通节点之间的足够的网络连接,导致静态功耗的最大降低,以及 保守的RP算法有利于静态功耗下的网络延迟考虑,同时也降低了功耗。 还公开了一种自适应RP算法,其实现了积极和保守的RP算法的各个方面,以响应于正在进行的节点利用率和相关联的流量来平衡功耗和延迟考虑。 这些技术可以在诸如单芯片计算机的内部网络结构以及诸如计算集群和大规模并行计算机体系结构的外部网络结构中实现。 性能建模已经证明,使用路由器停放技术可以获得大量的功率降低,同时保持服务质量的性能目标。

    MECHANISM FOR EMPLOYING AND FACILITATING DYNAMIC AND REMOTE MEMORY COLLABORATION AT COMPUTING DEVICES
    4.
    发明申请
    MECHANISM FOR EMPLOYING AND FACILITATING DYNAMIC AND REMOTE MEMORY COLLABORATION AT COMPUTING DEVICES 审中-公开
    在计算机上进行动态和远程记忆合作的机制

    公开(公告)号:US20130290546A1

    公开(公告)日:2013-10-31

    申请号:US13977692

    申请日:2011-10-07

    IPC分类号: H04L12/70

    摘要: A mechanism is described for facilitating dynamic and remote memory collaboration at computing devices according to one embodiment of the invention. A method of embodiments of the invention includes dynamically classifying a computing device of a plurality of computing devices as a memory server, where the plurality of computing devices are coupled to each other over a network. The method may further include offering, by the memory server, of memory to be used by one or more of the plurality of computing devices classified as one or more memory clients, and remotely granting, by the memory server, of the memory to the one or more memory clients.

    摘要翻译: 描述了根据本发明的一个实施例的用于促进计算设备处的动态和远程存储器协作的机制。 本发明的实施例的方法包括将多个计算设备的计算设备动态地分类为存储器服务器,其中多个计算设备通过网络彼此耦合。 该方法还可以包括由存储器服务器提供要被分类为一个或多个存储器客户机的多个计算设备中的一个或多个的使用的存储器,并且由存储器服务器将存储器远程授予存储器 或更多内存客户端。

    Cache collaboration in tiled processor systems
    5.
    发明授权
    Cache collaboration in tiled processor systems 有权
    在平铺处理器系统中缓存协作

    公开(公告)号:US08838915B2

    公开(公告)日:2014-09-16

    申请号:US13537417

    申请日:2012-06-29

    摘要: The present invention may provide a computer system including a plurality of tiles divided into multiple virtual domains. Each tile may include a router to communicate with others of said tiles, a private cache to store data, and a spill table to record pointers for data evicted from the private cache to a remote host, wherein the remote host and the respective tile are provided in the same virtual domain. The spill tables may allow for faster retrieval of previously evicted data because the home registry does not need to be referenced if requested data is listed in the spill table. Therefore, embodiments of the present invention may provide a distance-aware cache collaboration architecture without incurring extraneous overhead expenses.

    摘要翻译: 本发明可以提供一种包括分成多个虚拟域的多个瓦片的计算机系统。 每个瓦片可以包括与所述瓦片中的其他人通信的路由器,用于存储数据的专用高速缓存以及用于将从专用高速缓存驱逐的数据的指针记录到远程主机的溢出表,其中提供远程主机和相应的瓦片 在同一个虚拟域中。 泄漏表可以允许更快地检索先前驱逐的数据,因为如果请求的数据列在泄漏表中,则不需要引用本地注册表。 因此,本发明的实施例可以提供一种距离感知高速缓存协作架构,而不会产生额外的间接费用。

    TECHNOLOGIES FOR DISTRIBUTED ROUTING TABLE LOOKUP
    9.
    发明申请
    TECHNOLOGIES FOR DISTRIBUTED ROUTING TABLE LOOKUP 有权
    分布式路由表查询技术

    公开(公告)号:US20150312144A1

    公开(公告)日:2015-10-29

    申请号:US14264912

    申请日:2014-04-29

    IPC分类号: H04L12/721 H04L12/755

    摘要: Technologies for distributed table lookup via a distributed router includes an ingress computing node, an intermediate computing node, and an egress computing node. Each computing node of the distributed router includes a forwarding table to store a different set of network routing entries obtained from a routing table of the distributed router. The ingress computing node generates a hash key based on the destination address included in a received network packet. The hash key identifies the intermediate computing node of the distributed router that stores the forwarding table that includes a network routing entry corresponding to the destination address. The ingress computing node forwards the received network packet to the intermediate computing node for routing. The intermediate computing node receives the forwarded network packet, determines a destination address of the network packet, and determines the egress computing node for transmission of the network packet from the distributed router.

    摘要翻译: 通过分布式路由器分布式表查找的技术包括入口计算节点,中间计算节点和出口计算节点。 分布式路由器的每个计算节点包括转发表,用于存储从分布式路由器的路由表获得的不同的一组网络路由条目。 入口计算节点基于接收到的网络分组中包含的目的地地址生成散列密钥。 哈希密钥标识存储转发表的分布式路由器的中间计算节点,其包括与目的地址相对应的网络路由条目。 入口计算节点将接收的网络分组转发到中间计算节点进行路由。 中间计算节点接收转发的网络分组,确定网络分组的目的地址,并确定出口计算节点用于从分布式路由器传输网络分组。