Abstract: A recursive logical partition real memory map mechanism is provided for use in address translation. The mechanism, which is provided in a data processing system, receives a first address based on an address submitted from a process of a currently active logical partition. The first address is translated into a second address using a recursive logical partition real memory (RLPRM) map data structure for the currently active logical partition. The memory is accessed using the second address. The RLPRM map data structure provides a plurality of translation table pointers, each translation table pointer pointing to a separate page table for a separate level of virtualization in the data processing system with the data processing system supporting multiple levels of virtualization.

Abstract: A secure computer architecture is provided. With this architecture, data is received, in a component of an integrated circuit chip implementing the secure computer architecture, for transmission across a data communication link. The data is converted, by the component, to one or more first fixed length frames. The one or more first fixed length frames are then transmitted, by the component, on the data communication link in a continuous stream of frames. The continuous stream of frames includes one or more second fixed length frames generated when no data is available for inclusion in the frames of the continuous stream.

Abstract: Hardware mechanisms are provided for performing hardware based access control of instructions to data. These hardware mechanisms associate an instruction access policy label with an instruction to be processed by a processor and associate an operand access policy label with data to be processed by the processor. The instruction access policy label is passed along with the instruction through one or more hardware functional units of the processor. The operand access policy label is passed along with the data through the one or more hardware functional units of the processor. One or more hardware implemented policy engines associated with the one or more hardware functional units of the processor are utilized to control access by the instruction to the data based on the instruction access policy label and the operand access policy label.

Abstract: The present invention is directed to provisioning and managing computing services in a computing utility system. It receives as an input an infrastructure independent description of a set of requirements on the new desired state of a computing service. It uses a knowledge plane to represent the infrastructure. The method generates a Concrete Model that describes a resource structure that refines the input and is implementable over the infrastructure. It then generates and possibly executes provisioning actions to create an identical resource structure on the infrastructure. The method can be used to create new computing services, to destroy existing computing services, to modify the resource combinations allocated to a computing service, or the configuration of these resources. Provisioning actions can be executed immediately, or saved and executed later, and possibly many times.

Abstract: A method, system, and computer program for managing multi-tiered resource systems, such as Storage Area Networks (SANs). Resource tiers in the resource system are examined to if they are in compliance with a management policy. If a resource tier is not in compliance with the management policy, a processing operation automatically increases available capacity in containers in order to bring the containers in compliance with the management policy. The management policy may, for example, include a requirement that an expiration date of the resource tier occur after a maintenance date.

Abstract: Methods, apparatus and systems for controlling allocation and de-allocation of resources in a computing utility system, and evaluating resource assignments. Resources are dynamically allocated to customers of the computing utility through computing environments in such a way that a given objective is satisfied. Assignment of resources to environments is affected by relationships between computing environments which enable resource sharing, and constraints regarding assignment of resources to environment which limit resource sharing. The invention may be used over all of the environments in the utility or a selectable subset.

Abstract: This invention provides for the hierarchical provisioning and management of a computing infrastructure which is used to provide computing services to the customers of the service provider that operates the infrastructure. Infrastructure resources can include those acquired from other service providers. The invention provides architecture for hierarchical management of computing infrastructures. It allows the dynamic provisioning and assignment of resources to computing environments. Customers can have multiple computing environments within their domain. The service provider shares its resources across multiple customer domains and arbitrates on the use of resources between and within domains. The invention enables resources to be dedicated to a specific customer domain or to a specific computing environment. Customers can specify acquisition and distribution policy which controls their use of resources within their domains.

Abstract: A computer system manages files shared by first and second heterogeneous clients. The first client exhibits a first protocol such as SMB and the second client exhibits a second, different protocol such as NFS. A first protocol converter receives requests from the first client to create, read and update the files, and converts the requests to corresponding requests exhibiting a common protocol. A second protocol converter receives requests from the second client to create, read and update the files, and converts the requests to corresponding requests exhibiting the common protocol. A file manager is common to both clients and both protocol converters, receives the converted requests exhibiting the common protocol and executes the requests in a name space and data area which are both common to the first and second clients. The name space stores names of the files and the data area stores the files.