Abstract: An apparatus and method are provided for scheduling transmit network events in a multiprocessing environment. Each processing node handles its own linked list of transmit object queues and linked list of transport queues. Therefore efficient handling of the transmit network events is enabled. Queues may be added, made inactive, or removed depending on the status of a specific transmit event the queue handles. By maintaining queues in memory, the apparatus is easily scalable, in linear relationship with the size of the memory made available.

Abstract: A memory system with folding error correction. The memory comprises a first memory bank and a second memory bank. A means for generating error correction code for data to be written to said memory system is provided. A means for writing said received data to a location in said first memory bank corresponding to a received address of said received data is provided. Further, a means for generating an error correction code write address in said second memory bank based on said received address. Still further, a means for writing said error correction code to said error correction code write address is provided.

Abstract: An apparatus and method are provided for termination of received network events (i.e., a packet received from the network) in a multiprocessing environment. Each processing node may handle one or more receive object queues, which may be linked in a linked list fashion, as well as a linked list of application stream queues to enable efficient termination of the received network events. Queues may be added, made inactive, or removed, depending on the status of a specific receive event the queue handles. By maintaining queues in memory the apparatus is easily scalable, linearly with the size of the memory made available.

Abstract: An apparatus comprising a transmit portion and a receive portion. The transmit portion may be configured to present (i) one or more data signals and (ii) a configuration signal, in response to one or more input signals. The receive portion may be configured to receive (i) all of the one or more data signals when operating in a first mode and (ii) less than all of the data signals when operating in a second mode. The first and second modes may be configured in response to the configuration signal.

Abstract: An apparatus and method are provided for termination of received network events (i.e., a packet received from the network) in a multiprocessing environment. Each processing node may handle one or more receive object queues, which may be linked in a linked list fashion, as well as a linked list of application stream queues to enable efficient termination of the received network events. Queues may be added, made inactive, or removed, depending on the status of a specific receive event the queue handles. By maintaining queues in memory the apparatus is easily scalable, linearly with the size of the memory made available.

Abstract: An apparatus and method are provided for scheduling transmit network events in a multiprocessing environment. Each processing node handles its own linked list of transmit object queues and linked list of transport queues. Therefore efficient handling of the transmit network events is enabled. Queues may be added, made inactive, or removed depending on the status of a specific transmit event the queue handles. By maintaining queues in memory, the apparatus is easily scalable, in linear relationship with the size of the memory made available.

Abstract: A method and apparatus for synchronization of an audio/visual bitstream is transmitted by an encoder and received by a decoder by employing duplication or elimination of audio samples and video pixels. The invention enables clock synchronization between the encoder and a decoder with an unregulated clock oscillator so as to control the data reader by skipping ahead (eliminating a data element) or to pause (duplicating a data element) depending on whether the encoder clock is faster or slower than the decoder clock.