Abstract: A method and apparatus for accessing and storing data in a memory are disclosed. The system includes a memory controller coupled to a memory having locations characterized by banks and lines. The memory controller is configured for storing a data packet with data bursts in sequence in consecutive memory locations, while providing the capability of reading or writing data bursts out of sequence by accessing the consecutive memory locations in a random order.

Abstract: A pharmaceutical dosage form for treating or preventing cardiovascular events comprises therapeutic amounts of: a ?-adrenergic receptor antagonist, a diuretic, or both; a cholesterol-lowering agent; an inhibitor of the renin-angiotensin system; and aspirin.

Abstract: A method and apparatus for accessing and storing data in a memory are disclosed. The system includes a memory controller coupled to a memory having locations characterized by banks and lines. The memory controller is configured for storing a data packet with data bursts in sequence in consecutive memory locations, while providing the capability of reading or writing data bursts out of sequence by accessing the consecutive memory locations in a random order.

Abstract: A data processing system includes a first plane including a first plurality of processing nodes, each including multiple processing units, and a second plane including a second plurality of processing nodes, each including multiple processing units. The data processing system also includes a plurality of point-to-point first tier links. Each of the first plurality and second plurality of processing nodes includes one or more first tier links among the plurality of first tier links, where the first tier link(s) within each processing node connect a pair of processing units in the same processing node for communication. The data processing system further includes a plurality of point-to-point second tier links.

Abstract: A data processing system includes a first processing node and a second processing node. The first processing node includes a plurality of first processing units coupled to each other for communication, and the second processing node includes a plurality of second processing units coupled to each other for communication. Each of the plurality of first processing units is coupled to a respective one of the plurality of second processing units in the second processing node by a respective one of a plurality of point-to-point links.

Abstract: A data processing system, method, and computer-usable medium for recovering from a hang condition in a data processing system. The data processing system includes a collection of coupled processing units. The processing units include a collection of processing unit components such as, two or more processing cores, and a cache array, a processor core master, a cache snooper, and a local hang manager. The local hang manager determines whether at least one component out of the collection of processing unit components has entered into a hang condition. If the local hang manager determines at least one component has entered into a hang condition, a throttling manager throttles the performance of the processing unit in an attempt to break the at least one component out of the hang condition.

Abstract: A data processing system includes a first processing node and a second processing node coupled by an interconnect fabric. The first processing node includes a plurality of first processing units coupled to each other for communication, and the second processing node includes a plurality of second processing units coupled to each other for communication. A first processing unit in the first processing node includes interconnect logic that processes a plurality of concurrently pending broadcast operations of differing broadcast scope. At least a first of the plurality of concurrently pending broadcast operations has a first scope limited to the first processing node, and at least a second of the plurality of concurrently pending broadcast operations has a second scope including the first processing node and the second processing node.

Abstract: A method, apparatus, and computer instructions are provided by the present invention to automatically recover from a failed node concurrent maintenance operation. A control logic is provided to send a first test command to processors of a new node. If the first test command is successful, a second test command is sent to all processors or to the remaining nodes if nodes are removed. If the second command is successful, system operation is resumed with the newly configured topology with either nodes added or removed. If the response is incorrect or a timeout has occurred, the control logic restores values to the current mode register and sends a third test command to check for an error. A fatal system attention is sent to a service processor or system software if an error is encountered. If no error, system operation is resumed with previously configured topology.

Abstract: A method, apparatus, and program for systematically testing the functionality of all connections in a multi-tiered bus system that connects a large number of processors. Each bus controller is instructed to send a test version of a snoop request to all of the other processors and to wait for the replies. If a connection is bad, the port associated with that connection will time out. Detection of a time-out will cause the initialization process to be halted until the problem can be isolated and resolved.

Abstract: A data processing system includes an interconnect fabric, a protected resource having a plurality of banks each associated with a respective one of a plurality of address sets, a snooper that controls access to the resource, one or more masters that initiate requests, and interconnect logic coupled to the one or more masters and to the interconnect fabric. The interconnect logic regulates a rate of delivery to the snooper via the interconnect fabric of requests that target any one the plurality of banks of the protected resource.

Abstract: A data processing system includes a plurality of processing units, including at least a local master and a local hub, which are coupled for communication via a communication link. The local master includes a master capable of initiating an operation, a snooper capable of receiving an operation, and interconnect logic coupled to a communication link coupling the local master to the local hub. The interconnect logic includes request logic that synchronizes internal transmission of a request of the master to the snooper with transmission, via the communication link, of the request to the local hub.

Abstract: A data processing system includes a first processing node and a second processing node coupled by an interconnect fabric. The first processing node includes a plurality of first processing units coupled to each other for communication, and the second processing node includes a plurality of second processing units coupled to each other for communication. The first processing units in the first processing node have a first mode in which the first processing units broadcast operations with a first scope limited to the first processing node and a second mode in which the first processing units of the first processing node broadcast operations with a second scope including the first processing node and the second processing node.

Abstract: A method and system predict customers/accounts that are likely to become attrited based on predefined classification rules and customer data/account information associated with the customers/accounts. The classification rules are generated by parsing through historical customer data/account information to identify attrition customers/accounts and their associated attributes. Unique algorithm is used to determine attrition statuses of the customers or accounts. After the classification rules are generated, the rules are applied to new customer data or account information to predict customers or accounts that are likely to become attrited.

Abstract: An advanced rating method and system for identifying desirable customers. A prediction index is calculated for each customer to predict a trend of profit that the customer may generate. The prediction index is calculated based on various types of customer data including at least two types of customer data selected from the following: assets levels of the customer, demographic information of the customer, and transaction history of the customer. A score for each selected type of customer data is determined. Proper weights corresponding to each type of customer data are also obtained. The prediction index is then calculated based on the respective weights and scores corresponding to the selected types of customer data using an advanced algorithm. The prediction index is compared with a preset threshold to determine whether the customer is desirable.

Abstract: An activity-driven, profitability calculation method and system track expenses and/or income associated with each activity initiated by customers or accounts. The method detects and identifies activities associated with an account, and obtains rate information associated with the identified activities. The rate information specifies any expenses or incomes associated with the identified activities. A profitability status related to the account, such as an amount of profits or loss, is updated based on the rate information associated with the identified activities. The determined profitability status of the account or customer may be used to determine a service type or level that would be received by the account or customer.

Abstract: A method and system predict future revenue of an account or a customer associated therewith for a specific time period, such a month, a quarter, etc., based on past revenue. The technique uses historical revenue data of a predetermined number of time periods before the specific time period, to calculate the prediction revenue for the specific time period. Different weights are assigned to the revenue data of each of the predetermined number of time periods, wherein the weight is selected based on the recentness of each of the predetermined number of time periods relative to the specific time period. For instance, the revenue of a month closer to a month to be predicted is given more weight than older months. The weight for each time periods may be determined empirically, such as by regression. Prediction revenue of the specific time period is determined based on the historical revenue data and the weight of each of the predetermined number of time periods.

Abstract: The present invention relates to the stable solid orally administrable pharmaceutical formulation of Amlodipine Maleate. The invention also describes the process of producing such stable formulations and more specifically a direct compression method of producing tablet formulations. The tablet formulation of Amlodipine Maleate thus prepared is bioequivalent to the tablets containing Amlodipine Besylate salt commercially available with the brand name of Norvasc. The formulation also avoids the common problem of sticking observed during manufacturing.

Abstract: The present invention relates to the stable solid orally administrable pharmaceutical formulation of Amlodipine Maleate. The invention also describes the process of producing such stable formulations and more specifically a direct compression method of producing tablet formulations. The tablet formulation of Amlodipine Maleate thus prepared is bioequivalent to the tablets containing Amlodipine Besylate salt commercially available with the brand name of Norvasc. The formulation also avoids the common problem of sticking observed during manufacturing.