Abstract: A reporter facility for reporting data from a sysplex with a plurality of operating system images. The reporter facility comprises one or more data sets in the operating system images containing the reportable data. A first data server is provided in a first one of the operating system images and one or more second data servers are provided in the operating system images with the data sets containing reportable data. The second data servers on receipt of a request issued by the first data server collect the reportable data from the data sets and pass it through the connections to the first data server, which then passes it to the reporter facility. In one embodiment of the invention the data sets include data relating to the use and load of resources within the sysplex.

Abstract: Apparatus and accompanying methods for use preferably in a multi-system shared data (sysplex) environment (100), wherein each system (110) provides one or more servers (115), for dynamically and adaptively assigning and balancing new work and for new session requests, among the servers in the sysplex, in view of attendant user-defined business importance of these requests and available sysplex resource capacity so as to meet overall business goals. Specifically, systems and servers are categorized into two classes: eligible, i.e., goal-oriented servers running under a policy and for which capacity information is currently available, and candidate, i.e., servers which lack capacity information.

Abstract: A system for encrypting a plaintext block using a block encryption algorithm having a block size smaller than that of the plaintext block. The plaintext block is transformed into a masked plaintext block using an invertible transformation optionally dependent on additional data and defined such that each bit of the masked plaintext block depends on every bit of the original plaintext block. A subportion of the masked plaintext block is encrypted using the encryption algorithm to generate an encrypted portion of the masked plaintext block. A ciphertext block is generated from the thus encrypted portion of the masked plaintext block and the remaining portion of the masked plaintext block. The ciphertext block is transmitted to a data recipient, who reverses the procedure to recover the original plaintext block.

Abstract: A cryptographic key recovery system for generating a cryptographic key for use by a pair of communicating parties while simultaneously providing for its recovery using one or more key recover agents. A plurality of m-bit shared key parts (P, Q) are generated which are shared with respective key recovery agents, while an n-bit nonshared key part (R) is generated that is not shared with any key recovery agent. The shared key parts (P, Q) are combined to generate an m-bit value which is concatenated with the nonshared key part (R) to generate an (m+n)-bit value from which an encryption key is generated. The cryptographic system has the effective work factor of an n-bit key to all of the key recovery agents acting in concert, but has the effective work factor of an (m+n)-bit to any other combination of third parties.

Abstract: I/O protection key processes for protecting storage blocks (page frames) in a shared main storage against unwanted I/O accesses. Independent CP (central processor) key protection may optionally be provided to protect the same storage against unwanted CP accesses. Processes are included for initializing, and addressing I/O buffers used by the I/O programs; each I/O buffer is comprised of a contiguous set of the blocks (page frames). The I/O keys may be used independently of any CP keys provided for protecting the same blocks against unwanted accesses by any CP in the system. The I/O keys must be supported by a hardware I/O storage array when only real (or absolute) addressing is used by I/O programs. However, the CP keys may be supported by either real CP keys in a second hardware key array; or alternatively the CP keys may be provided as virtual CP keys in a field in each page table entry (which is used for translating CP virtual addresses to CP real addresses).

Abstract: A method and apparatus for synchronizing selected logical partitions of a partitioned information handling system to a test datesource. A system operator is presented with a display panel in which the operator may specify a set of test partitions and a test clock value. Each partition designated as a test partition is synchronized to the test clock value upon being newly activated, while production partitions are synchronized to a production clock value. The first test partition to be newly activated is synchronized to the test clock value by calculating the difference between the test clock value and a host clock value and storing the difference as an epoch offset for that partition. Each subsequently activated test partition is synchronized to the test clock value by copying the epoch offset of the previously activated test partition.

Abstract: Protection against unwanted I/O accesses in main storage blocks/page frames independent of any storage protection provided against unwanted CPU accesses. An I/O protection array is used containing one-bit I/O keys used only for protecting which respectively protect associated blocks/page frames from unwanted accesses by I/O programs. Each one-bit I/O key is used to allow or disallow I/O accesses into an associated storage block. Any CPU access is not affected by the I/O storage key. No I/O program key is used and therefore no key compare operation is required. However, the embodiment is compatible with use of CPU storage protection using CPU storage keys in either real form in a CPU storage key array, or in virtual form in page table entries without using any CPU storage key array.

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 cryptographic key recovery system that is interoperable with existing systems for establishing keys between communicating parties. The sender uses a reversible key inversion function to generate key recovery values P, Q and (optionally) R as a function of a session key and public information, so that the session key may be regenerated from the key recovery values P, Q and (if generated) R. Key recovery values P and Q are encrypted using the respective public recovery keys of a pair of key recovery agents. The encrypted P and Q values are included along with other recovery information in a session header accompanying an encrypted message sent from the sender to the receiver. The key recovery agents may recover the P and Q values for a law enforcement agent by decrypting the encrypted P and Q values in the session header, using their respective private recovery keys corresponding to the public keys.

Abstract: Main storage access protection against unwanted I/O accesses in storage blocks/page frames independent of any protection provided against unwanted CPU accesses. I/O programs are each assigned an I/O program key which is matched against an I/O storage key selected from an I/O storage protection array used only for protecting blocks from accesses by I/O programs, but not from any accesses by CPU programs. The address of each storage access request by an I/O program selects a key entry in the array containing the I/O storage key used in the comparison with the I/O program key. Each entry in the I/O storage array may also contain a second I/O storage key which may be either a one-bit type as described and claimed in application Ser. No. 08/652,197 or a two-bit type as described and claimed in application Ser. No. 08/652,079, both applications of which were filed on the same day as this application and assigned to the same assignee.

Abstract: Apparatus and an accompanying method for automatically assessing a communicative capability of two communications programs. In particular, two pre-exiting communications programs are compared, errors in each program that inhibit communication between the programs are then determined and resolved. To accomplish this, computer code contained in one communications program is compared to that contained in the other communications program. Determining and resolving such errors ensures that the computer code contained in one communications program is responsive to computer code contained in the other communications program and vice versa. Furthermore, if only one pre-existing communications program is available, this method and apparatus generates a second communications program from the is pre-existing communications program. Consequently, the pre-existing program is fully conversant with the second communications program.

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 enabling a listening daemon in a client/server system to execute a specified task on behalf of a user. Upon receiving a user request, the listening daemon sets an environment variable in accordance with the user identity specified in the request and issues a system call to the operating system kernel to spawn the user task specified in the request. In response to the system call, the operating system kernel creates a new address space for the specified user task and creates a security environment for the user task in accordance with the environment variable before starting the user task in the new address space.

Abstract: A distributed network management system for managing redundant global network control points. The network management system allows candidate control points to determine which is primary and which are alternates, initializes the primary and alternate control points, synchronizes global data, and manages client interaction with the control points. The control points negotiate primary status by establishing a named resource in each processor and by testing for the lowest network address in each active processor. In addition, each client workstation determines which of the candidate control points is primary by interrogation. Client processes detect primary control point failures and switch the alternate control point to primary status.

Abstract: A Structured External Storage (SES) processor is linked by a communication means to one or more general purpose processors. Two or more applications executing on the one or more general purpose processors communicate function request messages to a message processor within the SES to effect serialized sharing of data within the SES. Within the message processor, a predicate function means executes unconditionally on receipt of one of the function request messages, and a data function means executes conditionally and atomically with respect to the predicate function means following a "successful" condition produced by the predicate function means.

Abstract: A system and method for facilitating compatibility with a prior process used for connecting a user terminal to a selected server in a system having a plurality of servers. The prior process has the server perform a task on behalf of the terminal. The system includes a server determination process for retrieving from storage a table of data identifying the servers, and for determining an address currently associated with each server. Then, a chooser process enables the user to select from the table, one of said servers for connection to the terminal with a connection process, responsive to a signal from the terminal, that initiates a connection of the terminal to the selected server. The plurality of servers in the system includes at least one parallel server comprised of multiple processors.

Abstract: A program stored on a portable storage medium for transferring the program from/to a data processing system, including to or from a disk medium in the system. The program manages I/O buffers that use I/O storage protection key for protecting storage blocks (page frames) in a shared main storage against unwanted I/O accesses, but the I/O storage keys do not protect the storage blocks from an CP (central processor) accesses. CP key protection may optionally be provided to independently protect the same storage block against unwanted CP accesses. Processes initialize, and address I/O buffers used by I/O programs; each I/O buffer is comprised of a contiguous set of the blocks (page frames). The I/O keys are used independently of any CP keys, and both I/O and CP keys are required for protecting any block against unwanted accesses by both I/O and CP accesses. The I/O keys are supported by a hardware I/O storage key array when real (or absolute) addressing is used by I/O the programs.

Abstract: A computer graphics system reduces the number of lighting calculations required to render a scene having objects illuminated by light sources by classifying each primitive for objects in an illuminated scene as either hidden or visible using a z-buffer. In a first approach, only one pass is made through the display list of primitives for the scene, and lighting calculations are performed only for primitives classified as visible. In a second approach, two passes are made through the display list. In the first pass, the display list is fully traversed to set-up the z-buffer, and no lighting calculations are performed. When the second pass of the display list is performed, each primitive is classified as hidden or visible, and lighting calculations are performed for each primitive classified as visible as the display list is traversed. Lighting calculations may be performed using either Gouraud or Phong shading.

Abstract: Apparatus for setting the color point of a color display device comprises a video signal generator for generating an image on the display device and a color analyzer for measuring the chromaticity of the image to produce digital coordinates corresponding to the color point of the image on a chromaticity reference chart. The apparatus further comprises a computer system connected to the color analyzer. The computer system includes interface means for reading the digital coordinates from the color analyzer, display means for displaying a cursor at a point corresponding to the coordinates within a graphical representation of the reference chart, and processor means for moving the cursor within the graphical representation in response to a change in the coordinates read from the color analyzer. The apparatus advantageously permits rapid adjustment of the color point of a display device to a desired value with a high level of measurement repeatability.

Abstract: A system for order planning that translates an order configuration into a list of bills of materials list. The system operates based upon a first logical specification of relationships between models, optional features or device codes and required material components. The first logical form of relationships is transformed into an unambiguous statement of relationships. These relationships are then encoded to provide a compact knowledge base for evaluation of orders and order plans. Each order is encoded in a manner that allows rapid comparison with the predicates specified in the knowledge base. The order evaluation mechanism is independent of the knowledge base allowing the knowledge base to be updated in response to changes in design or relationships.