Abstract: Systems and methods for monitoring hardware observation points within a System on a Chip (SoC) are disclosed. In one embodiment, a monitoring system includes observers electrically coupled to corresponding hardware observation points. For each observation time period, the observer receives events from a corresponding hardware observation point and outputs observation data indicative of the number of events received. Each observer operates in the same clock and power domain as the corresponding hardware observation point. The hardware monitoring system includes collectors; each collector receives the observation data from a corresponding observer for the observation time period(s). Each collector updates a value of a live-counter based on the observation data and outputs the value of the live-counter. By counting the number of events at the hardware observation points, the monitoring system can enable detailed runtime monitoring, which can be used, e.g.

Abstract: Systems and methods for monitoring hardware observation points within a System on a Chip (SoC) are disclosed. In one embodiment, a monitoring system includes observers electrically coupled to corresponding hardware observation points. For each observation time period, the observer receives events from a corresponding hardware observation point and outputs observation data indicative of the number of events received. Each observer operates in the same clock and power domain as the corresponding hardware observation point. The hardware monitoring system includes collectors; each collector receives the observation data from a corresponding observer for the observation time period(s). Each collector updates a value of a live-counter based on the observation data and outputs the value of the live-counter. By counting the number of events at the hardware observation points, the monitoring system can enable detailed runtime monitoring, which can be used, e.g.

Abstract: The invention relates to a method and an apparatus for distribution of bandwidth in a switch or router. More particularly, the invention relates to a scheduler and an associated algorithm for distributing bandwidth over data traffic directed to output ports and received in various traffic classes and flows. The switch has a switching fabric. Preferably, the bandwidth scheduler is located before output queues, and the method includes: receiving a stream of data from the switching fabric; subjecting the stream to a decision making algorithm in the bandwidth scheduler resulting in that the stream is forwarded or interrupted (accepted or rejected). Preferably, the stream of data includes identifiable data packets and the decision making algorithm in the bandwidth scheduler results in the data packet being accepted or rejected. The bandwidth scheduler may be located before the output queues leading to early discarding of packets and efficient use of output buffer memory.

Abstract: The invention relates to a method for flow control in a switch and a switch controlled thereby. In order to ensure that no or few packets are dropped in a switch because of a congested internal memory, pause frames or stop command messages are sent to upstream senders. When to send pause frames are determined by monitoring the buffer contents of the switch and estimating the total expected contents of the links between the senders and the switch. The pause frames are sent to the most offending senders, i.e. the senders causing the largest queues in the switch.

Abstract: The invention relates to a method and means for managing packet queues in switches. The switch has a shared memory split in a small internal memory and a large external memory. There is limited bandwidth to the external memory. The method comprises the steps of dividing a data stream incoming on the input ports intended for respective output ports into two parts, of which the first part is to be sent to an internal queue belonging to at least one output port and the second part is to be sent to the external memory. The incoming data stream may be identified as belonging to flow groups and the division of the data stream is then performed e.g. such that flow groups with a higher priority than a division threshold are sent to said internal queues in the first part, while flow groups with priority lower than said threshold are sent to the external memory in the second part.

Abstract: The invention relates to a scheduler method and device for handling output queues in a switch. The invention incorporates a number of co-operating techniques such as weighted and deficit driven round-robin and interleaving. The invention provides a scheduling method in a switch in which an input data stream is received and stored in a number of output queues, the method comprising the steps of: polling all queues in order; if the polled queue contains data, refilling a deficit value indicating a maximum amount of data that may be sent from this queue; if the deficit value permits, sending data, and decreasing the deficit value a corresponding amount for the polled queue, else disabling the queue; if any queue is permitted to send after all the queues have been polled, going to a local round, else start polling the first queue of the order again. The invention enables e.g. priority treatment of queues, fairness with regard to varying packet lengths and avoids burstiness.

Abstract: The invention relates to a scheduler method and device for handling output queues in a switch. The invention incorporates a number of co-operating techniques such as weighted and deficit driven round-robin and interleaving. The invention provides a scheduling method in a switch in which an input data stream is received and stored in a number of output queues, the method comprising the steps of: polling all queues in order; if the polled queue contains data, refilling a deficit value indicating a maximum amount of data that may be sent from this queue; if the deficit value permits, sending data, and decreasing the deficit value a corresponding amount for the polled queue, else disabling the queue; if any queue is permitted to send after all the queues have been polled, going to a local round, else start polling the first queue of the order again. The invention enables e.g. priority treatment of queues, fairness with regard to varying packet lengths and avoids burstiness.