International Business Machines Corporation

Khoa D Huynh

Theodore C Waldron, Iii

Kenneth W Christopher, Jr

Scott Lee Winters

Stanley Alan Smith

Chakkalamattam Jos Paul

Badari Pulavarty

Glenn E Brew

Brian Keith Howe

Paul P Giangarra

John G Tyler

Rezaul S Islam

Virginia M Roarabaugh

Michael S Kogan

Charles M Norcutt, Jr

A method may comprise storing first storage information in a storage device of a computer storage system on a first network. The computer storage system may transform the first storage information into a first virtual storage instance, provide access to the first virtual storage instance on a second network not in communication with the first network and the storage device, and enable over the second network the modification of the first virtual storage instance to create a first modified virtual storage instance. The computer storage system may also transform the first modified storage instance into first modified storage information based on the first modified storage instance, and store on the storage device the first modified storage information.

Secure access to shared storage resources

The present invention provides a method for distributing system files and system registry changes dynamically. An 'application package' consisting of system files and registry changes is added to a user. When the user logs on, the detection of a 'package' is made if the package is not already installed on the client machine, a batch file is used to copy the files and make the registry changes to the local machine. A &#x201c;key&#x201d; is then set on the machine indicating that the files/registry entries are installed.

Method and apparatus for dynamic distribution of system file and system registry changes in a distributed data processing system

The invention provides a system and method of enhancing efficiency in a data processing system having a processor, a memory, and a multitasking operating system for managing the processor and the memory. A normal and an expedited scheduling path are provided for scheduling tasks on the processor. The tasks are each assigned a priority for execution on the processor. A queue is provided for the placement of tasks ready for execution. Upon entry into the ready-to-run queue, the execution priority of the new task is compared to the execution priority of the executing task. Responsive to the new task holding a higher execution priority or to absence of an executing task, the expedited scheduling path is invoked. Otherwise the normal scheduling path is invoked.

System and method for optimizing dispatch latency of tasks in a data

A system and method for loading a segmented program into a memory for a multitasking data processing system utilizing paged virtual storage for processes is disclosed. A virtual address space having a plurality of pages for the segmented program is established. Segments of the segmented program suitable for packing end to end across page boundaries are identified. A virtual storage object over a contiguous portion of the virtual address space is defined and the segments identified for packing into the virtual storage object are mapped into the contiguous portion. Any segments not suitable for packing across page boundaries start on page boundaries in the virtual address space. Then segments corresponding to selected pages of the virtual address space are demand loaded into frames of the memory in the same manner in which they are addressed into the virtual address space.

System and method for handling a segmented program in a memory for a

A priority preemptive, time distribution operating system operating in accordance with the method of the present invention provides enhanced efficiency in operation of a data processing system having a central processing unit, a computer memory and an auxiliary memory. The operating system manages the central processing unit, the computer memory and the auxiliary memory where a plurality of processes are presented for execution on the central processing unit by: ordering the processes for execution; allocating a predetermined time slice for execution of a process from the ordering; executing a first current process in the ordering on the central processing unit for the predetermined time slice; responsive to occurrence of a storage access operation during execution of the first current process, allocating a supplemental time slice to the current process for execution; and continuing execution of the current process for the supplemental time slice.

Method of integrated system load control through dynamic time-slicing in

A method in a computer system for monitoring time intervals during which external interrupts are inhibited within the computer system in a selected program being run on the computer system. The method and apparatus of the present invention includes identifying a first plurality of instructions, capable of blocking external interrupts and identifying a second plurality of instructions, capable of unblocking external interrupts. After identifying these instructions, a unique benign fault is inserted proximate to selected ones of the first plurality of instructions and selected ones of the second plurality of instructions to produce a special version program. The special version program is then run in the computer system. Faults which occur during the running of the special version program and associated external interrupt-blocking times are monitored.

Growing community of inventors

Miami, FL, United States of America

Khoa D Huynh