The present invention is directed towards systems and methods for determining failure in and controlling access to a shared resource in a multi-core system. In some embodiments of a multi-core system, individual cores may share the same resource. Additionally, the resource may occasionally fail or need to be reset, and the period during which the resource is being reset may be non-instantaneous. In an embodiment without coordination between the cores, one core experiencing a failure may reset the resource. During the period in which the resource is resetting, another core may interpret the reset as a failure and reset the resource. As more cores interpret the resets as failures, they will trigger resets, quickly resulting in the resource being constantly reset and unavailable. Thus, in some embodiments, a coordination system may be utilized to determine failure of a shared resource and control resets and access to the shared resource.

Systems and method for transaction stall detection and propagating the result in a multi-core architecture

Various methods and apparatuses are described for generating a model of hardware components making up an interconnect that facilitates communications between Intellectual Property blocks in an integrated circuit coded in a software programming language at a high level of abstraction that is cycle accurate to a corresponding lower level of abstraction description of the hardware components making up the interconnect. The sub-components of the model at the high level of abstraction are tested in a simulation environment in parallel with the same sub-components of a model coded in a hardware description language at the low level of abstraction in order to verify the functional accuracy and cycle timing between the two models. After the sub-components are tested, the sub-components of the model at the high level of abstraction may be aggregated into a single model at the high level of abstraction that is functionally accurate and cycle accurate to the model at the low level of abstraction.

Various methods and apparatuses for cycle accurate C-models of components

In one embodiment, payload of multiple threads between intellectual property (IP) cores of an integrated circuit are transferred, by buffering the payload using a number of order queues. Each of the queues is guaranteed access to a minimum number of buffer entries that make up the queue. Each queue is assigned to a respective thread. A number of buffer entries that make up any queue is increased, above the minimum, by borrowing from a shared pool of unused buffer entries on a first-come, first-served basis. In another embodiment, an interconnect implements a content addressable memory (CAM) structure that is shared storage for a number of logical, multi-thread ordered queues that buffer requests and/or responses that are being routed between data processing elements coupled to the interconnect. Other embodiments are also described and claimed.

Shared storage for multi-threaded ordered queues in an interconnect

A method, apparatus, and system are described, which generally relate to an interconnect routing transactions to target IP cores, including two or more channels making up a first aggregate target. The two or more channels populate an address space assigned to the first aggregate target and appear as a single target to the initiator IP cores. The interconnect implements chopping logic to chop an individual transaction from a first initiator IP core whose address sequence crosses a channel address boundary from a first channel to a second channel within the first aggregate target into two or more burst transactions. A first chopped burst transaction is chopped to fit within the address boundaries of the first channel and a second chopped burst transaction is chopped to fit within the address boundaries of the second channel.

Various methods and apparatus for configurable mapping of address regions onto one or more aggregate targets

A system for creating a passage through the pericardium of a patient to permit access of a cardiac harness delivery device, including a tubular introducer sleeve and a tubular dilator sleeve insertable into the introducer sleeve. The introducer sleeve has a slot and a distal portion biased in a reduced opening. The distal end being positioned within an incision through the pericardium. Insertion of the dilator sleeve into the introducer sleeve causes it to push outwardly against the reduced opening, thereby expanding the reduced opening of the introducer sleeve sufficiently to permit a cardiac harness delivery device to access the epicardium. The introducer sleeve is releasably locked to the dilator sleeve by operation of a slot on the introducer sleeve and a protrusion on the dilator sleeve, which slides within the slot. The slot has detents that releasably lock the dilator sleeve at alternative positions within the introducer sleeve, thereby maintaining the reduced opening or, alternatively, the expanded opening to facilitate operation of a cardiac harness delivery device.

Introducer for a cardiac harness delivery

An apparatus having a first and second bus is disclosed. In one embodiment, multiple units are coupled to the first and second buses. The units include a middle unit and two side units. Each side unit has a first bus output coupled to a first bus input of the middle unit. The middle unit has a second bus output coupled to a second bus input of each side unit.

Method and apparatus for communication using a distributed multiplexed bus

A method and apparatus for error handling in networks have been described. The method configures a plurality of cores, wherein each core is connected with and associated with each of one of a plurality of initiators. The method further connects one or more of the initiators to a network. Next, one or more of the initiators determine an error in one or more of the cores and communicate the error.

Jeffrey A. Ebert

Papers

Method and apparatus for communication using a distributed multiplexed bus

Method and apparatus for error handling in networks