International Business Machines Corporation

Michael Gary Spiegel

Elpida Tzortzatos

Peter Grimm Sutton

Robert Miller, Jr

Scott B Tuttle

Charles E Mari

Donald Fred Ault

Alfred F Foster

Ernest Scott Bender

Matthew J Mauriello

Mariama Ndoye

David B Emmes

Jeffrey David Aman

David Hom

David Horn

Chun Kwan K Yee

Donna N Dillenberger

Steven M Partlow

Harris M Morgenstern

Karl David Schmitz

Chun-Kwan K Yee

Peter A Fatzinger

Donna N T E Dillenberger

Embodiments are provided for implementing a transparent conversion of common virtual storage requests to storage with limited access. Embodiments include providing a storage manager configured to perform address translation for requests, providing a data address translation (DAT) structure configured to connect a higher-level DAT table to a lower-level DAT table, and creating the DAT structure based on a request from a process. Embodiments also include responsive to receiving a storage request, performing a DAT fault process based on validating user credentials associated with an entry of the higher-level DAT table corresponding to the storage request, and responsive to the validation, updating the higher-level DAT table entry to allow access to the restricted-use portion of the common virtual storage, and otherwise, returning a DAT fault for the higher-level DAT table entry.

Transparent conversion of common virtual storage

Dedicated large page memory pools are provided to, at least in part, facilitate access to large pages. The large page memory is managed by: establishing multiple large page memory pools, each large page memory pool of the multiple large page memory pools including a number of large pages; and dedicating each large page memory pool of the multiple large page memory pools to a respective processor of multiple processors of the computing environment, wherein processors of the multiple processors can concurrently access pages from the respective large page memory pools of the multiple large page memory pools.

Dedicated large page memory pools

Allocation of pages of memory is managed in computing environments that include multiple sized memory pools. Responsive to a request for a page of memory, one or more memory pools are searched for an available frame of memory to service the request. The search uses a predefined order of search, which includes multiple types of memory pools in a specific order based on the requested size of the page of memory.

Managing allocation of memory pages

Large page memory pools are managed. Thresholds are used to determine if the number of pages in a large page memory pool is to be adjusted. If the number of pages is to be increased, a particular technique is provided for adding additional pages to the pool. Further, if there are too many pages in the pool, one or more pages may be removed.

Managing large page memory pools

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. If all of the processes that have registered as blocking processes have concurred in the shutdown, the shutdown facility terminates processes that have not registered as permanent processes while allowing processes that have registered as permanent processes to continue to run. Otherwise, the shutdown facility aborts the shutdown without terminating any of the processes and generates a message identifying processes that have not concurred in the shutdown.

Method and apparatus for controlling the termination of processes in response to a shutdown command

In a client/server system, a method and apparatus for a listening daemon to distribute work and client connectivity across multiple processes each supporting multiple threads. Upon receiving a request from a client, a listening daemonaccepts the conversation, thus creating a socket. The listening daemon then does a putwork( ) call which places a work request on a system managed work queue. The work request behaves in a manner very similar to spawn in that it provides for parameters to be passed as well as transfer of ownership of the socket. In the meantime, server processes that are created either manually or by the operating system create multiple threads, which invoke a getwork( ) service to retrieve work requests created by the listening daemon. The getwork( ) service transfers the socket to the calling process and notifies the thread which file descriptors it has inherited. The thread is then able to process the client request and respond directly to the client without requiring an intermediate process to provide the communication link. The present invention allows a server in a client/server system to spread the workload across multiple threads in multiple processes, avoiding the creation of too many processes or too many threads in a single process. The direct transfer of the socket eliminates the unnecessary overhead typically required to rebind a new process to the client application.

Method and apparatus for transferring file descriptors in a multiprocess, multithreaded client/server system

A method and apparatus for controlling the assignment of units of work to workload enclaves in a client/server system in which units of work are organized into enclaves with the units of work in each enclave being managed as a single entity. Incoming work requests are queued for processing by one or more worker threads of one or more server processes. In response to the receipt of an incoming work request, a putwork() service of the operating system kernel defines an workload enclave for the work request and adds the work request to a queue of incoming work requests to enqueue the request. In response to a request from a worker thread for more work, a getwork() service of the operating system kernel removes a work request from the queue to dequeue the request and associates the worker thread with the enclave defined for the request. If a worker thread must create a new unit of work while processing a work request, it calls an appropriate service of the operating system kernel, which creates the new unit of work and associates the new process with the enclave of the worker thread. The worker thread is disassociated from the enclave upon completion of the work request.

Method and apparatus for controlling the assignment of units of work to

A method and apparatus for enabling a listening daemon in a client/server system to execute a specified task on behalf of a user. Upon receiving a user request, the listening daemon sets an environment variable in accordance with the user identity specified in the request and issues a system call to the operating system kernel to spawn the user task specified in the request. In response to the system call, the operating system kernel creates a new address space for the specified user task and creates a security environment for the user task in accordance with the environment variable before starting the user task in the new address space.

Method and apparatus for creating a security environment for a user task

Growing community of inventors

Monroe, NY, United States of America

Michael Gary Spiegel