Hewlett-packard Development Company, L.P.

Digital Equipment Corporation

National Semiconductor Corporation

Hewlett Packard Enterprise Development LP

Richard Perham Helliwell

Brian C Edem

Richard Fitzhugh Wrenn

Edward A Gardner

John T Johnston

Richard Franklin Lary

Clark Edward Lubbers

David William Thiel

Randy L Roberson

James Michael Reuter

Robert George Bean

Keith D Woestehoff

Masami Y Hua

A transmitting end-point computes a current transmission rate for each respective outbound half-route of outbound half-routes of a route set between transmitting and receiving end-points. The transmitting end-point receives, from the receiving end-point via a respective inbound half-route of the route set, a transmission rate limit for each respective outbound half-route, the transmission rate limit computed by the receiving end-point from routing headers of messages received by the receiving end-point on the respective outbound half-route, wherein the transmission rate limit for each respective outbound half-route places an upper bound on the current transmission rate for transmissions issued on the respective outbound half-route.

System and method for message routing in a network

A system and method for message routing in a computer network. The present system establishes a routing layer between the network and transport layers in a network, for communicating routing information between end-points in the network. A route management connection for communicating route management information between two ports in the network is established between pseudo end-points in the network. A route and route set are established between end-points in the network, where the route set provides a relationship between two end-point incarnations that indicates the existence of at least one route between the end-points. A route set management connection is established between the end-points for managing connections that are established on the route set. A route between the end points is selected using a route in the route set, and an application connection is established between two applications running on respective end-points in the network, using the route set and the route set management connection.

A management interface for a virtualized storage system including a virtualized logical disk object representing a virtual storage container, wherein the logical disk is an abstract representation of physical storage capacity provided by plurality of physical stores. A virtual disk object represents a virtual storage container. The virtual disk object is an abstract representation of one or more logical disk objects, the virtual disk object including an exposed management interface. Wherein the virtual disk object is managed through the management interface to select the one or more logical disk objects represented by the virtual disk object.

System and method for interfacing with virtual storage

A system and method for selecting a route, from within the set of network routes between the source and destination end-points, for retransmission of information initially sent via a suspected failed route such that the selected route has a minimum number of network components in common with the suspected failed route. In one aspect, the routes between source and destination end-points are grouped into a route set and placed in order in a circular list by the destination end-point. When the source end-point deems it necessary to retransmit information sent via a suspected failed route, it selects the next acceptable route following the suspected failed route from the circular list. The circular list order is determined such that adjacent routes have few common network components.

System for selecting routes for retransmission in a network

A virtual storage system comprises an agent to store a first table to map virtual storage segments to storage locations, and a controller to store a second table and to intermittently cause contents of the first table to be replaced by contents of the second table. During an I/O operation, one of the entries in the first table can be accessed by a host to determine one of the storage locations. Also, a method for performing an I/O operation on a virtual storage segment, defined by first table that maps a storage segment to a first storage location, comprises turning off I/O operations at the first storage location, identifying portions of the virtual storage segment to be effected during a write operation, storing a record of identified portions at a second table not the first table, and writing to portions of the second storage location associated with the identified portions.

Centralized fine-grained enhancements for distributed table driven I/O mapping

A method for controlling command message flow in a network including a server and a client. A command window, comprising a maximum number of command messages that may be outstanding at the server, is included in messages sent from the server to the client. The value of the command window at the server is modified in accordance with available server resources for receiving command messages. When there are insufficient resources at the server to process one of the command messages delivered to the server, then a pause message is sent to the client indicating which said command message cannot be received; indicia is stored that indicates the command message initially discarded; and subsequent said command messages delivered to the server are discarded until an initially discarded said command message is again delivered to the server.

Controlling command message flow in a network

A system for addressing end-points in a network wherein a transmission is sent between a source end-point and a destination end-point via a respective source port and a destination port connected by a fabric. A payload offset and buffer pool handle are included in a network header sent with the transmission. The buffer pool handle is used to determine a specific queue of pool buffers within the destination port. A pool buffer descriptor, describing a header buffer and a payload buffer each within the destination end-point, is dequeued from a queue indicated by the buffer pool handle. The payload offset in the network header is then decoded to locate a first number of bytes of data in the transmission to be transferred into the header buffer a second number of bytes of data to be transferred into the payload buffer.

System for communicating between network end-points using a payload offset and buffer pool handle

A system and method for determining route quality in a network in which multiple routes exist between a transmitting end-point and a receiving end-point. Initially, a routing sequence number is associated with each transmission sent on a route in the network, such that consecutive transmissions sent on one of the routes have consecutive routing sequence numbers. The routing sequence number for a first one of the routes is included in transmissions sent on a second one of the routes. The routing sequence number of the first route, received on the second route, is used as an indicator of the route quality of the first route, and this indicator is compared to an expected routing sequence number for the first route to determine a likelihood of whether the transmissions sent via the first route are either lost or delayed. The expected routing sequence number is normally incremented each time a transmission is received on the second route.

System for determining network route quality using sequence numbers

Generating unique identifiers (UUIDs) for software objects and other components in a network in which a large number of components may exist simultaneously and/or over a period of time. UUIDs generated by a particular product are divided into two sub-fields. One sub-field is stored in non-volatile memory, and incremented infrequently. The other sub-field is stored in volatile memory, that can be incremented frequently. During operation, the product creating the UUIDs generates new UUIDs by incrementing the field stored in volatile memory. When overflow of the volatile memory field occurs, the field stored in non-volatile memory is incremented. A block of non-volatile memory is initialized to all of a first logical state, and the bits therein are then sequentially cleared to generate a subsequent unique identifier. The present system provides the equivalent of a counter that can count up to the number of available bits in non-volatile memory plus one, while reducing the number of non-volatile memory erase cycles to one cycle for each time all the bits are cleared.

Generating unique identifiers in a computer system

A system for generating unique identifiers (UUIDs) for software objects and other components in a network in which a large number of components may exist simultaneously and/or over a period of time. UUIDs generated by a particular product are divided into two sub-fields. One sub-field is stored in (relatively slow) non-volatile memory, and incremented infrequently. The other sub-field is stored in relatively fast, volatile RAM, that can be incremented quickly. During operation, the product creating the UUIDs generates new UUIDs by incrementing the field stored in RAM. When overflow of the RAM field occurs, the field stored in non-volatile memory is incremented. A block of flash memory is initialized to all ones, and the bits therein are then sequentially cleared to generate each subsequent unique identifier. The present system provides the equivalent of a counter that can count up to the number of available bits in non-volatile memory plus one, while reducing the number of flash memory erase cycles to one cycle for each time all the bits are cleared.

System for generating unique identifiers in a computer network

A speed and memory control system and method for use with a sort accelerator having a rebound sorter and merger is disclosed. The speed and memory control system includes a variable length shift register which utilizes circulating RAM indexing, tag extraction lookahead features to speed up access of records, and merge lookahead and memory management features to provide quick and effective storage of records.

Sorting system for serially processing records

A speed and memory control system and method for use with a sort accelerator having a rebound sorter. The speed and memory control system includes a variable length shift register which utilizes circulating RAM indexing, tag extraction lookahead features to speed up access of records, and merge lookahead and memory management features to provide quick and effective storage of records.

Sort and merge system using tags associated with the current records

A data integrity checking system and method for use with a sort accelerator having a rebound sorter as a merger. The data integrity checking system checks the integrity of data which has been processed by a sorting system wherein unsorted data has been received from and sorted data has been delivered to a host processor. Parity valves and checksum schemes are used. Sorted data is also checked for proper sorting by a sort order checker.

Data integrity features for a sort accelerator

A stable sorting system and method for use with a sort accelerator having a rebound sorter as a merger is disclosed. The stable sorting system maintains an output order of records which have equal keys. This output order is the same order of those records as they entered the rebound sorter. Stable sorting is maintained in both the sorting and the merging operations of the sort accelerator. An additional byte is inserted between the key and the data of a record to preserve record order for records having equal keys.

Stable sorting for a sort accelerator

A control system and method for use with a sort accelerator having a rebound sorter as a merger in disclosed. The control system allows records to be efficiently and effectively transferred between processing elements and record storage elements of a rebound sorter. The control system allows consecutive groups of records to be sorted in the rebound sorter without mixing records from separate groups. The control system also pipelines records through the sorter by allowing different groups of records to input into the rebound sorter directly adjacent to each other.

Growing community of inventors

Colorado Springs, CO, United States of America

Richard Perham Helliwell