Abstract: A method, system, and computer program product for logging events in a data processing system is provided. In one embodiment, responsive to a determination that a situation exists preventing a primary logger from executing a logging task, a swappable adaptive logger is created, which in turn is pointed to a boot logger created by a swappable adaptive log engine. Event information is then logged to the boot logger. For example, the boot logger may write event information to memory or to a file if the logging database is unavailable. When the primary logger becomes configured and functional, the swappable adaptive logger swaps the boot logger for the primary logger and begins writing event information to the primary logger.

Abstract: A storage device and a method for determining the entry with the highest priority in a buffer memory. The method is characterized by the steps of operating a plurality of priority subfilter circuits each of them covering a disjunct subgroup of the total of entries and each selecting the entry with the highest subgroup priority, and selecting the entry associated with the highest priority subgroup. The storage device is able to be allocated and deallocated repeatedly during processing program instructions in a computer system. The storage device is further characterized by an operator for operating a plurality of priority subfilter circuits. Each of priority subfilter circuits covers a disjunct subgroup of the total of entries and each selecting the entry with the highest subgroup priority. The storage device is still further characterized by a selector for selecting the entry associated with the highest priority subgroup.

Abstract: The present invention captures streaming data and avoids continual retrieval. The invention only looks at data once, has a time dependency built into it, and data that is not consumed or relevant is discarded. The invention includes an engine processor that processes data according to stored information; stored rules that define engine operation, an input events module for receiving events which provides a plurality of events. Events are processed according to stored rules for generating a series of valid results when input events match the rules. Rule states that have been matched to an input event but have not produced a valid result are stored in state storage. The state of a rule as stored enables the engine to provide a valid result output upon a future reception of an input event necessary to complete the rule. Transaction log module monitors the operation of the engine for specified time period.

Abstract: A data processing device comprising a storage circuit accessible by assertion of addresses, an arithmetic logic unit connected to the storage circuit operative to perform an arithmetic operation on data received by the arithmetic unit. Further included is an address register for storing an initial address word indicative of a storage circuit address. An instruction decode and control unit, connected to the storage circuit and having an instruction register operative to hold a program instruction is operative to decode the program instruction into control signals to control the operations of the data processing device and location codes to control data transfers according to predetermined sections of the program instruction wherein at least one of the sections includes a location section selecting the address register and a displacement section containing address data.

Abstract: A computer system includes an adaptive memory arbiter for prioritizing memory access requests, including a self-adjusting, programmable request-priority ranking system. The memory arbiter adapts during every arbitration cycle, reducing the priority of any request which wins memory arbitration. Thus, a memory request initially holding a low priority ranking may gradually advance in priority until that request wins memory arbitration. Such a scheme prevents lower-priority devices from becoming “memory-starved.” Because some types of memory requests (such as refresh requests and memory reads) inherently require faster memory access than other requests (such as memory writes), the adaptive memory arbiter additionally integrates a nonadjustable priority structure into the adaptive ranking system which guarantees faster service to the most urgent requests.

Abstract: A USB device is configured to support a non-USB-defined device request that is specific to an application program or operating system. The device request is supported by using a device-specific or vendor-specific request code, which is allowed to vary from device to device. To determine the proper request code, the host performs a GET_DESCRIPTOR device request, specifying a predetermined string descriptor. The requested string descriptor designates the request code to be used in the non-USB-defined device request.

Abstract: A signal is transmitted from a sending chip to a first receiving chip in a communications ring via a first i/o set of the sending chip. A signal from the sending chip to a second receiving chip in the communications ring is transmitted via a second i/o set of the sending chip. The first i/o set corresponds to a first direction for the sending chip transmitting around the ring, and the second i/o set corresponds to a second direction for the sending chip transmitting around the ring. The transmitting via the first i/o set is for a circumstance where a number of chips interposed in the ring between the sending and receiving chips in the first direction is not greater than the number of chips interposed in the second direction. The transmitting via the second i/o set is for a circumstance where the number is greater.

Abstract: A method for accessing a shared resource is provided. An assigned usage rate is received from a resource coordinator and a desired usage rate is determined. When it is determined that the desired usage rate is higher than the assigned usage rate, a shared resource may be accessed at an enhanced usage rate if a usage reserve has been accumulated. When a shared resource is accessed at an enhanced usage rate, the usage reserve is decremented by an amount based on a difference between the enhanced usage rate and the assigned rate. When there is no usage reserve accumulated, access to the shared resource is limited to the assigned usage rate. When the desired usage rate is not higher than the assigned usage rate, a shared resource is accessed at the desired usage rate. When the desired usage rate is less then the assigned usage rate, the usage reserve is accumulated up to a reserve maximum. The reserve maximum may be based on configuration data.

Abstract: A multimedia communication arrangement communicating video and at least one other data type using a communication channel includes a first interface arrangement for communicating video and the at least one other data type using the communication channel. A second interface arrangement exchanges data with, and provides power to, at least one of a variety of peripheral devices. A video data signal processor circuit processes the video data and sends the video data along with the at least one other data type over the first interface arrangement and communicates with the peripheral devices over the second interface arrangement.

Abstract: An I/O device driver is shared between a number of processes within a computer system while security and protection for system memory is maintained. Controlled access to the I/O device is provided by managing an authorized list in an I/O processor which is used to keep track of users of the I/O device according to types of claims for access to the I/O device. Claim types include primary, authorized, secondary, and management.

Abstract: A scheme for arbitrating access to a data bus shared among a plurality of competing sources is provided. Each competing source is assigned an adjustable priority weighting value (PWV) which is initially set to an initial value based on the bandwidth requirements of the competing source. During arbitration, the PWVs of those competing sources requesting access to the bus are compared, and the competing source with the smallest PWV is granted access. The PWV of the competing source which was granted access to the bus is reset to its initial value and the PWV of each competing source which requested, but was denied, access is reduced by one for subsequent comparisons. The arbitration scheme of the present invention is further applied to two-level arbitration. Each competing source is classified into a competing source group, and the requests from the grouped competing sources are processed by first level arbitration. First level arbitration passes one competing source for each group to a second level arbiter.

Abstract: A method for selecting a target group for an operation applied to a network element (NE) of a communication network includes (a) receiving from a network management element information on the operation and on the first target group (S), which is a group of object instances contained in the memory of the network element, and as comparison criteria of object instance attributes, the criteria containing the reference values, (b) comparing the attribute values of object instances belonging to the first target group to said reference values, and (c) selecting the final target group from among those object instances in the first target group (S) that have attributes fulfilling the received comparison criteria.