Abstract: A computer system includes a plurality of multi-threaded processors, and a scheduler. The multi-threaded processors each have a set of hardware threads forming a pool of hardware threads. The scheduler allocates hardware threads of the pool of hardware threads to one or more guest operating systems based on priorities of the guest operating systems. The priorities of the guest operating systems are based on logical processors requested by the guest operating systems.

Abstract: Implementations of the present principles include Best-effort computing systems and methods. In accordance with various exemplary aspects of the present principles, a application computation requests directed to a processing platform may be intercepted and classified as either guaranteed computations or best-effort computations. Best-effort computations may be dropped to improve processing performance while minimally affecting the end result of application computations. In addition, interdependencies between best-effort computations may be relaxed to improve parallelism and processing speed while maintaining accuracy of computation results.

Abstract: The management computer creates a connection between a virtual computer and a logical volume of a storage apparatus based on the application management information that stores a connection relationship between an application program and an I/O adapter, before a server computer provided with a hypervisor that logically divides the computer resources that include a CPU, a memory, and an I/O adapter and that operates them as an independent virtual computer starts an application program that has been stored into the storage apparatus on the virtual computer.

Abstract: A server management apparatus for lowering migration costs during scale-in/scale-out and workload consolidation of a cluster system(s) to thereby reduce power consumption is disclosed. The apparatus manages a physical server group which renders operative a virtual server group thereon and, when putting into practice a cluster system including a plurality of virtual servers placed in the physical server group, manages the layout state of virtual servers pursuant to the load state of the virtual server group. When executing scale-in, a virtual server operating on a physical server with the minimum number of operative virtual servers is specified as a shutdown target. When executing scale-out, a workload variation is predicted to control a scale-out destination of cluster system so that load variation-resembled cluster systems gather on the same physical server. The scale-in execution timing is delayed if the predicted load variation tends to rise and accelerated if it falls.

Abstract: A computer implemented method, apparatus, and computer usable program code for sampling call stack information. An accumulated latency time is monitored for a set of threads executing in a data processing system. The call stack information is obtained for the thread in response to a thread in the set of threads having an associated accumulated latency exceeding a threshold.

Abstract: Systems and methods of adjusting allocated hardware resources to support a running software application are disclosed. A system includes adjustment logic to adjust an allocation of a first hardware resource to support a running software application. Measurement logic measures at least one hardware resource metric associated with the first hardware resource. Service level logic calculates an application service level based on the measured at least one hardware resource metric. When the first application service level satisfies a threshold application service level, the allocation of the first hardware resource is iteratively reduced to reach a reduced allocation level where the application service level does not satisfy the threshold application service level. In response thereto, the allocation of the first hardware resource is increased by an increment, such that the application service level again satisfies the threshold application service level.

Abstract: An information processing apparatus includes a control operating system executing a process for allocating a plurality of logical processors to a physical processor in a time division manner, and a guest operating system for which a logical partition as an application entity of the logical processor is set. The control operating system sets and updates, as address conversion tables for determining an allocation relationship between the logical processor and the physical processor, two address conversion tables of a first conversion table that sets an allocation relationship between a logical partition address space and a physical address space and a second conversion table that sets an allocation relationship between a virtual address space in the guest operating system and the physical address space.

Abstract: Resource management system is provided, implemented between a service bundle developer and provider and a service bundle user. A resource requirement determining device determines a system resource requirement for a service bundle provided by the service bundle developer and provider, and generates resource requirement information corresponding to the service bundle. A processor receives information of system resource utilization status from the service bundle user, determines whether available resource of the service bundle user is sufficient for the resource requirement of the service bundle, when the available resource of the service bundle user is insufficient, the processor generates a waiting queue, and adds the service bundle into the waiting queue. When available resource of the service bundle user is sufficient, the processor installs the service bundle specified in the waiting queue in the service user. A storage device stores the waiting queue and corresponding resource requirement information.

Abstract: Techniques for scheduling a task include receiving task data and quorum data. Task data describes tasks to be performed by one or more participants. Quorum data indicates a participant set of one or more participants to perform each task. Current user data may also be received. Current user data describes a current task set of one or more tasks currently being performed by a particular participant. Either or both of the task data and the current user data describe interruptibility through a particular medium of a plurality of communications media. A particular time interval to schedule a particular task is determined based at least in part on the interruptibility of the task or the particular participant. These techniques allow either or both unscheduled tasks and previously scheduled tasks to be moved to time intervals that overlap other scheduled tasks, including tasks currently being performed by a participant.

Abstract: A communication apparatus used in a network where data communication is performed includes a priority data information holding section that holds, in advance, QoS setting information corresponding to domain names, where the QoS setting information is necessary to perform QoS settings for data communicated in the network. A control packet snooping section snoops on a DNS packet received from a DNS server, and obtains a domain name contained in the DNS packet. A priority control setting section, when QoS setting information corresponding to the obtained domain name is contained in the QoS setting information held in the priority data information holding section, performs, based on the QoS setting information, a QoS setting for data communication performed by a communication apparatus which is the transmission source of the DNS packet.

Abstract: A method and apparatus are disclosed for determining the best cluster of computing resources to handle each of a plurality of workloads by optimally grouping multiple workloads and determining the best resource cluster to handle each group.

Abstract: A virtualized computer platform is established and maintained by virtualization software on one or more physical computers. A multicomponent software application may execute on the virtualized computer platform, with different components of the application executing in different virtual machines, which are supported by the virtualization software. The virtualization software may also provide, and/or facilitate the provision of, one or more services that may be beneficial to the operation of the multicomponent software application, such as automated provisioning, resource allocation, VM distribution, performance monitoring, resource management, high availability, backup, disaster recovery, alarms, security, etc. In some embodiments of the invention, some of these services are provided through coordinated efforts of a system resource manager, a VM manager, an application monitor and an application resource manager.

Abstract: Under the present invention, when an application is deployed, certain information corresponding thereto will be stored in an Enterprise Application Directory (EAD). Thereafter, when an instance of the application is requested (e.g., by a requestor), the information is retrieved from the EAD. In addition, the instance is registered with an Application Access Registry (AAR). Registering the instance involves creating a record in the AAR, generating a unique application access key for the instance, and storing the access key with the information in the record. The access key (and optionally the information) is then returned to the requestor, which can then issue service requests to one or more grid services in the shared computer infrastructure. The service request will include the access key so that the grid service can identify the application by searching for the record in the registry using the access key.

Abstract: Embodiments of the invention comprise a method for dynamically switching a serialization method of a data structure. If use of the serialization mechanism is desired, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is in use, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is not in use, an instruction to access the data structure without obtaining the serialization mechanism is received.

Abstract: A method, a system and a computer program of reducing overheads in multiple applications processing are disclosed. The method includes identifying resources interacting with each of the applications from a set of applications and grouping the applications from the set of applications, resulting in at least one application cluster, in response to the identified resources, wherein overheads associated with re-initialization of agents assigned to the identified resources are reduced. The method further includes assigning an agent corresponding to each of the identified resources and initializing the agent corresponding to each of the identified resources. The method further includes identifying parameters associated with the identified resources, pre-processing the identified parameters for each of the identified resources, and also includes selecting a clustering means for the clustering.

Abstract: Running of a root instance of an application is started. The root instance includes at least one thread. In response to determining that a thread of the root instance runs to a preset freezing point in the application, running of all threads of the root instance is stopped. In response to starting to run an additional instance of the application, a running state of all threads of the root instance is replicated as a running state of all threads of the additional instance of the application. Running all threads of the additional instance of the application is continued.

Abstract: Embodiments of the invention comprise a method for dynamically switching a serialization method of a data structure. If use of the serialization mechanism is desired, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is in use, an instruction to obtain the serialization mechanism is received. If use of the serialization mechanism is not desired and if the serialization mechanism is not in use, an instruction to access the data structure without obtaining the serialization mechanism is received.

Abstract: Method, system, and computer program product for managing parallel data processing jobs in grid environments are provided. A request to deploy a parallel data processing job in a grid environment is received. A plurality of resource nodes in the grid environment are dynamically allocated to the parallel data processing job. A configuration file is automatically generated for the parallel data processing job based on the allocated resource nodes. The parallel data processing job is then executed in the grid environment using the generated configuration file.

Abstract: A system and method for enabling automated task preemption, including a plurality of multifunctional devices having a plurality of functional capabilities; and a processing module configured to: (i) separate the tasks requiring the plurality of functional capabilities into the tasks requiring a first category of capabilities and the tasks requiring a second category of capabilities, where the tasks requiring the first category of capabilities has a higher processing priority than the tasks requiring the second category of capabilities; and (ii) selectively process the tasks requiring the first category of capabilities before the tasks requiring the second category of capabilities regardless of arrival times of the tasks requiring the plurality of capabilities; wherein the tasks requiring the second category of capabilities that are preempted by the tasks requiring the first category of capabilities are rescheduled to be completed within a predetermined time period of completion.

Abstract: Methods, media and systems for managing a distributed application running in a plurality of digital processing devices are provided. In some embodiments, a method includes running one or more processes associated with the distributed application in virtualized operating system environments on a plurality of digital processing devices, suspending the one or more processes, and saving network state information relating to network connections among the one or more processes. The method further include storing process information relating to the one or more processes, recreating the network connections using the saved network state information, and restarting the one or more processes using the stored process information.

Abstract: Exemplary embodiments include a system and storage medium for managing computer processing functions in a multi-processor computer environment. The system includes a physical processor, a standard logical processor, an assist logical processor sharing a same logical partition as the standard logical processor, and a single operating system instance associated with the logical partition, the single operating system instance including a switch-to service and a switch-from service. The system also includes a dispatch component managed by the single operating system instance. Upon invoking the switch-to service by standard code, the switch-to service checks to see if an assist logical processor is online and, if so, it updates an integrated assist field of a work element block associated with the task for indicating the task is eligible to be executed on the assist logical processor. The switch-to service also assigns a work queue to the work element block.

Abstract: The device of the present invention manages changes in the construction of a storage system in a unified manner, and optimally disposes resources. The servers are logically divided into a plurality of virtual servers, the switches are logically divided into a plurality of zones, and the storage devices are logically divided into a plurality of virtual storage devices. The respective logical devices are respectively managed by respective managing parts. These respective managing parts are connected to a managing device via a network used for management. The managing device re-disposes resources in application program units on the basis of the load states of the respective resources in the storage system.

Abstract: Methods, systems, and products are disclosed for executing a distributed Java application on a plurality of compute nodes. The Java application includes a plurality of jobs distributed among the plurality of compute nodes. The plurality of compute nodes are connected together for data communications through a data communication network. Each of the plurality of compute nodes has installed upon it a Java Virtual Machine (‘JVM’) capable of supporting at least one job of the Java application. Executing a distributed Java application on a plurality of compute nodes includes: tracking, by an application manager, a just-in-time (‘JIT’) compilation history for the JVMs installed on the plurality of compute nodes; and configuring, by the application manager, the plurality of jobs for execution on the plurality of compute nodes in dependence upon the JIT compilation history for the JVMs installed on the plurality of compute nodes.

Abstract: Disclosed are systems, methods, computer readable media, and compute environments for establishing a schedule for processing a job in a distributed compute environment. The method embodiment comprises converting a topology of a compute environment to a plurality of endpoint-to-endpoint paths, based on the plurality of endpoint-to-endpoint paths, mapping each replica resource of a plurality of resources to one or more endpoints where each respective resource is available, iteratively identifying schedule costs associated with a relationship between endpoints and resources, and committing a selected schedule cost from the identified schedule costs for processing a job in the compute environment.

Abstract: A system and method for managing responsiveness of virtual desktops using passive monitoring includes measuring a time between an interactive desktop event and a result of the interactive desktop event. Based on the time, system resources are reallocated to improve the responsiveness.

Abstract: A method is provided for a first logical processor to determine a running status of a target logical processor of an information processing system. In such method, an instruction is issued by the first logical processor running on the information processing system for determining whether the target logical processor is running. In response to issuing the instruction, a state descriptor belonging to the target logical processor is queried to determine whether the target logical processor is currently running. A result is then returned to the first logical processor, the result indicating whether or not the target logical processor is currently running.

Abstract: A method, device, and system are disclosed. In one embodiment the method includes scheduling a thread to run on first core of a multi-core processor. The determination as to which core the thread is scheduled on uses one or more processes. These processes may include ranking all of the cores specific to a workload of the thread, establishing a current utilization of each core of the multi-core processor, and calculating an inter-core migration cost for the thread.

Abstract: A system, method and non-transitory computer readable storage medium are disclosed for managing workload in a data center. The method includes receiving, at a workload manager, energy consumption information associated with at least one of a first data center and a second data center that is geographically distanced from the first data center. The method further includes receiving workload information associated with at least one of the first data center and the second data center, and transmitting, as controlled by the workload manager, at least part of workload scheduled to be processed at the second data center to the first data center based on at least one of the energy consumption information and the workload information.

Abstract: Methods, systems, and computer program products for managing a resource include using a first object to obtain data associated with the resource that is being managed. The first object may be embedded in a cell of a spreadsheet running on a spreadsheet application. Formula in the spreadsheet are executed, where at least some of the formulas reference at least some of the data obtained by the first object. The operation of the resource may then be altered based on the results of the executed formula.

Abstract: Virtual machines are provisioned computers in a computer environment based on input/output (I/O) requirements of software tasks. A workload request, requesting the execution of a software task on a virtual machine, is received. The I/O requirements of the software task are matched to an optimal computer, in the computer environment, that has an I/O bandwidth capability that best matches the I/O requirements of the software task. The software task is then routed to a virtual machine, on the optimal computer, for execution of the software task.

Abstract: A method and an apparatus that allocate one or more physical compute devices such as CPUs or GPUs attached to a host processing unit running an application for executing one or more threads of the application are described. The allocation may be based on data representing a processing capability requirement from the application for executing an executable in the one or more threads. A compute device identifier may be associated with the allocated physical compute devices to schedule and execute the executable in the one or more threads concurrently in one or more of the allocated physical compute devices concurrently.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, relating to managing resources. In one aspect, a method includes the actions of receiving configuration information, the configuration information specifying a plurality of parameter values including values for a size and input/output performance parameters, where the size and performance parameters are independently specified by a user; determining one or more physical resources that satisfy the received configuration information; and generating one or more virtual disk instances having the specified size and performance parameters.

Abstract: A method and data processing system for tracking global shared memory (GSM) operations to and from a local node configured with a host fabric interface (HFI) coupled to a network fabric. During task/job initialization, the system OS assigns HFI window(s) to handle the GSM packet generation and GSM packet receipt and processing for each local task. HFI processing logic automatically tags each GSM packet generated by the HFI window with a global job identifier (ID) of the job to which the local task is affiliated. The job ID is embedded within each GSM packet placed on the network fabric. On receipt of a GSM packet from the network fabric, the HFI logic retrieves the embedded job ID and compares the embedded job ID with the ID within the HFI window(s). GSM packets are forwarded to an HFI window only when the embedded job ID matches the HFI window's job ID.

Abstract: Exemplary embodiments include a system and storage medium for managing computer processing functions in a multi-processor computer environment. The system includes a physical processor, a standard logical processor, an assist logical processor sharing a same logical partition as the standard logical processor, and a single operating system instance associated with the logical partition, the single operating system instance including a switch-to service and a switch-from service. The system also includes a dispatch component managed by the single operating system instance. Upon invoking the switch-to service by standard code, the switch-to service checks to see if an assist logical processor is online and, if so, it updates an integrated assist field of a work element block associated with the task for indicating the task is eligible to be executed on the assist logical processor. The switch-to service also assigns a work queue to the work element block.

Abstract: A system and method of managing resources of an electronic device are described. A solver of the electronic device may receive one or more resource requirements from one or more resource requesters executing on the electronic device. The solver determines a values for resource characteristic based on the received resource requirements and dependency information defining hierarchical dependency between resource characteristic values associated with resources of the electronic device. The determined values of the resource characteristics are then provided to the associated resources of the electronic device.

Abstract: Some embodiments provide a method for distributing an operation for processing by a set of background services. The method automatically determines a number of background services for performing an operation. The method partitions the operation into several sub-operations. The method distributes the several sub-operations across the determined number of background services.

Abstract: There is disclosed a solution for obtaining Memory Access Performance metrics in an electronic system comprising a Data Processing Unit, DPU and a synchronous memory device external to the DPU and coupled to the DPU through a memory bus. There is used mixed software and hardware dedicated resources, wherein at least a hardware part of the dedicated resources is comprised in the memory device.

Abstract: A method to match an autonomic manager with a manageable resource may include using a management style profile to match the autonomic manager with the manageable resource. The method may also include validating that the autonomic manager can manage the manageable resource using a defined management style of the autonomic manager.

Abstract: A partitioned ticket lock may control access to a shared resource, and may include a single ticket value field and multiple grant value fields. Each grant value may be the sole occupant of a respective cache line, an event count or sequencer instance, or a sub-lock. The number of grant values may be configurable and/or adaptable during runtime. To acquire the lock, a thread may obtain a value from the ticket value field using a fetch-and-increment type operation, and generate an identifier of a particular grant value field by applying a mathematical or logical function to the obtained ticket value. The thread may be granted the lock when the value of that grant value field matches the obtained ticket value. Releasing the lock may include computing a new ticket value, generating an identifier of another grant value field, and storing the new ticket value in the other grant value field.

Abstract: A mechanism is provided for rescheduling jobs for execution by a computing system. The computing system receives job related data associated with a plurality of jobs to be executed by the computing system, time constraint data, and maximum time shift values associated with the time constraint data. The computing system determines that a start time for execution of a first job of the plurality of jobs should be rescheduled. The computing system receives workload statistics. The computing system determines based on the workload statistics, a first start time for the first job. The computing system compares the time constraint data with the first start time to determine if the first start time is in conflict with the time constraint data. The computing system stores the first start time.

Abstract: The invention relates to systems, methods and computer-readable media for using system jobs for performing actions outside the constraints of batch compute jobs submitted to a compute environment such as a cluster or a grid. The method for modifying a compute environment from a system job comprises associating a system job to a queuable object, triggering the system job based on an event and performing arbitrary actions on resources outside of compute nodes in the compute environment. The queuable objects include objects such as batch compute jobs or job reservations. The events that trigger the system job may be time driven, such as ten minutes prior to completion of the batch compute job, or dependent on other actions associated with other system jobs. The system jobs may be utilized also to perform rolling maintenance on a node by node basis.

Abstract: The present invention is a system for and method of initializing multiple virtual processors in a virtual machine (VM) environment. The method of initializing multiple virtual processors includes the steps of the host creating a multiple processor VM and activating a “starter virtual processor,” the “starter virtual processor” issuing a startup command to a next virtual processor, the virtual machine monitor (VMM) giving the target virtual processor the highest priority for accessing the hardware resources, the VMM forcing the “starter virtual processor” to relinquish control of the hardware resources, the VMM handing control of the hardware resources to the target virtual processor, the target virtual processor executing and completing its startup routine, the VMM forcing the target virtual processor to relinquish control of the hardware resources, and the VMM handing control of the hardware resources back to the “starter virtual processor” for activating subsequent virtual processors.

Abstract: An apparatus detects detecting when an extraordinary behavior is performed when a monitoring task is executed on an information processing apparatus. The detecting apparatus includes: an obtaining section for obtaining a measurement data including an executing timing and an execution time for each occasion of execution when the monitoring task is executed for a number of times on the information processing apparatus; a distance calculating section for calculating a distance between a measured point corresponding to each measurement data in a multi-dimensional space on which an executing timing and an execution time are allocated to different coordinates and another measured point placed in a predetermined range; and a determining section for determining whether an extraordinary behavior is performed when the monitoring task corresponding to the measurement data is executed based on the distance obtained for the measured point corresponding to the measurement data.

Abstract: A method of balancing a load in a computer system having at least one storage system, and a management computer, each of the storage systems having physical disks and a disk controller, the load balancing method including the steps of: setting at least one of the physical disks as a parity group; providing a storage area of the set parity group as at least one logical volumes to the host computer; calculating a logical volume migration time when a utilization ratio of the parity group becomes equal to or larger than a threshold; and choosing, as a data migration source volume, one of the logical volumes included in the parity group that has the utilization ratio equal to or larger than the threshold, by referring to the calculated logical volume migration time, the data migration source volume being the logical volume from which data migrates.

Abstract: Active and/or proactive semaphore mechanisms and thread synchronization techniques can be applied to various visual and graphical processing techniques.

Abstract: A system, method and computer readable medium are disclosed for reducing power consumption in clusters, grids, on-demand centers, and so forth. The principles disclosed herein can reduce both direct and indirect power consumption while maintaining either full cluster performance or adequate SLA based cluster performance. The method includes receiving at least one state data point regarding power consumption or temperature of at least one resource within the compute environment. Using intelligent policies to control power consumption, the method implements and interfaces with power managements facilities within the cluster, grid or on-demand center to either implement policies, make dynamic changes, make predictions or actions, and so forth to reduce one or more of the direct or indirect power consumption associated with a compute environment. The method can analyze current workload, future workload or both in taking energy saving actions in the environment.

Abstract: The invention provides an embedded processor architecture comprising a plurality of virtual processing units that each execute processes or threads (collectively, “threads”). One or more execution units, which are shared by the processing units, execute instructions from the threads. An event delivery mechanism delivers events—such as, by way of non-limiting example, hardware interrupts, software-initiated signaling events (“software events”) and memory events—to respective threads without execution of instructions. Each event can, per aspects of the invention, be processed by the respective thread without execution of instructions outside that thread. The threads need not be constrained to execute on the same respective processing units during the lives of those threads—though, in some embodiments, they can be so constrained. The execution units execute instructions from the threads without needing to know what threads those instructions are from.

Abstract: A method, and a corresponding system, for managing under-utilized resources in a computer system includes the steps of monitoring performance of workloads executing on the computer system, where the workloads consume resources, determining resource demand and utilization by the workloads, comparing the workload performance to user-defined performance targets and resource utilization by the workloads to user-defined utilization targets, using the comparison results, determining if one or more resources may be assigned to a free resource pool, and assigning the determined resources to the free resource pool.

Abstract: Techniques are described for facilitating access of users to tasks that are available to be performed, such as via a task exchange system that serves as an intermediary to facilitate performance by some task performer users of tasks supplied by other task requester users. The techniques may include automatically providing a particular group of task performer users with access to a supply of available tasks that are appropriate for those task performer users, such as based on an aggregate probability or other likelihood measure that the task performer users as a group will collectively accept to perform those tasks in a specified manner. More generally, the affinity and/or appropriateness of a group of users to perform one or more tasks may be based on various information related to the users, including past task performance behavior of those users, and/or qualifications or more general reputational aspects of those users.

Abstract: What is disclosed is a wireless communication device comprising a processing system and a user interface system. The processing system identifies a software update that requires a reboot of the wireless communication device. In response, the processing system determines a geographic location of the wireless communication device, initiates a user interface for emergency calls during the reboot of the wireless communication device, and reboots the wireless communication device. The user interface system presents the user interface for emergency calls during the reboot of the wireless communication device.