Abstract: It is determined that a memory pressure condition exists which limits how many active processes are allowed. There is generated and stored of a set of values corresponding to parameters for each process where the parameters are related to priority factors assigned to the associated process. There is calculated a prioritization score for each process based on the corresponding set of values. There is determined a first active process with the lowest priority based on the prioritization scores. The first active process is deactivated to reduce the memory pressure condition.

Abstract: In an embodiment of the invention, an apparatus and method for a target thread selection in a multi-threaded process perform the steps of receiving a signal that may or may not be masked by threads in the process; and searching a thread subset for a target thread that can handle the signal. A signal daemon may search for the target thread if the target thread is not found in the thread subset.

Abstract: An embodiment of the invention provides a concrete data type and a method for providing a cached chunked list concrete data type. The method can perform steps including: storing at least one datum in a chunk in a cache line; and setting a lower bit value (LB) in a link/space pointer in the chunk to indicate the empty slots in the chunk.

Abstract: A method of allocating memory and a memory allocation apparatus are described. The method comprises allocating a set of memory locations for at least a portion of a data structure, wherein the allocated set comprises memory space storing a counter corresponding to each memory location in the set. A method of traversing a data structure is described. The method comprises incrementing, by a predetermined value, a reference address of a pointer to a first data structure of a portion of a set of allocated memory locations to obtain a reference address to a second data structure in the portion of the set. The portion of the set of allocated memory locations comprises a counter for each allocated memory location.

Abstract: An embodiment of the invention provides a concrete data type and a method for providing a cached chunked list concrete data type. The method can perform steps including: storing at least one datum in a chunk in a cache line; and setting a lower bit value (LB) in a link/space pointer in the chunk to indicate the empty slots in the chunk.

Abstract: A method of handling a signal for delivery to a process in a process group along with an apparatus and computer-readable medium storing instructions therefore are described. The method comprises obtaining a lock on a portion of a process group management structure and storing a signal to the process group management structure, wherein the signal is to be delivered to one or more processes of a process group, wherein an operating system manages the process group management structure. The method further comprises transmitting a wakeup signal to a signal daemon and releasing the obtained lock. A method of delivering a signal to a process in a process group is also described. The method comprises obtaining a signal from a process group management structure, obtaining a lock on a process list, transmitting the signal to a process specified in the process list; and releasing the lock on the process list.

Abstract: In an embodiment of the invention, an apparatus and method for a target thread selection in a multi-threaded process perform the steps of receiving a signal that may or may not be masked by threads in the process; and searching a thread subset for a target thread that can handle the signal. A signal daemon may search for the target thread if the target thread is not found in the thread subset.

Abstract: It is determined that a memory pressure condition exists which limits how many active processes are allowed. There is generated and stored of a set of values corresponding to parameters for each process where the parameters are related to priority factors assigned to the associated process. There is calculated a prioritization score for each process based on the corresponding set of values. There is determined a first active process with the lowest priority based on the prioritization scores. The first active process is deactivated to reduce the memory pressure condition.

Abstract: It is determined that an amount of total memory utilized by active processes exceeds a memory pressure threshold. There is deactivated at least one active process occupying space in the total memory during a first system cycle based on said determination. There is deactivated a number N of active processes during succeeding system cycles while the memory pressure threshold is exceeded, where N increases at a non-linear rate during each system cycle until the total memory utilized by active processes does not exceed the memory pressure threshold.

Abstract: A computer-implemented method of testing a target system using a stimulus-response test. The method includes obtaining the responses of the target system at predefined monitoring times. Each time the response changes state, a clock is reset, and the elapsed duration is kept from the latest response state change. If the elapsed duration from the last response state change exceeds an expected duration before the next state change, a possible fault is deemed to exist.

Abstract: Systems, methods, and device are provided for process management. One method embodiment includes, in a system process, starting an orphan collector thread (OCT) which is dedicated to cleaning up orphaned children processes adopted by the system process. The orphaned children processes are flagged when adopted by the system process. The OCT will execute a function call to clean up only processes which are flagged as having been adopted by the system process and which have terminated.

Abstract: One embodiment disclosed relates to a method of deactivating a process by a computer operating system. Threads of the process that are currently suspendable are moved to a stopped state. A process-wide deactivation operation is initiated. The process-wide deactivation operation is called by outstanding threads of the process when the outstanding threads re-enter the operating system's kernel.