Marvell International Limited

Marvellworld Trade Ltd.

Xelerated Newco Ab

Sarig Livne

Vitaly Sukonik

Jakob Carlström

Bengt Werdin

Mark Dunaevsky

Rafi Tamir

Einat Ophir

The present invention relates to a data buffer memory () and method for storing data in a data communications network, and to a data buffer system () comprising such a data buffer memory. The data buffer memory comprising a data section (') comprising a number of memory pages (); and a package descriptor section (&#x2032;) comprising a 5 number of package descriptors (); wherein at least one queue () of packets is stored in the data section (&#x2032;) as an ordered set of packages, and wherein a package is an ordered set of packets.

Packet buffer comprising a data section and a data description section

Aspects of the disclosure provide a method for communicating queue information. The method includes determining a queue state for each one of a plurality of queues at least partially based on respective queue length, selecting a queue with a greatest difference between the queue state of the queue and a last reported queue state of the queue, and reporting the queue state of the selected queue to at least one node.

Method, network device, computer program and computer program product for communication queue state

Aspects of the disclosure provide a method for network traffic scheduling. The method includes selecting, at a present node within a node hierarchy that multiplexes a plurality of input nodes to an output node, a winning node from a plurality of lower level nodes, obtaining first parameters provided from the winning node, the first parameters being in association with the winning node, determining second parameters in association with the present node at least partially based on the first parameters, and providing the second parameters in association with the present node to an upper level node in the node hierarchy for scheduling at the upper level node. To determine the second parameters in association with the present node, in an embodiment, the method includes using the first parameters to look up an entry in a lookup table that stores the second parameters in association with the first parameters.

Network traffic scheduler and associated method, computer program and computer program product

Embodiments of the present invention provide a system for scheduling memory accesses for one or more memory devices. This system includes a set of queues configured to store memory access requests, wherein each queue is associated with at least one memory bank or memory device in the one or more memory devices. The system also includes a set of hierarchical levels configured to select memory access requests from the set of queues to send to the one or more memory devices, wherein each level in the set of hierarchical levels is configured to perform a different selection operation.

Access scheduler

The disclosed embodiments relate to a system for controlling accesses to one or more memory devices. This system includes one or more write queues configured to store entries for write requests, wherein a given entry for a write request includes an address and write data to be written to the address. The system also includes a search mechanism configured to receive a read request which includes an address, and to search the one or more write queues for an entry with a matching address. If a matching address is found in an entry in a write queue, the search mechanism is configured to retrieve the write data from the entry and to cancel the associated write request, whereby the read request can be satisfied without accessing the one or more memory devices.

Growing community of inventors

Ramat Gan, Israel

Sarig Livne