Abstract: In a data processing environment, a communication interface of a second host data processing system receives, from a first host data processing system, a host command in a first command set. The host command specifies a memory access to a memory coupled to the second host data processing system. The communication interface translates the host command into a command in a different second command set emulating coupling of an attached functional unit to the communication interface. The communication interface presents the second command to a host bus protocol interface of the second host data processing system. Based on receipt of the second command, the host bus protocol interface initiates, on a system fabric of the second host data processing system, a host bus protocol memory access request specifying the memory access.

Abstract: In a data processing environment, a communication interface of a second host data processing system receives, from a first host data processing system, a host command in a first command set. The host command specifies a memory access to a memory coupled to the second host data processing system. The communication interface translates the host command into a command in a different second command set emulating coupling of an attached functional unit to the communication interface. The communication interface presents the second command to a host bus protocol interface of the second host data processing system. Based on receipt of the second command, the host bus protocol interface initiates, on a system fabric of the second host data processing system, a host bus protocol memory access request specifying the memory access.

Abstract: A data communication apparatus includes a plurality of output ports and a scheduler for assigning priorities for outbound data frames. The scheduler includes one or more scheduling queues. Each scheduling queue indicates an order in which data flows are to be serviced. At least one scheduling queue has a respective plurality of output ports assigned to the scheduling queue. That is, the scheduling queue is shared by two or more output ports.

Abstract: In a first aspect, a network processor includes a scheduler in which a scheduling queue is maintained. A last frame is dispatched from a flow queue maintained in the network processor, thereby emptying the flow queue. Data indicative of the size of the dispatched last frame is stored in association with the scheduler. A new frame corresponding to the emptied flow queue is received, and the flow corresponding to the emptied flow queue is attached to the scheduling queue. The flow is attached to the scheduling queue at a distance D from a current pointer for the scheduling queue. The distance D is determined based at least in part on the stored data indicative of the size of the dispatched last frame.

Abstract: A scheduler for a network processor includes a scheduling queue in which weighted fair queuing is applied. The scheduling queue has a range R. Flows are attached to the scheduling queue at a distance D from a current pointer for the scheduling queue. The distance D is calculated for each flow according to the formula D=((WF×FS)/SF), where WF is a weighting factor applicable to a respective flow; FS is a frame size attributable to the respective flow; and SF is a scaling factor. The scaling factor SF is adjusted depending on a comparison of the distance D to the range R.

Abstract: A scheduler for a network processor includes a scheduling queue in which weighted fair queuing is applied to define a sequence in which flows are to be serviced. The scheduling queue includes at least a first subqueue and a second subqueue. The first subqueue has a first range and a first resolution, and the second subqueue has an extended range that is greater than the first range and a lower resolution that is less than the first resolution. Flows that are to be enqueued within the range of highest precision to the current pointer of the scheduling queue are attached to the first subqueue. Flows that are to be enqueued outside the range of highest precision from the current pointer of the scheduling queue are attached to the second subqueue. Numerous other aspects are provided.

Abstract: Sensor apparatus for a multiple layer steel (MLS) cylinder head gasket measures combustion pressures for detecting engine conditions. A membrane is positioned at one end of an elongated metal tube, and the membrane end of the tube engages a cylinder bore boundary. A fiber optical sensor apparatus is fixed within the tube, and communicates with cyclic combustion events via the membrane. In one disclosed embodiment, optical wires from sensor apparatus situated at each engine bore are bundled into a common groove machined into an extended spacer layer radially outwardly of the conventional boundary of the gasket. The tube protects the sensor apparatus from damage of sealing stress on the gasket, and particularly at the bore perimeter. Each tube lies in a separate groove in the spacer layer that terminates at the bore boundary. A converter changes optical signals received from the apparatus into electrical signals for transmittal to a controller.

Abstract: A multi-layer steel (MLS) cylinder head gasket containing fully integrated pressure sensors includes first and second metal layers with inner facing surfaces, and a spacer layer interposed between the facing surfaces. Outer (non-facing) surfaces of the first and second metal layers each include an elastomeric seal coating; the inner surfaces of the layers each include a friction reducing coating. Combustion apertures extend fully between the outer surfaces of the gasket, and are adapted to circumscribe cylinder bores of an engine. The spacer layer includes protective slots positioned adjacent each of the combustion apertures. Each slot wall contains a pressure sensor in form of a strain gauge to measure deflection of the wall resulting from pressure changes within engine combustion chambers. The measured deflections are correlated to actual pressures within the chambers. In the protective slots, the strain gauges are not exposed to combustion gases that could otherwise foul the sensors.

Abstract: In a first aspect, a method is provided for scheduling connections for a network processor. The method includes the steps of, in a cache, scheduling a plurality of connections to be serviced based on quality of service parameters stored in a control structure corresponding to each connection and during a scheduling opportunity (1) identifying one or more of the plurality of connections in the cache to be serviced; (2) selecting one of the connections identified to be serviced; (3) servicing the selected connection; (4) accessing one or more portions of the control structure in the cache; (5) calculating a next service time when the selected connection is to be serviced; and (6) determining whether to schedule the selected connection to be serviced in one of the cache and a calendar based on the next service time. Numerous other aspects are provided.

Abstract: In a first aspect of the invention, a first method is provided for hierarchical scheduling. The first method includes the steps of (1) selecting a first winning entry from one of a plurality of main calendars during a time unit, the first winning entry indicating a first pipe to be serviced during the time unit (2) determining that no pipe flow corresponding to the winning first pipe currently needs to be serviced during the time unit (3) selecting a second winning entry from the plurality of main calendars during the time unit, the second winning entry indicating a second pipe or an autonomous flow to be serviced during the time unit; and (4) servicing the autonomous flow or a pipe flow corresponding to the second winning entry during the time unit. Numerous other aspects are provided.

Abstract: A method is provided for address mapping in a network processor. The method includes the steps of (1) determining a port number of a port that receives a data cell; (2) determining a virtual path identifier and a virtual channel identifier for the data cell; and (3) creating a first index based on at least one of the port number, the virtual path identifier and the virtual channel identifier. The method further includes (1) accessing one of a plurality of entries stored in a first on-chip memory using the first index; (2) creating a second index based on the accessed entry of the first on-chip memory; and (3) accessing an entry of a second memory based on the second index. Numerous other aspects are provided.

Abstract: A gasket assembly includes a gasket body and a separate gasket seal. The gasket body includes first and second opposing faces, at least one seal opening therein and a plurality of attachment openings. The gasket seal includes a plate having a body portion defined by and outer periphery of the plate, with at least one fluid flow opening therein and a plurality of attachment elements integral with the outer periphery of the plate. Each attachment element extends radially outwardly from the outer periphery of the plate and includes a trunk and transversely extending wings that terminate in tips. The gasket seal is received within the seal opening of the gasket body with the trunk of each attachment element in abutting relation with the first opposing face of the gasket body. The wings extend through the attachment opening and the tips are then bent into facing relation with the second opposing face, thereby securing the gasket seal within the gasket body.