Abstract: Program product for an application programming interface that unifies a plurality of mechanisms into a single framework. The interface includes a mechanism for communicating between members of a process group of related processes, and a mechanism for synchronizing the related processes of the process group. Additionally, the application programming interface may include mechanisms for managing membership of the process group or a processor group of processors, and/or a mechanism for controlling a group state value for the process group.

Abstract: The number of instances of an application running in a computing environment are controlled by monitoring the current load on the application, and altering the current number of instances of the application based on results of the monitoring. The load may be monitored by monitoring the current number of instances of the application running in the computing environment. Where a maximum, minimum and/or initial number on startup, of instances of the application are specified, the altering is done based on comparing the current number to one or more of the specified numbers of instances.

Abstract: A method and apparatus for identifying problems associated with a web site. A scan of a web site is initiated by a plurality of agents, wherein each of the plurality of agents are at a different location in the distributed data processing system. Results of the scan are obtained from the plurality of agents. The results of the scan are analyzed to determine if a problem is associated with the web site.

Abstract: A method and apparatus for identifying problems associated with a web site. A scan of a web site is initiated by a plurality of agents, wherein each of the plurality of agents are at a different location in the distributed data processing system. Results of the scan are obtained from the plurality of agents. The results of the scan are analyzed to determine if a problem is associated with the web site.

Abstract: A mechanism for scheduling network requests is implemented. A network server responding to a request from a network client for delivery of a software asset determines if network resource capacity is available to service the request. If the capacity is not available to service the request in real time, the server allocates capacity for future delivery of the asset. The server notifies the client of the time slot containing the allocated bandwidth. The client reinitiates its request at the scheduled time, whereby, because capacity has been preallocated, the scheduled request may be more likely to be serviced in real time.

Abstract: A scanning tool executing on a host computer may be used to scan a server only if the server (or a proxy) first exposes to the host a certificate that, upon processing by the host, indicates that the server may be scanned. The certificate preferably encrypts a scan permission and is made available from a given port on the server (or the proxy). Whenever the host desires to perform a scan of the server, the host searches the port for the certificate. The certificate is then decrypted to determine whether the scan permission exists. If so, the scan then proceeds, in accordance with any conditions set forth in the decrypted scan permission.

Abstract: A method and apparatus for identifying problems associated with a web site. A scan of a web site is initiated by a plurality of agents, wherein each of the plurality of agents are at a different location in the distributed data processing system. Results of the scan are obtained from the plurality of agents. The results of the scan are analyzed to determine if a problem is associated with the web site.

Abstract: A method and apparatus for identifying problems associated with a web site. A scan of a web site is initiated by a plurality of agents, wherein each of the plurality of agents are at a different location in the distributed data processing system. Results of the scan are obtained from the plurality of agents. The results of the scan are analyzed to determine if a problem is associated with the web site.

Abstract: An unreliable training set is modified to provide for a reliable training set to be used in supervised classification. The training set is modified by determining which data of the set are incorrect and reconstructing those incorrect data. The reconstruction includes modifying the labels associated with the data to provide for correct labels. The modification can be performed iteratively.

Abstract: Program product for an application programming interface that unifies a plurality of mechanisms into a single framework. The interface includes a mechanism for communicating between members of a process group of related processes, and a mechanism for synchronizing the related processes of the process group. Additionally, the application programming interface may include mechanisms for managing membership of the process group or a processor group of processors, and/or a mechanism for controlling a group state value for the process group.

Abstract: A method, computer program product and a program storage device embodying software for measuring of the response time of an application (including distributed applications in a client/server or Internet environment) as perceived by an end-user. One aspect deals with the measurement of components of the response time and relating those components to user response time. In addition, the components of one transaction can be matched (or correlated) to each other even though they are measured on different systems. The generation of events and transactions can be controlled, allowing their creation to occur as close to their point of origin as practical. Both aggregate and detail reporting facilities provide overall performance and availability information as well as exceptions and/or detail transactions including the decomposition of overall availability and performance metrics into smaller measurements representing the contribution made by select transaction components.

Abstract: A barrier synchronization system in a distributed computing environment. A group of members, including a plurality of related processes executing on one or more processors of the distributed computing environment, is provided a protocol having a dynamic number of synchronization phases. The protocol is voted on by one or more members of the group to determine how the protocol should proceed for the group of members. The protocol may complete successfully, continue to another synchronization phase or be rejected. The group of members determines how many synchronization phases the protocol is to include.

Abstract: An application programming interface that unifies a plurality of mechanisms into a single framework. The interface includes a mechanism for communicating between members of a process group of related processes, and a mechanism for synchronizing the related processes of the process group. Additionally, the application programming interface may include mechanisms for managing membership of the process group or a processor group of processors, and/or a mechanism for controlling a group state value for the process group.

Abstract: A barrier synchronization program product in a distributed computing environment. A group of members, including a plurality of related processes executing on one or more processors of the distributed computing environment, is provided a protocol having a dynamic number of synchronization phases. The protocol is voted on by one or more members of the group to determine how the protocol should proceed for the group of members. The protocol may complete successfully, continue to another synchronization phase or be rejected. The group of members determines how many synchronization phases the protocol is to include.

Abstract: Apparatus for configuring a computer system is adapted to allow configuration to occur on the system unit without removing the system unit from its packaging. By so preparing and operating the unit that it can function to a degree as a network client, it is possible to perform steps for configuring "in the package" that violate normal self test expectations. With this abnormal operating environment and operation the system is placed in condition to be removed from the packaging at the user's location with BIOS and program image customized for the user. This approach provides a freshly configured system and yet eliminates unpacking at a configuration center and then repacking for transfer to the user or the need for refresh configuration at the user site as the system unit is set up for normal use.

Abstract: A method and apparatus for configuring a computer system is adapted to allow configuration to occur on the system unit without removing the system unit from its packaging. By so preparing and operating the unit that it can function to a degree as a network client, it is possible to perform steps for configuring "in the package" that violate normal self test expectations. With this abnormal operating environment and operation the system is placed in condition to be removed from the packaging at the user's location with BIOS and program image customized for the user. This approach provides a freshly configured system and yet eliminates unpacking at a configuration center and then repacking for transfer to the user or the need for refresh configuration at the user site as the system unit is set up for normal use.

Abstract: A barrier synchronization technique in a distributed computing environment. A group of members, including a plurality of related processes executing on one or more processors of the distributed computing environment, is provided a protocol having a dynamic number of synchronization phases. The protocol is voted on by one or more members of the group to determine how the protocol should proceed for the group of members. The protocol may complete successfully, continue to another synchronization phase or be rejected. The group of members determines how many synchronization phases the protocol is to include.

Abstract: A method of performing a parallel join operation on a pair of relations R1 and R2 in a system containing P processors organized into Q clusters of P/Q processors each. The system contains disk storage for each cluster, shared by the processors of that cluster, together with a shared intermediate memory (SIM) accessible by all processors. The relations R1 and R2 to be joined are first sorted on the join column. The underlying domain of the join column is then partitioned into P ranges of equal size. Each range is further divided into M subranges of progressively decreasing size to create MP tasks T.sub.m,p, the subranges of a given range being so sized relative to one another that the estimated completion time for task T.sub.m,p is a predetermined fraction that of task T.sub.m-1,p. Tasks T.sub.

Abstract: A method and apparatus for minimizing the time required to obtain results for a content based query in a data base. More specifically, with this invention, the data base is partitioned into a plurality of groups. Then, a schedule or sequence of groups is assigned to each of the operations of the query, where the schedule represents the order in which an operation of the query will be applied to the groups in the schedule. Each schedule is arranged so that each application of the operation operates on the group which will yield intermediate results that are closest to final results.

Abstract: A method is disclosed for determining the minimum miscibility pressure of a three (3) or more component fluid system consisting of an in-place fluid and an injected fluid, such as a mixture of liquid and gaseous hydrocarbons and another gas, such as CO.sub.2 or nitrogen. For a given pressure, the concentration of the first fluid is varied until a multiphase fluid state is indicated. The coexisting equilibrium phase compositions are calculated to determine a tieline which is translated geometrically retaining the direction of its slope to estimate a new tieline which attempts to be coincident with the second fluid's composition. The method above is repeated utilizing an increased pressure if the new tieline is coincident with a second fluid's composition and utilizing a decreased pressure if a coincident tieline does not exist, until a boundary pressure is achieved which represents the minimum miscibility pressure.