Abstract: It is one object of the present invention to obtain a clear scaled image, without impairing the rough shape of fonts or the like, on a graphics screen that is handled by an information display device such as an LCD panel or a projector, and that includes a lot of stepped edges like thin lines.

Abstract: A sectioned ordered queue in an information handling system comprises a plurality of queue sections arranged in order from a first queue section to a last queue section. Each queue section contains one or more queue entries that correspond to available ranges of real storage locations and are arranged in order from a first queue entry to a last queue entry. Each queue section and each queue entry in the queue sections having a weight factor defined for it. Each queue entry has an effective weight factor formed by combining the weight factor defined for the queue section with the weight factor defined for the queue entry. A new entry is added to the last queue section to indicate a newly available corresponding storage location, and one or more queue entries are deleted from the first section of the queue to indicate that the corresponding storage locations are no longer available.

Abstract: To provide a general-purpose method of making it possible to easily realize the switching of an OS, which is booted on a computer, among OSs, the present invention downloads information for booting a second OS in a state of a first OS operating on the computer with access to a homepage, reception of e-mail, or the like (130), starts a device driver after password verification, and requests the hook of OS termination (134 to 138). The device driver performs the processing of hooking the OS termination according to the request, and suspends the processing after loading a boot image file or the like, which are downloaded, into a main storage unit (114-148). When the OS is terminated, the device driver restarts the processing and starts a patch program after changing a processor mode (150 and 152). Owing to this, after various types of preprocessing are performed, the second OS is booted by using the boot image file loaded into the main storage unit.

Abstract: For browsing entity beans in a client-server environment using the Enterprise Java Beans (EJB) architecture a generic servlet is provided for receiving a service requests from a Web browser and for initiating an access to an entity bean directory to identify an entity bean home according to a bean name contained in the request. The identified entity bean home is asked for a specific entity bean instance using key information passed with the service request. The identified bean instance is introspected by using getBeanInfo( ) methods of the Java Bean Introspector. The information achieved by the introspection is used for retrieving entity bean properties from an EJB persistency store. On the basis of the retrieved information the generic servlet generates a response which provides a representation of the retrieved information. The generic servlet allows to avoid the development of customized servlets which comprise specific code for the browsing and editing of different entity bean classes.

Abstract: The present invention controls the automation process in a computer network system. An Abstract Resource Model is introduced in which the model results in the automation being divided into two: an automation execution component and an automation decision-making component. The automation execution component controls how programs or resources are run within a specific environment, and the automation decision making component controls when a program or resource is run on an abstract decision-making level. In the Abstract Resource Model, the operator needs no specific knowledge as to which programs or program components belong to an overall application, or which programs or program components need to be started in which order.

Abstract: A hook interface module cooperates with a kernel whose functionality is being modified and with kernel modules providing modified functionality. The kernel includes symbols indicating execution points where modification is permitted. The hook interface module resolves an address for each symbol and maintains a list of any modification functions associated with each symbol. An API exposes a registration method for enabling the kernel modules to register a modification function for a symbol and add an indicator for the modification function to the list for the symbol. An arming method enables the kernel modules to arm modification functions associated with the symbols. This modifies the address contents for each symbol to cause program execution at the symbol address to jump to a location in the hook interface module. A dispatcher responds to this and causes execution to jump to any modification function associated with a symbol from which execution has jumped.

Abstract: A method for using ancillary processors and memory to speed critical data capture includes building a list memory address ranges associated with a secondary partition. The memory address ranges are located in central storage memory and contain the data to be captured. The method also includes reading the data from the memory address ranges and writing the data to a portion of memory reserved by a first partition as a capture pool. The capture pool is also located in central storage memory and is not accessible by the secondary partition. The invention also includes a system for using ancillary processors and storage to speed time critical data captured.

Abstract: A technique is disclosed for managing a workload distributed across multiple data processing systems to enhance shared resource access to meet a common performance standard. The technique includes on at least one system, measuring performance of the work units on the system to create local performance data, and on at least some of the systems sending the local performance data to at least one other system of the multiple data processing systems. The method further includes on at least one of the systems, receiving the performance data from the sending systems to create remote performance data, and adjusting at least one control parameter for accessing shared resources in response to the local and remote performance data to modify the performance of the work units distributed across the data processing systems to achieve the common performance standard. A dynamic resource clustering process is also employed to enhance the shared resource management.

Abstract: Resource contention monitoring and analysis are provided for a single system or multi-system environment. Resource contention is tracked at a task level when contention occurs by listing each owner of a resource in a blocker list and each waiter for the resource in a waiter list. Each list is ordered oldest to newest so each instance of contention is added to the end of the respective list. The resource request and contention lists are cross-linked to provide easy coordination between the resource queues and the contention lists. Techniques for analyzing contention using the lists, including deadlock analysis, are described.

Abstract: The invention relates to a system and method for request based installation, customization and activation of software products on a computer system by means of a setup infrastructure (20) for coordinating the process phases. A plurality of exploiter plug-ins (24) are provided, each assigned to a program product already installed in the computer system or a program product to be installed. The exploiter plug-ins are used by the setup infrastructure for indicating a program package description and program product description and for providing customization dialogs and support to instantiate and activate the program to be installed. Bind supporter plug-ins (23) are assigned to selected ones of the program products and used for supporting the binding procedure by providing bind services to the setup infrastructure.

Abstract: The invention presented describes a system and procedure for protecting against the espionage of secret information. A counter is allocated to each secret piece of information, in particular codes. The counter counts the number of uses of the secret information. In this, the counter is set to a starting value. Each use of the secret data element increases the counter state by a defined value. If the counter state reaches a maximum value, the use of the secret data element will be blocked. The blocking of the secret information can, however, be avoided if a defined event occurs before the maximum value of the counter is reached which automatically resets the counter state to its starting value. Any technical, economic or organisational condition can be defined as an event. Particular advantages of the invention presented are that each code can have its own counter allocated to it. In this way, different numbers of uses can be established for each code with regard to its function.

Abstract: A method and apparatus for runtime remediation of object-code instructions (such as date instructions that are not year 2000 compliant) in a computer program. Before runtime, a setup function of a program monitor locates each instruction to be remediated in a load module of a user program and overlays the instruction with a trap instruction. The address of the overlaid instruction is stored in a scan slot of a window control table (WCT). The text of the overlaid instruction is stored in a corresponding operand slot of the WCT along with control information including a set of flags and windowing and cycling parameters. At runtime, upon decoding a trap instruction, the CPU transfers control to an instruction simulation function of the program monitor, which searches the scan slots of the WCT for the one containing the address of the overlaid instruction.

Abstract: A method and apparatus for dynamically controlling the dispatching of a coupling facility operating in a logical partition sharing a processor resource with one or more other logical partitions issuing requests to the coupling facility. A plurality of coupling facility dispatching modes differing in their relative dispatch duration are defined. One dispatching mode is initially selected, and the number of requests received from the other logical partitions within a predetermined interval while in a selected dispatching mode is determined. Transitions between the defined dispatching modes are made in accordance with the number of requests received within the sampling interval in the selected dispatching mode.

Abstract: A method and a system for safely generating a cryptographic key that is separately provided to a plurality of servers. Through the collaboration of multiple users a cryptographic key is generated for the servers. Specifically, random values are exchanged among the multiple servers, and based on these values, cryptographic keys are generated. Even though the cyclic feature of the cryptographic keys of the individual servers is lost by the exchange of the random values by at least two servers, the cyclic feature for the overall system can be maintained. Public keys for the multiple cryptographic keys are generated and are published. A new public key is generated by combining a plurality of public keys, and a corresponding cryptographic key is calculated by using the cryptographic keys of the individual servers.

Abstract: Resource contention monitoring and analysis are provided for a single system or multi-system environment. Resource contention is tracked at a task level when contention occurs by listing each owner of a resource in a blocker list and each waiter for the resource in a waiter list. Each list is ordered oldest to newest so each instance of contention is added to the end of the respective list. The resource request and contention lists are cross-linked to provide easy coordination between the resource queues and the contention lists. Techniques for analyzing contention using the lists, including deadlock analysis, are described.

Abstract: A high performance client/server editor and method for editing documents with improved performance. A server listening for editing requests from a client to edit a file located with the server spawns a thread for each editing request to handle that particular request. A client receiving input commands from a user for editing requests spawns a thread for each editing request received, enabling more than one editing request to be processed simultaneously. When an edit feature is invoked, the client sends a request to the server to download the file. While the file is downloading from the server to the client location, the client displays the first page of the file to the user to enable the user to start editing the file before the entire file is downloaded. The client handles the user's edit commands for portions of the file downloaded.

Abstract: Managing processor resources in a non-dedicated computer system. An amount of a processor resource is allocated to a real-time application of the computer system. The amount does not exceed a limit chosen for a group of real-time applications, wherein the group includes the real-time application being allocated the resource. A selected amount of the processor resource remains available to execute other types of applications and work on the system. During processing of the real-time application, use of the processor resource does not exceed a chosen maximum value, thereby ensuring the processor resource is not monopolized by the real-time application and allowing other types of work to be processed on the system.

Abstract: It is one object of the present invention to use an access control process to evaluate under a specific condition an access permission request. An access control system 100 comprises a resource document 40 in which a policy description is stored; a policy evaluation module 10 for receiving an external request 110 for accessing the data file, for extracting, from the resource document 40, the policy description that is associated with target data for the access request 110, and for evaluating the policy description to determine whether or not the access request 110 is to be permitted; an enforcement function verification module 20 for, when an existing condition can not be evaluated using only the information included in the policy evaluation module 10, determining whether the condition can be evaluated or can be established; and an enforcement module 30 for evaluating or establishing the condition that, in accordance with the enforcement function verification module 20, can be evaluated or established.

Abstract: The present invention relates to the area of systems management teaching means and a method for determining and managing application performance. Application Response Measurement (ARM) assumes that the managed application is a self-instrumented component. This requires invasive changes to existing applications or to add explicitly code to newly written applications. Due to this additional effort this will restrict the area of applicability of ARM. The basic idea of the present invention is to instrument not the application components. The present invention contemplates instrumenting the invocation agent instead, which in turn is responsible to call the application for execution. This solution provides application response measurement without any modification of the application being measured. It is the invocation agent that makes the appropriate ARM calls to furnish the instrumentation on behalf of the application.

Abstract: A method and apparatus for switching messages from a primary message channel to a secondary message channel in a message queuing system in which messages are placed in a first transmission queue of a local system for transmission to a remote system via a primary message channel. A local queue manager continuously checks to see whether a high water mark has been reached in the first transmission queue, indicating an apparent failure in the primary message channel. On determining such an apparent failure in the primary message channel, the queue manager determines whether the secondary message channel is associated with the first transmission queue. If so, the queue manager activates the secondary message channel to serve said first transmission queue. If, on the other hand, the secondary message channel is associated with another transmission queue, the queue manager transfers messages already in the first queue to the other queue and redirects any new messages intended for the first queue to the other queue.