Abstract: A system provides communication between a plurality of cores in an integrated circuit. The system comprises a circular segmented bus operatively connected to each of the cores for transferring data between the plurality of cores. An arbiter arbitrates which of the plurality of cores can transmit data at any given time.

Abstract: A structure and associated method of transfer data on a semiconductor device, comprising: a plurality of systems within the semiconductor device. Each system comprises at least one processing device and a local memory structure. Each processing device is electrically coupled to each local memory structure within each system. Each local memory structure is electrically coupled to each of the other said local memory structures. Each local memory structure is adapted to share address space with each of the processing devices. Each processing device is adapted to transmit data and instructions to each local memory structure.

Abstract: A system provides communication between a plurality of cores in an integrated circuit. The system comprises a circular segmented bus operatively connected to each of the cores for transferring data between the plurality of cores. An arbiter arbitrates which of the plurality of cores can transmit data at any given time.

Abstract: A system and method for dynamically altering a clock speed of a clock signal used for timing of data signal transmissions and receptions within an integrated circuit (IC) device. The system includes a clock generator circuit for providing a clock signal used for timing of data signal transmission and reception within the IC; a monitoring circuit for receiving data transmissions generated at different clock speeds and detecting when a data transmission fail point is achieved at a particular clock speed; and, a device for adjusting the clock speed according to a maximum speed allowed for the IC that avoids the data transmission fail point.

Abstract: A method and system for testing a circuit design. The method including generating a simulation model of the circuit design, the circuit design comprising one or more source latches, one or more destination latches and a logic function connected between the source latches and the destination latches; generating a modified simulation model of the simulation model by inserting random skew between an output of each source latch and an input of the logic function only in asynchronous data paths between the source latches and the destination latches of the simulation model; and running the modified simulation model.

Abstract: A structure and associated method of transfer data on a semiconductor device, comprising: a plurality of systems within the semiconductor device. Each system comprises at least one processing device and a local memory structure. Each processing device is electrically coupled to each local memory structure within each system. Each local memory structure is electrically coupled to each of the other said local memory structures. Each local memory structure is adapted to share address space with each of the processing devices. Each processing device is adapted to transmit data and instructions to each local memory structure.

Abstract: Disclosed is an integrated circuit comprising a plurality of cores attached to at least one transmitter and receiver, an optical transmission network embedded within the wire levels of the integrated circuit, and wherein the transmitter and receivers send and receive data on the network. Also disclosed is a method of transmitting signals within an integrated circuit comprising an integrated circuit comprising a plurality of cores and optical paths, selecting an optical path from the plurality of optical paths for transmitting data, and transmitting the data on the selected optical path. Also disclosed is an integrated circuit comprising an optical transmission network, a plurality of cores, and a plurality of controllers, all three being operatively attached to each other.

Abstract: A system and method for dynamically altering a clock speed of a clock signal used for timing of data signal transmissions and receptions within an integrated circuit (IC) device. The system includes a clock generator circuit for providing a clock signal used for timing of data signal transmission and reception within the IC; a monitoring circuit for receiving data transmissions generated at different clock speeds and detecting when a data transmission fail point is achieved at a particular clock speed; and, a device for adjusting the clock speed according to a maximum speed allowed for the IC that avoids the data transmission fail point.

Abstract: A method and system for increasing compression efficiency of a lossless data compression utility. The data compression utility compresses a segmented input data stream into independently decompressible data blocks, and includes a history buffer that maintains a history of matching character sequences. In accordance with the method of the present invention, a data segment is compressed utilizing a history buffer to identify repeated character sequences within the data segment. Upon receipt of a next data segment to be compressed, the history buffer is updated to include a pre-selected data set and reset data from the next data segment. As part of the compression an adaptable cache is searched for non-repeating bytes within a next data segment. Matching bytes are coded as cache references. Further efficiency is obtained by processing the next data segment as two-byte pairs.

Abstract: A system provides communication between a plurality of cores in an integrated circuit. The system comprises a circular segmented bus operatively connected to each of the cores for transferring data between the plurality of cores. An arbiter arbitrates which of the plurality of cores can transmit data at any given time.

Abstract: A method and system for increasing compression efficiency of a lossless data compression utility. The data compression utility compresses a segmented input data stream into independently decompressible data blocks, and includes a history buffer that maintains a history of matching character sequences. In accordance with the method of the present invention, a data segment is compressed utilizing a history buffer to identify repeated character sequences within the data segment. Upon receipt of a next data segment to be compressed, the history buffer is updated to include a pre-selected data set and reset data from the next data segment. As part of the compression an adaptable cache is searched for non-repeating bytes within a next data segment. Matching bytes are coded as cache references. Further efficiency is obtained by processing the next data segment as two-byte pairs.

Abstract: A program product for a message processing system in which messages are transmitted from source nodes to destination nodes. A transmission flow control technique is disclosed in which the source node optimistically sends control information and a data portion of a message, and wherein a destination node discards the data portion of the message if it is unable to accommodate it. The destination node, however, retains enough of the control information to identify the message to the source node, and when the destination node is subsequently able to accommodate the data portion, the destination node issues a request to the source node to retransmit the data portion of the message. Discarding of one message is followed by discards of sequential messages, until the destination node is able to accommodate the data portions of messages.

Abstract: A method for a message processing system in which messages are transmitted from source nodes to destination nodes. A transmission flow control technique is disclosed in which the source node optimistically sends control information and a data portion of a message, and wherein a destination node discards the data portion of the message if it is unable to accommodate it. The destination node, however, retains enough of the control information to identify the message to the source node, and when the destination node is subsequently able to accommodate the data portion, the destination node issues a request to the source node to retransmit the data portion of the message. Discarding of one message is followed by discards of sequential messages, until the destination node is able to accommodate the data portions of messages.

Abstract: A system for a message processing system in which messages are transmitted from source nodes to destination nodes. A transmission flow control technique is disclosed in which the source node optimistically sends control information and a data portion of a message, and wherein a destination node discards the data portion of the message if it is unable to accommodate it. The destination node, however, retains enough of the control information to identify the message to the source node, and when the destination node is subsequently able to accommodate the data portion, the destination node issues a request to the source node to retransmit the data portion of the message. Discarding of one message is followed by discards of sequential messages, until the destination node is able to accommodate the data portions of messages.

Abstract: A method and apparatus for reducing data expansion during data compression are provided that allow the coding scheme used to compress data to be swapped between two or more coding schemes. Specifically, a coding window is provided that holds data to be compressed, and the compression potential of data entering or exiting the coding window is calculated. When a first threshold compression potential sum of data entering the window is reached, the coding scheme used to compress the data within the coding window is swapped from one coding scheme to another. A new compression potential sum is set based upon the compression potential of data exiting the window. The compression potential sum comprises a running total of the compression potential of data entering the coding window; and the coding scheme used to compress data within the coding window is swapped from one coding scheme to another when the compression potential sum reaches a first predetermined value.

Abstract: A method of reducing data expansion during data compression is provided that allows the coding scheme used to compress data to be swapped between two or more coding schemes. Specifically, a coding window is provided that allows analysis of the compression potential of data within the coding window. The data within the coding window then is analyzed to determine the compression potential of the data. If the compression potential of the data exceeds a first predetermined value, the coding scheme used to compress the data within the coding window is swapped from one coding scheme to another. Preferably the first predetermined value is programmable and is related to the bit cost required to swap back and forth between coding schemes. The two preferred coding schemes are ALDC Lempel-Ziv 1 coding and a pass-through coding scheme wherein raw data is passed unencoded.

Abstract: A method, system, and associated program code and data structures are provided for a message processing system in which messages are passed from source nodes to destination nodes. Notification of the arrival of the messages at the destination nodes can be effected by programmable source initiated interrupts or destination initiated interrupts. The source initiated interrupts are implemented as set fields embedded in the message packets sent from a source node to a destination node and trigger the requisite interrupt at the destination node upon message arrival. The destination initiated interrupts are implemented as pre-set fields in anticipatory buffers which are allocated at the destination node for incoming messages from the source node. Standard incoming message queue polling, as well as interrupt enabling and disabling functions are also provided, which together allow the system to selectively invoke interrupt or alternative strategies to notify destination nodes of arriving messages.

Abstract: A method, system, and associated program code and data structures are provided for a message processing system in which messages are passed from source nodes to destination nodes. Notification of the arrival of the messages at the destination nodes can be effected by programmable source initiated interrupts or destination initiated interrupts. The source initiated interrupts are implemented as set fields embedded in the message packets sent from a source node to a destination node and trigger the requisite interrupt at the destination node upon message arrival. The destination initiated interrupts are implemented as pre-set fields in anticipatory buffers which are allocated at the destination node for incoming messages from the source node. Standard incoming message queue polling, as well as interrupt enabling and disabling functions are also provided, which together allow the system to selectively invoke interrupt or alternative strategies to notify destination nodes of arriving messages.

Abstract: A method, system, and associated program code and data structures are provided for a message processing system in which messages are passed from source nodes to destination nodes. Notification of the arrival of the messages at the destination nodes can be effected by programmable source initiated interrupts or destination initiated interrupts. The source initiated interrupts are implemented as set fields embedded in the message packets sent from a source node to a destination node and trigger the requisite interrupt at the destination node upon message arrival. The destination initiated interrupts are implemented as pre-set fields in anticipatory buffers which are allocated at the destination node for incoming messages from the source node. Standard incoming message queue polling, as well as interrupt enabling and disabling functions are also provided, which together allow the system to selectively invoke interrupt or alternative strategies to notify destination nodes of arriving messages.

Abstract: A system for a message processing system in which messages are transmitted from source nodes to destination nodes. A transmission flow control technique is disclosed in which the source node optimistically sends control information and a data portion of a message, and wherein a destination node discards the data portion of the message if it is unable to accommodate it. The destination node, however, retains enough of the control information to identify the message to the source node, and when the destination node is subsequently able to accommodate the data portion, the destination node issues a request to the source node to retransmit the data portion of the message. Discarding of one message is followed by discards of sequential messages, until the destination node is able to accommodate the data portions of messages.