Unisys Corporation

Philip M Hoffman

Michael J Saunders

Anthony P Matyok

James W Thompson

Dwayne E Ebersole

Clark C Kogen

William Stratton

Sharon M Mauer

Andrew David Milligan

Steven Clarke

Robert K Liermann

Jessica A Paragas

Tatyana Martsun

Michael I Bell

Steven D Schatz

Todd Little

Greg L Gensichen

Jeffrey A Stell

Eugene W Troxell

A method and system for secure automated deployment of an emulated computer system. The method includes providing a download package for installation on a target machine. The download package includes a generic emulated computer system having no unique identity, no model identity, no features, and minimal processing components. The download package also includes a customer order file based on an order from a customer of the target machine. The customer order file includes a machine identity, at least one machine capability, and control data. The download package also includes at least one enabling key configured to enable the emulated computer system on the target machine. The enabling key is customized based on the order from the customer of the target machine, and includes identity information that restricts the use of the emulated computer system on any computer system other than the target machine. The method also includes delivering the download package to the target machine for installation of the emulated computer system on the target machine. The download package prevents the unauthorized cloning of the emulated computer system onto any hardware platforms other than the target machine, and prevents the unauthorized use of any hardware other than the hardware of the target machine.

Method and system for secure automated deployment of emulated computer system

Systems and methods are disclosed herein to a method for providing a system name of a computer system, comprises generating a system ID key based on a system type of the computer system using an external key generator module; installing the system ID key on the computer system in an active operating state by extracting the system name from the system ID key; updating operating system structures for immediate use of the system name; writing a machine name index into halt/load parameters that are implemented by the computer system for subsequent restarts of the computer system after suspending the computer system, wherein the machine name index identifies a location of the system name in a system registry; and writing the system name into the system registry from the system ID key.

System and method of capacity management

A method of dynamically allocating the amount of input/output (I/O) rate capacity to partitions in a computer system includes determining a total amount of I/O rate capacity and an economic value of each partition within the partitioned computer system. The economic value is defined as a performance-valued product established for each partition wherein the sum of all performance-value products for each partition defines a total economic value for the computer. The I/O rate to be allocated to each partition is calculated to be a portion of the total amount of I/O rate capacity where the portion allocated to each partition is proportional to the economic value of that respective partition. The calculated rate allocations are recorded in memory which is accessible to each partition. After recording, each partition regulates its I/O usage according to the recorded allocation.

Dynamic distribution of I/O resources in a partitioned computer system

Mechanisms and methods for traversing trees are disclosed. A novel data structure for modeling a node that includes a unique node counter also is described. In certain embodiments of the inventions the unique node counter is a timestamp of sufficient granularity to render each timestamp in the tree unique. A node counter, in conjunction with the lineage of a specified continuation node may be used to locate an appropriate starting point within a tree in a continuation call when the specified continuation node no longer exists in the tree.

Mechanism for continuable calls to partially traverse a dynamic general tree

A data compression/decompression system employs two stages of data compression. Information and/or character data is first formatted into M-bit width digital data characteristics for input to the first stage of the data compression system which comprises an expanding run length encoder having N-bit width output character where N&gt;M and the number of M-bit width characters is greater than the number of N-bit width characters. The output of the expanding run length encoder is applied directly to a compatible adaptive string matching second stage data compression encoder of the type which is not degraded or affected by the input. When the input data stream to the two stage system is not of a known format or provided with leader or header bit character width information, a bit analyzer and a chopper are provided in a data stream to prepare the data stream in a bit character width format which matches the input of the expanding run length encoder.

Two stage run and string data compressor providing doubly compressed

Growing community of inventors

Malvern, PA, United States of America

Philip M Hoffman