Abstract: A super operating system for a heterogeneous computer system for executing tasks of software that has at least one performance processor, a processor supporting logic, and a hypervisor processor. The super operating system has a performance operating system for the performance processor; a hypervisor operating system for the hypervisor processor and a heterogeneous hypervisor software layer on top of the performance and hypervisor processors and below the performance and hypervisor operating systems. Under the super operating system, the hypervisor processor executes tasks that the hypervisor processor has sufficient processing power to handle and puts the performance processor to a power-conserving state. The hypervisor processor brings the performance processor out of power-conserving state to execute tasks that the hypervisor processor has insufficient processing power to handle. The performance and hypervisor processors simultaneously execute tasks that require combined processing power of all processors.

Abstract: An information processing terminal is provided with a data acquiring means for reading data from an external recording medium; a program storing means for storing a plurality of application programs; a program executing means for executing the stored application programs; and a program selecting means for selecting the application program to be executed by the program executing means. The program selecting means selects the application program to be executed from the programs stored in the program storing means, corresponding to the data acquired through the data acquiring means, and processes the data acquired through the data acquiring means by the application program selected by the program selecting means.

Abstract: Systems and methods are disclosed for coordinating resource usage between applications in a tightly sandbox environment. A scheduling indicator can be left in a system file that multiple applications can use to align their requests for a system resource. Alternatively, IP loopback can be used to pass a scheduling indicator between applications that are otherwise sandboxed. If either of these approaches is not possible, then applications can schedule system resource requests using a common algorithm that selects a start time and optionally a period of subsequent system resource requests based on a common piece of information such as a system clock signal or IP address. In these ways the total amount of time during which the system resource is being utilized by various applications can be reduced, thus reducing power consumption, and network activity.

Abstract: The method may include collecting performance data relating to processing nodes of a computer system which provide services via one or more applications, analyzing the performance data to generate an operational profile characterizing resource usage of the processing nodes, receiving a set of attributes characterizing expected performance goals in which the services are expected to be provided, and generating at least one provisioning policy based on an analysis of the operational profile in conjunction with the set of attributes. The at least one provisioning policy may specify a condition for re-allocating resources associated with at least one processing node in a manner that satisfies the performance goals of the set of attributes. The method may further include re-allocating, during runtime, the resources associated with the at least one processing node when the condition of the at least one provisioning policy is determined as satisfied.

Abstract: A computing device receives a command to start a virtual machine, the virtual machine having a read-only layer and a copy-on-write (COW) layer. The computing device accesses the COW layer of the virtual machine from a network storage. The computing device determines whether the read-only layer of the virtual machine is cached in a local storage. Upon determining that the read-only layer of the virtual machine is cached in the local storage, the computing device starts the virtual machine based on a combination of the downloaded COW layer and the cached read-only layer of the virtual machine.

Abstract: A portable computing system can include a first virtue machine. The portable computing system can connect to a computing system. The computing system can access the virtual machine on the portable computing system.

Abstract: Method and system are provided for managing components of a storage operating environment having a plurality of virtual machines that can access a storage device managed by a storage system. The virtual machines are executed by a host platform that also executes a processor-executable host services module that interfaces with at least a processor-executable plug-in module for providing information regarding the virtual machines and assists in storage related services, for example, replicating the virtual machines.

Abstract: A information processing apparatus having a processor is controlled to execute a procedure of reading from the memory attribute information indicating a usage frequency of a register used by a process to be executed as a next process by the processor when the processor switches a process currently being executed, saving a value of the register used by the next process to be executed by the processor to the memory when the usage frequency of the register indicated by the attribute information is larger than a certain frequency, reading from the memory owner information indicating a process using the register to be used by the next process when the usage frequency of the register indicated by the attribute information is larger than the certain frequency, and restoring a register value saved in the memory to the register when the owner information indicates a process other than the next process.

Abstract: A plurality of array partitions are defined for use by a set of tasks of the program run-time. The array partitions can be determined from one or more arrays that are utilized by the program at run-time. Each of the plurality of computing devices are assigned to perform one or more tasks in the set of tasks. By assigning each of the plurality of computing devices to perform one or more tasks, an objective to reduce data transfer amongst the plurality of computing devices can be implemented.

Abstract: Provided is a task processing apparatus and method that may select a task corresponding to predetermined task selection information when a task execution is completed and thus, an idle server occurs in at least one server, may separate the selected task into a first task and a second task, and may control the first task and the second task to be allocated to an existing allocation server of the selected task and an idle server, respectively.

Abstract: A scheduling method, medium and apparatus are provided. In the scheduling method, medium and apparatus, it is possible to prevent the possibility that the order between the priorities of the tasks represented by the expired timers and the tasks requested by the interrupt is reversed while also not deteriorating the performance of a real time operating system (RTOS), even though the number of timers expired when the interrupt occurs or that are already expired before the interrupt occurs is large, by selecting a timer for representing a point of time corresponding to a point of time when an interrupt occurs from among one or more timers each of which representing a task, a point of time assigned to the tasks, and a priority assigned to the task and executing a task represented by the selected timer and one or more tasks requested by the interrupt in order of priority.

Abstract: The present disclosure includes methods and systems for providing virtual machine services. A number of embodiments can include a user VM with a virtual workstation, a number of service modules that can provide a number of services without communicating with the user VM and/or the virtual workstation, a communication channel that allows the number of service modules to communicate with each other, a computing device, and a manager. A number of embodiments can also include a virtual machine monitor to enforce an isolation policy within the system.

Abstract: Embodiments described herein are directed to dynamically controlling the number of spins for a selected processing thread among a plurality of processing threads. A computer system tracks both the number of waiting processing threads and each thread's turn, wherein a selected thread's turn comprises the total number of waiting processing threads after the selected thread's arrival at the processor. Next, the computer system determines, based on the selected thread's turn, the number of spins that are to occur before the selected thread checks for an available thread lock. The computer system also, based on the selected thread's turn, changes the number of spins, such that the number of spins for the selected thread is a function of the number of waiting processing threads and processors in the computer system.

Abstract: An apparatus for executing components based on a thread pool includes a component executor configured to have a set priority and period, to register components having the set priority and period, and to execute the registered components. Further, the apparatus for executing the components based on the thread pool includes a thread pool configured to allocate a thread for executing the component executor; and an Operating System (OS) configured to create an event for allocating the thread to the component executor in each set period.

Abstract: A multi-layer architecture is provided for elastic provisioning of virtualized computing resources. The multi-layer architecture comprises a physical hardware layer comprising a plurality of physical computing machines, a distributed operating system layer that aggregates and virtualizes the computing resources, and a virtual machine layer that comprises virtual machines provisioned, by the distributed operating system layer, with virtualized computing resources. Elastic provisioning of virtualized computing resources comprising receiving computing resource information of a plurality of physical computing machines, producing virtualized computing resources by aggregating the received computing resource information of the plurality of physical computing machines, and provisioning the virtualized computing resources among a plurality of virtual machines.

Abstract: A distributed job-processing environment including a server, or servers, capable of receiving and processing user-submitted job queries for data sets on backend storage servers. The server identifies computational tasks to be completed on the job as well as a time frame to complete some of the computational tasks. Computational tasks may include, without limitation, preprocessing, parsing, importing, verifying dependencies, retrieving relevant metadata, checking syntax and semantics, optimizing, compiling, and running. The server performs the computational tasks, and once the time frame expires, a message is transmitted to the user indicating which tasks have been completed. The rest of the computational tasks are subsequently performed, and eventually, job results are transmitted to the user.

Abstract: The present invention relates to a task scheduling method for a real time operating system (RTOS) mounted to an embedded system, and more particularly, to a task scheduling method which allows a programmer to make a CPU reservation for a task. The task scheduling method for a real time operating system, includes: at a scheduling time point, determining whether or not a highest priority of tasks present in a ready queue is a predetermined value K; if the highest priority is determined to be K, applying a reservation based scheduler to perform a scheduling; and if the highest priority is determined not to be K, applying a priority based scheduler to perform a scheduling; the tasks present in the ready queue, the priority of which is K, contains idle CPU reservation allocation information received as a factor when the tasks the priority of which is K are created.

Abstract: Methods and arrangements for emulating a data center network. A first end host and a second end host are provided. A base hypervisor is associated with each of the first and second end hosts, and the first and second end hosts are interconnected. A virtual hypervisor is associated with at least one virtual machine running on at least one of the base hypervisors, and virtual hypervisors are interconnected within one of the first and second end hosts. A virtual machine is nested within the virtual hypervisor, and the virtual machine is migrated from one virtual hypervisor to a destination virtual hypervisor to further be nested within the destination virtual hypervisor.

Abstract: Topology input is used to identify a set of data flows as between a set of virtual machines (VMs), as well as one or more network services for one or more of the data flows. A determination is made as to a minimal number of network service virtual machines (NSVMs) for use in providing the one or more network services. An arrangement is determined for server resources and network resources of the data center network on which a virtual network topology is provided for the tenant, including the set of VMs and the number of NSVMs.

Abstract: Embodiments of the present invention manage workloads in a high-throughput computing environment for a hybrid processing system. A set of high-throughput computing service level agreements (SLAs) is retrieved. The set of SLAs is associated with a hybrid processing system including a server system and a set of accelerator systems, where each system has a different architecture. A first set of data-parallel workload tasks scheduled on the server system and a second set of data-parallel workload tasks scheduled with the set of accelerator systems are identified. At least a portion of one of the first set of data-parallel workload tasks and the second set of data-parallel workload tasks is dynamically rescheduled on a second one of the server system and the set of accelerator systems. The dynamically rescheduling substantially satisfies the set of high-throughput computing SLAs.