Abstract: A communication terminal has communication circuit, a processor and a storing module operable to store a plurality of application programs. The terminal includes comprising: a table that a plurality of timer times are registered, a notifying module operable to notify expiration when reaching at a timer time that is registered in the table, an executing module operable to execute at least two or more application programs when the expiration is notified by the notifying module, and an enabling module operable to enable the communication circuit when executing the application program by the executing module. Communication is performed by the at least two or more application programs while the communication circuit is being enabled.

Abstract: Data flow disruptions over a series of data processing operators can be detected by a computer system that generates a profile for data flow at an operator. The profile can include data input, processing, and output wait times. Using the profile, the system can detect potential flow disruptions. If the potential disruption satisfies a rule, it is considered a data flow disruption and a recommendation associated with the satisfied rule is identified. The recommendation and the operator identity is displayed.

Abstract: Systems and methods provide a processing task load and type adaptive manycore processor architecture, enabling flexible and efficient information processing. The architecture enables executing time variable sets of information processing tasks of differing types on their assigned processing cores of matching types. This involves: for successive core allocation periods (CAPs), selecting specific processing tasks for execution on the cores of the manycore processor for a next CAP based at least in part on core capacity demand expressions associated with the processing tasks hosted on the processor, assigning the selected tasks for execution at cores of the processor for the next CAP so as to maximize the number of processor cores whose assigned tasks for the present and next CAP are associated with same core type, and reconfiguring the cores so that a type of each core in said array matches a type of its assigned task on the next CAP.

Abstract: Embodiments of the present invention provide a method and a system for supporting resource isolation in a multi-core architecture. In the method and system for supporting resource isolation in a multi-core architecture provided by the embodiments of the present invention, manners of inter-core operating system isolation, memory segment isolation, and I/O resource isolation are adopted, so that operating systems that run on different processing cores of the multi-core processor can run independently without affecting each other. Therefore, the present invention fully uses the advantages high integration level and low comprehensive costs of the multi-core processor, it is achieved that a failure domain of the multi-core processor remains in a single hard disk, and the multi-core processor has high reliability.

Abstract: An asynchronous multiple-core processor may be adapted for carrying out sets of known tasks, such as the tasks in the LAPACK and BLAS packages. Conveniently, the known tasks may be handled by the asynchronous multiple-core processor in a manner that may be considered to be more power efficient than carrying out the same known tasks on a single-core processor. Indeed, some of the power savings are realized through the use of token-based single core processors. Use of such token-based single core processors may be considered to be power efficient due to the lack of a global clock tree.

Abstract: Approaches for selectively sharing cookies between virtual machines responsible for retrieving web content. A request to display a web page is received. The web page includes top-level content served by a top-level domain and secondary content served by one or more other domains. A determination that at least a portion of the web page should be retrieved from within a virtual machine is made. A policy is consulted to identify a set of cookies to inject into the virtual machine. The policy considers whether the virtual machine is responsible for retrieving one or more of top-level content and secondary content in identifying the set of cookies to inject into the virtual machine. After injecting the set of cookies into the virtual machine, the portion of the web page is retrieved from within the virtual machine.

Abstract: Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and underutilization of computing resources by monitoring and controlling the number of active worker threads. The number of active worker threads can be adapted to avoid underutilization of computing resources by giving the OS control of additional worker threads processing blocked application tasks. The task scheduler can dynamically determine a number of parallel operations for a particular task based on the number of available threads. The number of available worker threads can be determined based on the average availability of worker threads in the recent history of the application. Based on the number of available worker threads, the partitionable operation can be partitioned into a number of sub operations and executed in parallel.

Abstract: A mechanism is provided for bandwidth-efficient virtual machine image delivery. Responsive to a request to generate a virtual machine (VM) in a node using an existing virtual machine image (VMI) file, a set of file chunks that constitute the VMI file is identified. The set of file chunks are retrieved from within a set of distributed nodes by establishing an optimized plan for retrieving the set of file chunks in a bandwidth-efficient manner. Responsive to retrieving the set of file chunks from within the distributed nodes, the set of file chunks are reassembled into the VMI file for generation of the VM.

Abstract: Techniques are disclosed for qualified checkpointing of a data flow model having data flow operators and links connecting the data flow operators. A link of the data flow model is selected based on a set of checkpoint criteria. A checkpoint is generated for the selected link. The checkpoint is selected from different checkpoint types. The generated checkpoint is assigned to the selected link. The data flow model, having at least one link with no assigned checkpoint, is executed.

Abstract: Systems, methods and machine-readable mediums for batch process straight through modeling are provided. The systems may include a storage device and a processor. The storage device may store at least one batch process model. The processor may be programmed to display a graphical user interface for graphically defining the batch process model with at least one flowchart, and receive a selection of at least one activity step for inclusion in the at least one flowchart, each activity step corresponding to a predefined execution logic. The processor may be also programmed to determine the batch process model from the at least one activity step selected, and display the at least one activity step in the at least one flowchart.

Abstract: Techniques are disclosed for qualified checkpointing of a data flow model having data flow operators and links connecting the data flow operators. A link of the data flow model is selected based on a set of checkpoint criteria. A checkpoint is generated for the selected link. The checkpoint is selected from different checkpoint types. The generated checkpoint is assigned to the selected link. The data flow model, having at least one link with no assigned checkpoint, is executed.

Abstract: A method for automatically provisioning a virtual computing environment comprising a plurality of virtual computing nodes includes provisioning a virtual base node using base configuration information that includes a base endpoint that identifies interconnectivity parameters required to communicate with the virtual base node, and storing the base endpoint in an endpoint registry. The method further includes determining that a virtual first node depends on the virtual base node, and receiving the base endpoint from the endpoint registry. Thereafter, the virtual first node is provisioned using the received base endpoint and first configuration information for the virtual first node.

Abstract: A method for scheduling tasks from a program executed by a multi-processor core system is disclosed. The method includes a scheduler that groups a plurality of tasks, each having an assigned priority, by priority in a task group. The task group is assembled with other task groups having identical priorities in a task group queue. A hierarchy of task group queues is established based on priority levels of the assigned tasks. Task groups are assigned to one of a plurality of worker threads based on the hierarchy of task group queues. Each of the worker threads is associated with a processor in the multi-processor system. The tasks of the task groups are executed via the worker threads according to the order in the hierarchy.

Abstract: A thread (or other resource consumer) is compensated for contention for system resources in a computer system having at least one processor core, a last level cache (LLC), and a main memory. In one embodiment, at each descheduling event of the thread following an execution interval, an effective CPU time is determined. The execution interval is a period of time during which the thread is being executed on the central processing unit (CPU) between scheduling events. The effective CPU time is a portion of the execution interval that excludes delays caused by contention for microarchitectural resources, such as time spent repopulating lines from the LLC that were evicted by other threads. The thread may be compensated for microarchitectural contention by increasing its scheduling priority based on the effective CPU time.

Abstract: The present invention provides an information processing device that outputs a machine disposition plan for moving virtual machines while suppressing deterioration in user experience performance in a virtual-machine-type thin client system. The information processing device is provided with: a connection time determination unit that, for each first virtual machine, calculates a time slot coverage rate that is the fraction of a connection time slot covered by a high-load time slot, and determines as a second virtual machine a first virtual machine of which the time slot coverage rate exceeds a minimum coverage rate; and a disposition plan generating unit that, on the basis of time-series data of the amount of resource use of each second virtual machine, calculates the number of physical servers necessary to hold the second virtual machines in each of the high-load time slot and a low-load time slot, and associates the number to the virtual machines, outputting the result.

Abstract: Responsive to a hypervisor determining that insufficient local resources are available for reservation to meet a performance parameter for at least one resource specified in a reservation request for a particular logical partition managed by the hypervisor in a host system, the hypervisor identifies another logical partition managed by the hypervisor in the host system that is assigned at the least one resource meeting the performance parameter specified in the reservation request. The hypervisor estimates a first cost of migrating the particular logical partition and a second cost of migrating the another logical partition to at least one other host system communicatively connected in a peer-to-peer network based on at least one previously recorded cost stored by the host system of migrating a previous logical partition to the at least one other host system.

Abstract: An example method for adjusting the rate of transfer of the execution state of a virtual machine undergoing live migration may comprise determining, by a processor, a first rate being a rate of change of an execution state of a virtual machine undergoing live migration from a first computer system to a second computer system. The example method may further comprise determining a second rate being a rate of transfer of the execution state of the virtual machine to the second computer system. The example method may further comprise, responsive to determining that a ratio of the first rate to the second rate exceeds a first threshold ratio, suspending the transfer of the virtual machine execution state to the second computer system.

Abstract: Embodiments are directed towards managing the distribution of tasks in a storage system. An execution path for tasks may be generated based on the type of the task and characteristics of the storage system such that the execution path includes storage computers in a storage system. The tasks may be provided to each storage computer in the execution path. A working set of intermediate results may be generated on the storage computer in the execution path. If there is more than one storage computer in the execution path, working sets may be iteratively communicated to a next storage computer in the execution path such that the next storage computer employs a previously generated working set to generate a next working set until each storage computer in the execution path has been employed to generate a working set. The results may be stored on the storage computers.

Abstract: Methods and apparatus related to associating a task completion step with a task template based on one or more task completion steps of tasks that conform to the task template. A task template may include one or more terms, entities, and/or category of entities. A Task conforms to the task template when the task includes the one or more terms, entities, and/or an identifier of an entity that is a member of the entity category. In some implementations, a task that is associated with a task completion step is identified as conforming to the task template and the task completion step of the conforming task is associated with the task template. In some implementations, the task template may be utilized to associate a task completion step with a task that conforms to the task template.

Abstract: An initial request for a reference to a data container is sent to a distributed enhanced virtual machine native interface component of a distributed virtual machine in response to receiving an initial request from a remote execution container for the reference to the data container at a distributed enhanced remote execution container native interface component of the distributed virtual machine. A data mirror data structure including immutable data and the reference to the data container received from the distributed enhanced virtual machine native interface component is stored within a local memory storage area. A reference to the locally-stored data mirror data structure is returned to the remote execution container in response to the initial request for the reference to the data container.