Hewlett Packard Enterprise Development LP

Al Davis

Nicholas George McDonald

Gregg Bernard Lesartre

Paolo Faraboschi

Gary Belgrave Gostin

Darel N Emmot

Harumi Kuno

Derek Alan Sherlock

Vanish Talwar

Yuan Chen

Daniel Juergen Gmach

Charles Stuart Johnson

John Kim

Adit Madan

Nicholas George Mcdonald

Darel Nea Emmot

In one example, a memory network may control access to a shared memory that is by multiple compute nodes. The memory network may control the access to the shared memory by receiving a memory access request originating from an application executing on the multiple compute nodes and determining a priority for processing the memory access request. The priority determined by the memory network may correspond to a memory address range in the memory that is specifically used by the application.

Memory network to prioritize processing of a memory access request

In some examples, a node of a computing system may include a failure identification engine and a failure response engine. The failure identification engine may identify a failure condition for a system function of the node and the failure response engine may store a failure indication in a shared memory to trigger takeover of the system function by a different node of the computing system.

Failure indication in shared memory

Examples relate to virtual channel routing in networks considering VC actions to be performed by the packets while routed through the network. A packet is received at an input port of a network device of a network and an output port and a VC action is determined from a routing table associated to the input port based on a packet's destination network device. A VC mask is determined from a Virtual Channel Action Table (VCAT), associated to the routing table, based on a packet's ingress VC and the VC action. A particular VC among the set of VCs defined in the VC mask is selected and the packet is routed to the destination network device using the output port and the particular VC.

Virtual channel routing

Examples disclosed herein relate to receiving, by a scheduler, a request for a window during which to send a data packet through a crossbar. Transmission of the data packet is dependent upon a pool of transmission credits. The scheduler determines whether the pool of transmission credits is sufficient for transmitting the data packet, and when it is determined that the pool of transmission credits is insufficient, the scheduler determines whether to block the request or to speculatively arbitrate the window based on a value of a speculative request counter.

Arbitrating data packets

Growing community of inventors

Coalville, CA, United States of America

Al Davis