Abstract: A burst-mode data transfer arrangement for transferring a “LINE” of data, arranged in a four-subline array, between a 32-bit-subline memory and a cache memory having 64 bits per sub-line, where, in every such transfer, four sublines must be transferred successively in one of four different sequences, depending on whether the initial access-subline is subline-#1, -#2, -#3 or -#4; this arrangement being adapted to derive the address of the third subline by: deriving an “access address” for the initial subline of the “LINE” to be transferred; converting the result to binary code form; inverting the fourth bit of this binary code form, and then converting this result to the desired code form, to constitute the address of the third subline (of the four to be transferred).

Abstract: A system is provided for mounting a computer component. The system has at least one rail with first and second mounting portions. The first mounting portion defines a recess. The second mounting portion has at least one detent. The system also has first and second supports. The first support has an extension extending into the recess and allows sliding of the first mounting portion relative to the first support. The second support defines at least one aperture that receives the detent and limits sliding of the second mounting portion relative to the second support.

Abstract: A tree-based datastore comprising a forest of interconnected trees is generated and/or accessed. The tree-based datastore comprises a first tree that depends from a first root node and may include a plurality of branches. Each of the branches of the first tree ends in a leaf node. Each leaf node may represent an end product, or a subcomponent node. A second root of the same tree-based datastore is linked to each leaf node representing an end product. Finally, the tree-based datastore comprises a plurality of trees in which the root node of each of these trees can be described as an elemental node. The root node of each of these trees may be linked to one or more nodes in one or more branches of the first tree. The nodes of the tree-based datastore contain only pointers to other nodes in the tree-based datastore, and may contain additional fields wherein one such may be a count field.

Abstract: A system for providing in response to changes within current operational data of a business enterprise, alert information including an alert to a wireless device in real-time. The system architecture includes an enterprise application integration services component for accessing and conditioning the current operational data and other business intelligence information. An analytics services component monitors for changes within the current operational data from a predetermined target level and communicates an alert and alert information if a change occurs. The analytics services component also extracts contextually-related first and second sets of critical business information, and converts the operational data, alert and alert information, and the first and second sets of critical business information into a device-independent, web-enabled format, which is then recoded by a delivery services component in accordance with the data delivery requirements of the wireless device.

Abstract: A code coverage tool can be made more useful if circuits of a specified function can be identified by their truth table. This knowledge can be used during code coverage testing to determine what circuits may not be covered during the appearance of specified input data configurations for such circuits. Forcing all circuits to a specified state and running the truth table data through them, when properly instrumented in emulation allows for determination of such specified functionality.

Abstract: The present invention provides a system and method for analyzing a computing system. The method comprises the step of determining a dependency between a first and second system resource performance characteristic in a computing system. The step of determining the dependency includes the steps of providing data values for the first performance characteristic and the second performance characteristic of the computing system, and applying a mathematical algorithm to derive a correlation value between the first and second characteristics. The correlation value provides an indication of the relative association between the second characteristic and the first characteristic.

Abstract: Mapping of data source schema data types relating a server side database description into a set of OLE DB data types is rendered subject to user modification by provision of a dual Schema File at a client side terminal which contains an original unmodifiable copy and a modifiable working copy of the data source schema. When the server side database description is altered, user modifications to the modifiable copy are preserved as much as possible by performing a matching process on the client side in the course of generating new unmodifiable and modifiable schema files which comprise a new dual Schema File.

Abstract: A tree-based datastore comprising a forest of interconnected trees is generated and/or accessed. The tree-based datastore comprises a first tree that depends from a first root node and may include a plurality of branches. Each of the branches of the first tree ends in a leaf node. Each leaf node may represent an end product, as described more fully below. A second root of the same tree-based datastore is linked to each leaf node representing an end product. Hence, the second root is essentially a root to an inverted order of the first tree, but the first tree is not duplicated. Finally, the tree-based datastore comprises a plurality of trees in which the root node of each of these trees is an elemental node, as described more fully below. The root node of each of these trees may be linked to one or more nodes in one or more branches of the first tree. The nodes of the tree-based datastore contain only pointers to other nodes in the tree-based datastore.

Abstract: Methods for determining database management system server hardware requirements as a function of user-supplied transactions per second requirements, maximum processor utilization, and server type. Methods are also provided for determining workload requirements as a function of the expected transaction composition of the system including the expected transaction execution rate in transactions per second and the percent of total workload contribution by each statement. In one method, each transaction is further specified as a set of SQL statements each having a parameter list, where the workload contribution of each SQL statement is calculated as a function of the SQL statement parameter list.

Abstract: The present invention provides systems and methods for allocating a pool of global memory among a set of client/servers so that storage volumes associated with a plurality of client/servers are each allocated a portion of the pool of global memory for caching of data from that volume. The amount of memory to be used for caching the volume's input/output operations (I/Os), the page size, the cache type, the cache replacement policy and the maximum cache read can be specified by volume. The amount of memory to be used for caching the volume's input/output operations, the cache type, the cache replacement policy and the maximum cache read I/O size can be changed dynamically by the changing volume-based attributes.

Abstract: A method in a computer system executing a client application and an OODBMS and an RDBMS software, which system has a storage medium accessible by the RDBMS software and the OODBMS software being accessible by the client application. The method generates unique object identifiers in a data abstraction layer disposed between the OODBMS and the RDBMS software in response to a parent thread created by the client application. The method includes the steps of creating a child thread that has access to the RDBMS software, which child thread is used exclusively for generating object identifier numbers and for returning the same to the parent thread. A unique object identifier table is created, which is maintained by the child thread. In response to a request by the parent thread for a unique object identifier, the child thread generates a finite number of the unique object identifiers and communicates their values to the parent thread.

Abstract: A computer system incorporates distributed power control. In particular, the computer system comprises a power supply for providing at least one voltage, a power distribution system, and N boards, or modules (where N>1) coupled to the power supply via the power distribution system. Each board comprises a voltage regulator, which receives the voltage from the power supply and provides a regulated voltage to the board, and a processor for controlling the voltage regulator for varying the regulated voltage.

Abstract: Method and apparatus for implementing persistent data in object-oriented programs. A class declaration is separated into two parts, a first structure type for storage of one or more data values, and a class that derives from the structure type. Objects of the structure type are instantiated and initialized in the source program. The class definition includes a static method that converts an object of the structure type to an instance of the class in response to a reference to the method. Thereby, memory for the objects is allocated and data values are assigned to the objects at compile-time.

Abstract: A method is disclosed for effecting data interchange among software tools and repositories in a distributed heterogeneous environment in a computer system having at least one repository of a first type and at least one software modeling tool of a second type. The method includes the steps of registering and storing metadata describing a meta model in the repository. Next, a set of rules and streams of data are generated based on the rules, and then documents conforming to each of the metamodels are generated by reading the set of rules. An importer is written for use in importing into the repository the streams of data; and, an exporter is written for use in exporting from the repository the streams of data.

Abstract: A programmable pipeline depth controller is provided to control the number of instructions that begins execution within an instruction pipeline of an instruction processor within a predetermined period of time. The pipeline depth controller of the present invention includes a logic sequencer responsive to a programmable count value. Upon being enabled, the logic sequencer generates a pipeline control signal to selectively delay the entry of some instructions into the instruction pipeline so that the number of instructions that begins execution within the instruction pipeline during the predetermined period of time following the enabling of the logic sequencer is equal to the count value.

Abstract: A method and apparatus for reusing a thread for different programmed operations are provided in various embodiments. In one embodiment, different application operations are defined as subclasses of a thread operation class, and a thread is implemented with a thread class. In one embodiment, the application operations can be queued to the thread for scheduled execution using the thread. In another embodiment, a first application operation can start a thread and be executed therewith, while a second application operation can attach to the thread for execution.

Abstract: An apparatus for and method of utilizing an Internet terminal coupled to the world wide web to interface with an existing proprietary data base management system through a user interface which permits access to an application service by presentation of one of a plurality of display pages which differ from one another only in resolution. The use of one of a plurality of nearly identical display pages offers a highly efficient way of optimizing the user interface from one work station to another.

Abstract: An apparatus for and method of utilizing an internet terminal coupled to the world wide web to access an existing proprietary data base management system having a dialog-based request format. The internet terminal transfers a service request to the data base management system, having a password provided as required. When a service request is made having an expired password, the data base management system recognizes the problem. The internet terminal is queried for certain parameters, and the data base management system automatically reassigns a new and unexpired password.

Abstract: A computer system is provided. The computer system includes a computer chassis at least partially defining an interior. The computer system also includes a module configured for movement with respect to the computer chassis along an insertion axis between a retracted position substantially within the interior of the computer chassis and an extended position at least partially withdrawn from the interior of the chassis. The module includes a housing configured to extend within the interior of the chassis. The housing includes a body portion configured to move with respect to the computer chassis along the insertion axis, and a pivoting portion coupled to the body portion to pivot between a retracted position substantially aligned along the insertion axis and an extended position oriented at an angle with respect to the insertion axis.

Abstract: A method is provided for developing a computer-based dialogue interface for an automated or computerized system using input device technology. The dialogue interface is disposed between the automated system and an end user, with the dialogue interface receiving input from the end user and providing output to the end user in response to the input. In an illustrative embodiment, the method comprises the following steps. A system designer(s) defines a plurality of requirements applicable to the dialogue interface. The dialogue interface is then designed to meet these requirements. The automated system is simulated with at least a first person, and the end user is simulated with at least a second person. The dialogue interface is evaluated by facilitating an interaction between the first and the second persons through the dialogue interface. Based on the interaction between the first and the second persons, the dialogue interface is evaluated.