Abstract: A floating point result in a processor is efficiently normalized by predicting the mantissa shift required to normalize the result to an error of one bit position in one direction, resulting in minimum and maximum predicted shifts. Concurrently with an addition of operands to generate a result mantissa, an inversion of the minimum predicted shift is added to the operand exponent to generate an intermediate exponent corresponding to a maximum predicted shift. When the operand addition is complete, the result mantissa is partially shifted in response to the minimum predicted shift. The location of the leading one is then ascertained and compared to the remaining minimum predicted shift. If the minimum predicted shift is the actual shift required to normalize the result, the result mantissa is further shifted by the remaining minimum predicted shift and an exponent carry-in is asserted.

Abstract: A data processing system and method of communicating data in a data processing system are described. The data processing system includes a communication network to which a plurality of devices are coupled. At least one device among the plurality of devices coupled to the communication network includes mastering circuitry and snooping circuitry. According to the method, a first timing signal having a first frequency and a second timing signal having a second frequency different from the first frequency are generated. Communication transactions on the communication network are initiated utilizing the mastering circuitry, which operates in response to the first timing signal, and are monitored utilizing the snooping circuitry, which operates in response to the second timing signal.

Abstract: A method and system for front-end and back-end gathering of store instructions within a processor is disclosed. In accordance with the method and system of the present invention, the store queue includes a front-end queue and a back-end queue. In response to a determination that the data field of the first entry of the front-end queue is not filled completely, another determination is made as to whether or not an address for a store instruction in a subsequent second entry is equal to an address for the store instruction in the first entry plus a byte count in the first entry. If so, the store instruction in the subsequent second entry is collapsed into the store instruction in the first entry.

Abstract: A method of improving memory latency associated with a read-type operation in a multiprocessor computer system is disclosed. A requesting processing unit issues a message to an interconnect of the computer system indicating that the requesting processing unit desires to read a value from an address of a memory device of the computer system, and each cache snoops the interconnect to detect the message.

Abstract: A method and system for performing perspective divide operations on three-dimensional graphics data within a computer system is disclosed. In accordance with the method and system of the present invention, a 3-D graphical image is represented by three-dimensional graphical object data via a number of vertices. In a first iteration, the following steps are performed concurrently: computing a set of clip coordinates for a vertex N, wherein the set of clip coordinates is a four-component vector ?x', y', z', w'!; refining an estimate value of 1/w' for a vertex N-1, wherein vertex N-1 is a vertex calculated one iteration previous to vertex N; and, generating a clip code for the vertex N-1 .

Abstract: An information handling system includes a cache memory architecture which includes a means for performing a direct lookup by identifying the double word in the cache using the congruence class ID field, a set ID field and a double word ID field of the request address, and sending the double word to the CPU, and if the tag of the identified double word does not match the tag of the request address, sending a cancel signal to the CPU, and the double word with a matched tag in the congruence class, and if no match occurs, reloading the line l1 into the improved cache from a lower level cache or from main memory. The line in the set identified by the set ID field replaces the least recently used line in the congruence class and its place is taken by the missing line.

Abstract: A method and system for providing external bit map support to device drivers coupled to a data processing system are disclosed. The data processing system includes a central processing unit, memory, user output device, and a user input device. The method and system also provide outputting of an image under a graphical user interface on the display device. In implementing the improved external bit map support, the system and method generate an image through the graphical user interface in device independent bits format and then determine whether the image is to be supported in an external bit map format. If the image is to be supported in an external bit map form, the system determines the level of required resolution for supporting that image and then converts that image to the external bit map format at that desired level of resolution. The desired level of resolution is selectable from either 24 bits per PEL (bpp), 8 bpp or 4 bpp.

Abstract: A method for processing timer requests efficiently by reducing overhead and by increasing scalability within a computer system is disclosed. A timer request having a wake-up time of moderate length and a high tolerance level such that the wake-up time does not have to be very precise, is placed in a drop-off queue which is made up of an unsorted double-linked list. The timer request is then periodically hashed from the drop-off queue into an appropriate element of a timer request array, according to the time duration of the timer request. The timer request array is then processed in order to migrate the timer request towards the ?0,0! element of the timer request array. Finally, the timer request is awakened when the time request reaches the ?0,0! element or a ?0,n! element of the timer request array with no time remaining.

Abstract: A method and system in a graphical user interface in a data processing system for associating and displaying a plurality of objects are described. A creation of a visually perceptible enclosure having a translucent surface is specified. A plurality of objects within the graphical user interface are specified. Each of the objects are associated with the visually perceptible enclosure. The enclosure is then created. The enclosure and each of its associated plurality of objects are displayed within the graphical user interface. Each of the objects are displayed within the enclosure so that they are partially visible through the translucent surface. The objects are inaccessible while they are displayed within the enclosure. Once the enclosure is removed, the objects are accessible. A code field may be associated with the enclosure. An entry of a valid code is required in order to remove the enclosure and permit access of each enclosed objects.

Abstract: A software management structure is disclosed. A software application package is made up of several linked replaceable units (RU). Each RU is serviceable without adversely effecting the other RUs. The RUs are linked together in a hierarchical fashion in a series of levels. In the preferred embodiment, five levels are used: Application Group level (AG), Loadable Code Group level (LCG), Primary Functional Group level (PFG), Secondary Functional Group level (SFG), and Operational Code Group level (OCG). The AG level defines a group of computer programs combined to perform a high level application tailor fit to meet the needs of the user. The LCG level defines individual programs each created to perform a general task. The PFG level refines the common programs defined in the LCG level to a more specific set of primary functions. The SFG level refines the primary functions defined in the PFG level to an even more specialized set of secondary functions tailored closely to fit a specific user's needs.

Abstract: A computer implemented method facilitates the capability for shop re-work orders to be effectively scheduled, knowing the time and location of item availability that is needed to correct the problem found in the re-work shop orders. The system automatically identifies alternate components or items that can be used in the shop orders and provides realistic shipping dates so that the re-work shop orders can be scheduled. If components or items are not available, the system provides feedback to the material planning system to re-plan items using traditional material planning systems such as the MRP (material requirement planning) systems and provide projected shipping dates so that re-work orders can be scheduled.

Abstract: A monitoring system monitors an expert system application while such application executes for a period of time. The monitoring system records selected performance data relative to the operating efficiency of the expert system, and writes such data into a database for later use. After a test run of the expert system is completed, the monitoring system can select a small number of candidate rules for revision by a user, and display data to the user which allows the user to determine what types of changes need to be made to the candidate rules and to the working memory data organization.