Abstract: A method that includes determining a first clock gap for a first block of an integrated circuit based on a performance factor of the first block or an external factor and adjusting a clock signal to the first block based on the first clock gap. The method also includes determining a second clock gap for a second block of the integrated circuit based on (i) the first clock gap and (ii) a performance factor of the second block or the external factor. The second clock gap is different from the first clock gap. The method further includes adjusting the clock signal to the second block based on the second clock gap.

Abstract: A method that includes determining a first clock gap for a first block of an integrated circuit based on a performance factor of the first block or an external factor and adjusting a clock signal to the first block based on the first clock gap. The method also includes determining a second clock gap for a second block of the integrated circuit based on (i) the first clock gap and (ii) a performance factor of the second block or the external factor. The second clock gap is different from the first clock gap. The method further includes adjusting the clock signal to the second block based on the second clock gap.

Abstract: In one embodiment, an apparatus cascades groups of serialized data streams through devices, and performs operations based on information communicated therein. A received group of serialized data streams is aligned, but not framed, and forwarded to a next device (e.g., a next stage in a linear or tree cascaded formation of devices). Eliminating the framing and subsequent serialization operations performed on the received group of serialized data streams reduces the latency of communications through the cascaded devices, which can be significant when considered in relation to the high-speed communication rates. The received group of serialized data streams is also framed to create a sequence of data frames for processing (e.g., associative memory lookup operations, controlling multiplexing of received downstream serialized data streams, general or other processing) within the device.

Abstract: In one embodiment, an apparatus cascades groups of serialized data streams through devices, and performs operations based on information communicated therein. A received group of serialized data streams is aligned, but not framed, and forwarded to a next device (e.g., a next stage in a linear or tree cascaded formation of devices). Eliminating the framing and subsequent serialization operations performed on the received group of serialized data streams reduces the latency of communications through the cascaded devices, which can be significant when considered in relation to the high-speed communication rates. The received group of serialized data streams is also framed to create a sequence of data frames for processing (e.g., associative memory lookup operations, controlling multiplexing of received downstream serialized data streams, general or other processing) within the device.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-readable media, mechanisms, and means for communicating with a memory device, such as by a memory controller, a refresh command at least partially overlapping in time with a read and/or write command. The refresh command typically specifies a group of locations (e.g., a bank) for being at least partially refreshed.

Abstract: Meta-packets are used to more efficiently reassemble packets and to more efficiently conduct other packet processing operations. The meta-packets are special types of packets which are interpreted by hardware in a queuing system. Instead of directly containing data, the meta-packet packets contain instructions for building a desired packet from various identifiable storage locations in the packet processor system. Because the reassembled packet replaces the meta-packet, packet ordering is preserved.

Abstract: An apparatus has at least one processing unit to generate a request having a request privilege level. At least one resource exists in the apparatus to receive the request and determine if the request is allowable. The apparatus includes an error handler that determines the nature of an error and performs a reset based upon the privilege level of the request that cause the error.

Abstract: The invention provides a method of encoding a data packet for encapsulation in one or more frames for communication from a transmitter to a receiver in a network interface. The method includes dividing the data packet into one or more data chunks and determining the length of a data chunk as the lesser of the number of bytes available in a current frame, the number of bytes remaining in the data packet, or a predetermined number of bytes. The method includes determining if the data chunk is the end-of-the-packet (EOP) and when the data chunk is not the EOP, the method includes prepending the data chunk with a control character representing the length of the data chunk and non-EOP.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-readable media, mechanisms, and means for communicating with a memory device, such as by a memory controller, a refresh command at least partially overlapping in time with a read and/or write command. The refresh command typically specifies a group of locations (e.g., a bank) for being at least partially refreshed.

Abstract: An apparatus has at least one processing unit to generate a request having a request privilege level. At least one resource exists in the apparatus to receive the request and determine if the request is allowable. The apparatus includes an error handler that determines the nature of an error and performs a reset based upon the privilege level of the request that cause the error.

Abstract: Meta-packets are used to more efficiently reassemble packets and to more efficiently conduct other packet processing operations. The meta-packets are special types of packets which are interpreted by hardware in a queuing system. Instead of directly containing data, the meta-packet packets contain instructions for building a desired packet from various identifiable storage locations in the packet processor system. Because the reassembled packet replaces the meta-packet, packet ordering is preserved. For example, assuming the meta-packet was in the proper place in a packet sequence, the packet (or packets) replacing the meta-packet will also be maintained in the same packet sequence order. Both meta-packets and conventional packets can be processed using the same queues and queuing system, and can be freely inter-mixed allowing co-existence of reassembled and full packets.

Abstract: The invention provides a method of encoding a data packet for encapulation in one or more frames for communication from a transmitter to a receiver in a network interface. The method includes dividing the data packet into one or more data chunks and determining the length of a data chunk as the lesser of the number of bytes available in a current frame, the number of bytes remaining in the data packet, or a predetermined number of bytes. The method includes determining if the data chunk is the end-of-the-packet (EOP) and when the data chunk is not the EOP, the method includes prepending the data chunk with a control character representing the length of the data chunk and non-EOP.

Abstract: The invention provides a method of encoding a data packet for encapsulation in one or more frames for communication from a transmitter to a receiver in a network interface. The method includes dividing the data packet into one or more data chunks and determining the length of a data chunk as the lesser of the number of bytes available in a current frame, the number of bytes remaining in the data packet, or a predetermined number of bytes. The method includes determining if the data chunk is the end-of-the-packet (EOP) and when the data chunk is not the EOP, the method includes prepending the data chunk with a control character representing the length of the data chunk and non-EOP.