Abstract: Various enhancements are made to the architecture of a list processor to facilitate its use in implementing a message queue that is shared by queue managers residing across a multisystem complex. A new list structure control—a program list entry identifier indicator, or PLEIDI—is defined to allow the user to specify whether user-defined entry IDs are used when the list is allocated. A new delete list (DL) command is added that sequentially processes list entries in the order in which they exist on the specified list. A new move list entries (MLES) command provides a performance-optimized means to process an input list of entries. New key comparison functions and list monitoring enhancements have also been added. A new type of key called a secondary list entry key (SLEK) allows the user to specify a secondary key value as a means to identify a list entry.

Abstract: A system for intercepting API calls in a virtual memory system comprises an activation module comprising an executable program and an interception module comprising a dynamic link library (DLL). The activation module is first executed at system initialization time, its prime purposes being to: parse user configuration information supplied in a configuration file; act as a daemon to launch and thus retain the interception module in shared memory; and hook system APIs to redirect calls via the interception module.

Abstract: A method and apparatus for controlling the termination of one or more processes in an information handling system, such as UNIX processes running under the control of an UNIX operating system kernel, in response to a shutdown command. Processes may optionally register with a registration facility of the operating system kernel as permanent processes ineligible for process termination or as blocking processes entitled to advance notification of process termination. In response to receiving a shutdown command, a shutdown facility of the operating system kernel notifies each process that has registered as a blocking process of an impending shutdown. Upon the expiration of a predetermined time interval, the shutdown facility determines whether all of the processes that have registered as blocking processes have concurred in the shutdown, either by unregistering as blocking processes or by terminating.

Abstract: A method and system for automatically detecting deviations in a data table comprising a multitude of records and a multitude of columns. A column of the data table is selected as a classification column and a classification tree is calculated with respect to the classification column. Each edge of the classification tree is associated with a predicate. The leaf nodes of the classification tree are associated with a leaf record set comprising the subset of records for which the class predicate comprising all predicates along a path from a root node of the classification tree to the leaf nodes evaluates to TRUE. Leaf nodes are associated with a leaf label representing an expected value in the classification column for the corresponding leaf record sets. From the leaf record sets all records deviating with respect to the corresponding classification column from the leaf label are determined as deviation sets.

Abstract: Public key security control (PKSC) is provided for a cryptographic module by means of digitally signed communications between the module and one or more authorities with whom it interacts. Authorities interact with the crypto module by means of unsigned queries seeking nonsecret information or signed commands for performing specified operations. Each command signed by an authority also contains a transaction sequence number (TSN), which must match a corresponding number stored by the crypto module for the authority. The TSN for each authority is initially generated randomly and is incremented for each command accepted from that authority. A signature requirement array (SRA) controls the number of signatures required to validate each command type. Upon receiving a signed command from one or more authorities, the SRA is examined to determine whether a required number of authorities permitted to sign the command have signed the command for each signature requirement specification defined for that command type.

Abstract: An object-oriented method and system for transferring a file system including folders and data files from a source data storage controlled by a source data processing unit to a destination data storage controlled by a destination data processing unit over a transfer medium. This method consists in building in the source data storage at least one file object containing the data package to be transferred, generating a descriptor file including the parameters associated with the file object, generating an archive file including the data package, and transmitting the descriptor file and the archive file from the source data processing unit to the destination data processing unit over the transfer medium.

Abstract: A method and apparatus for ensuring that a process interacting with a failing process is notified of the failure of that process. Each process has a unique process identifier (PID) associated with it. Each process optionally has an affinity list containing one or more entries, each of which contains the identifier of a process that is to be notified when the process fails. A process updates the affinity list of a target process (either itself or another process) by calling an affinity service of the operating system (OS) kernel, specifying the type of operation (add or delete), the identifier of the target process, the identifier of the process that is to notified, and the type of event that is to be generated for the process that is to be notified. When a process fails, a process termination service of the OS kernel examines the affinity list of the failing process and, for each entry in the list, generates an event of the specified type for the process specified as to be notified.

Abstract: The present invention relates to improvements for managing remote function calls and other mechanisms for managing the remote invocation and control of programs. A separation of the request-driven communication work from one broad unstructured bulk of work into at least two separate portions of management is proposed: a dispatching portion and one or more connection portions. Connections are not closed but are reused whenever advantageous, which yields better performance. A standardized interface is set up which is able to be used by a plurality of different requester applications. Thus, a way is found to pass a RFC connection from one application to another, and the same RFC connection can be used by totally independent applications.

Abstract: For the transfer of bulk data between a client computer system and at least one server computer system, throughput-relevant information is gathered from system components involved in the transfer. The information gathered is passed to a knowledge base that holds algorithms and data on relations and combinations of throughput-relevant information. By means of the knowledge base a set of performance parameters is generated that are effective to achieve a maximum data throughput. The determined set of performance parameters is used for a setup and configuration of a data transfer controller that controls the system complex for the transfer a maximum of data within a minimum amount of time and to reduce the expenditure for the system setup and configuration before the transfer is started. The data transfer may be part of backup and restore operations of bulk data.

Abstract: This invention report describes the architecture of a system, which undertakes in a new way the dynamic generation of symmetrical keys and the confidential synchronization of encryption components which use these keys. The basis is formed by the principle of the one-time-pad, with which absolute confidentiality can be ensured in theory. The difficulties with practical implementation of a pure one-time-pad can be avoided by expansions.

Abstract: A method and means for automatically deriving from a process model of a workflow management system (WFMS) or a computer system with comparable functionality a set of underlying application services and providing a means to locate these application services by creating entries in appropriate taxonomies.

Abstract: A method, apparatus and program storage device for enabling the reading of data from a named pipe by a reader process while minimizing the use of system resources in an information handling system in which client and reader processes write data to and read data from a named pipe by issuing function calls to an operating system. A first reader process creates a named pipe if it does not already exist and issues a read function call to the operating system specifying the named pipe to attempt to read data from the pipe. If the read operation is successful, the first reader process repeats the step of issuing the read function call. Otherwise, the first reader process issues an activate-on-receipt function call to the operating system, specifying the named pipe, a new reader process to be activated upon the receipt of data by the named pipe and, optionally, data being passed from the first reader process to the new reader process, and then terminates.

Abstract: A method and apparatus for implementing a shared message queue using a list structure. A put list is defined comprising a sequence of list entries, each of which corresponds to a message in the queue and has an associated list entry key. Each list entry key corresponding to an uncommitted message falls within an uncommitted key range defining an uncommitted portion of the put list, while each list entry key corresponding to a committed message falls within a committed key range defining a committed portion of the put list. To write a message to the queue, a list entry is added to the put list having a list entry key within the uncommitted key range.

Abstract: A simulator of intelligent workstations at level 2 the OSI model for generating complete LAN frames for testing a system under test. The simulator includes a scripting facility that represents the actions of the human end-user at the client workstation. By providing a scripting facility, different complexions of a workload can be impressed upon the system under test without the need for human end-users nor the need for rebuilding the simulation tool. The simulator includes embedded protocol stacks allowing manipulation of the simulated LAN frames. The simulator also includes one or more embedded protocol application modules for emulating actions of an application, e.g., web browser, and enabling the handling of dynamic, application-related events.

Abstract: In a computing system having swappable and non-swappable address spaces, wherein the computing system includes an operating system that includes a Real Storage Manager (RSM), a Systems Resource Manager (SRM) and a Region Control Task (RCT), a method for recovering swappable fixed non-preferred memory is provided which includes receiving a request from the operating system to configure an area of real memory to create an intercepted swappable address space, wherein the intercepted swappable address space includes a flagged fixed frame element identified for configuration, examining the intercepted swappable address space so as to determine if the intercepted swappable address space will remain swappable, requesting the SRM to coordinate the swapping process, quiescing the intercepted address space, generating a first return code responsive to the intercepted swappable address space remaining swappable, communicating the first return code to the RCT so as to cause the RCT to respond to the first return code, in

Abstract: In a computing system implementing a virtual memory system having real memory storage frames for storing virtual pages of data and an auxiliary storage system comprising auxiliary storage slots for storing copies of corresponding virtual pages provided in real storage frames, a system and method for freeing auxiliary storage slots to enable further copying of pages thereto.

Abstract: A computer display system, method and article of manufacture are presented allowing a user to interactively arrange two-dimensional windows for display in three dimensions on a two-dimensional display screen of the computer system. A window manager associated with the display screen is configured to respond to a user's selection of a frame edge of a window, e.g., using a third mouse button, by rotating the window from a two-dimensional depiction to a three-dimensional depiction. Rotation of the window occurs on an edge frame opposite to the selected edge frame and the rotation angle is related to the magnitude that the user drags the pointing device after selection of one edge frame of the window to be swung. In a similar manner, multiple windows can be swung for three-dimensional viewing and simultaneous display within the display screen.

Abstract: An automatic tuning of the assignment of data sets of an application program to the buffer pools in the main storage is provided. Buffer pool usage statistics data are generated including a performance value for each of the data sets. The performance values of the data sets are examined for the existence of a data set reassignment criteria and a data set is reassigned to another buffer pool if a reassignment criteria is found. To determine a suitable buffer pool for receiving the data sets to be reassigned, a selection value for each of the buffer pools is generated by comparing the pool size with selected ones of the usage parameters. The selection values of the buffer pools are examined for the existence of a selection criteria that determines the buffer pool to which the data set is reassigned. The performance value examination and the data set reassignment are performed at restart time of an application program and may be repeated in predetermined time intervals during its runtime.

Abstract: A method of changing a parameter of an operating system of a computer system is described. All requested values of the parameter are stored in a history database. A new resolved value is created by a history manager depending on these requested values and a desired new value of the parameter. The structure and the relationship of the parameter is stored in a schema.

Abstract: To provide a method and a system for creating a mini time key from a time key, a plurality of mini time keys are created within a unit time period. First, a unit time decryption key is prepared immediately after the unit time is created. Then, the last mini time key is created by applying a one-way function to the unit time decryption key. A desired mini time key is created by applying the one-way function to a mini time key following the desired mini time key. In other words, the mini time keys are created as a timed series arranged in a descending order beginning with the last mini time key. In this manner, even when a specific mini time key is externally leaked for a specific reason, a following mini time key in a timed series can not be created by using this mini time key. In addition, even when the mini time keys are sequentially published, the security of the unit time decryption key is maintained.