Abstract: A method for an acquisition of a semaphore for a thread includes decrementing a semaphore count, storing a current thread context of the semaphore when the semaphore count is less than a first predetermined value, determining a release count of a pending queue associated with the semaphore where the pending queue indicates unpended threads of the semaphore, and adding the thread to the pending queue when the release count is less than a second predetermined value.

Abstract: The present disclosure discloses methods and systems for managing one or more recurrencies. The method includes defining one or more recurrency tasks, each task having associated recurrency parameters. The method further includes identifying a recurrency period wherein the one or more recurrency tasks are disaggregated into individual scheduled events over the span of the recurrency period. Thereafter, a user-defined exclusionary schedule is applied to the disaggregated set of events. Subsequently, the edited recurrent tasks are output in a pre-defined file format.

Abstract: The described implementations relate to distributed computing. One implementation provides a system that can include an outlier detection component that is configured to identify an outlier task from a plurality of tasks based on runtimes of the plurality of tasks. The system can also include a cause evaluation component that is configured to evaluate a cause of the outlier task. For example, the cause of the outlier task can be an amount of data processed by the outlier task, contention for resources used to execute the outlier task, or a communication link with congested bandwidth that is used by the outlier task to input or output data. The system can also include one or more processing devices configured to execute one or more of the components.

Abstract: A processor core includes a transactional memory, a transaction failure instruction address register (TFIAR), and a transaction failure data address register (TFDAR). The transactional memory stores information of a plurality of transactions executed by the processor core. The processor core retrieves instruction and data address associated with the aborted transaction from TFIAR and TFDAR respectively and stores them into a profiling table. The processor core then generates profiling information based on instruction and data addresses associated with the aborted transaction.

Abstract: A method for recording and profiling information of a plurality of aborted transactions from a plurality of transactions is executed by processor core with a transactional memory, a transaction failure instruction address register (TFIAR), and a transaction failure data address register (TFDAR). The transactional memory stores information of a plurality of transactions executed by the processor core. The processor core retrieves instruction and data address associated with the aborted transaction from TFIAR and TFDAR respectively and stores them into a profiling table. The processor core then generates profiling information based on instruction and data addresses associated with the aborted transaction.

Abstract: Methods, apparatuses, and computer-readable storage media are disclosed for reducing power by reducing hardware-thread toggling in a multi-processor. In a particular embodiment, a method is disclosed that includes collecting data from a plurality of software threads being processed by a processor, where the data for each of the events includes a value of an associated clock cycle counter upon occurrence of the event. Data is correlated for the events occurring for each of the plurality of threads by starting each of a plurality of clock cycle counters associated with the software threads at a common time. Alternatively, data is correlated for the events by logging a synchronizing event within each of the plurality of software threads.

Abstract: A management machine according to an exemplary aspect of the invention includes a receiver that receives, from a first server, server information on the first server and AP information on a plurality of applications located in the first server, and a selector that selects a candidate application from the plurality of applications for each of a plurality of algorisms referring to the AP information and the server information, and that performs a relocation of one of the candidate applications from the first server to a second server.

Abstract: One or more processors and/or one or more circuits may be operable to configure one or more virtual machines and a hypervisor for controlling the one or more virtual machines. The virtual machines and the hypervisor may be distributed across a plurality of network devices. A sub-hypervisor may be configured within each of the virtual machines utilizing the hypervisor. Load information of the network devices may be communicated to the hypervisor utilizing the sub-hypervisors. The virtual machines may include threads, may be load balanced utilizing the hypervisor, dynamically configured utilizing the hypervisor based on changes in the network devices, and scaled by the distribution of the virtual machines across the network devices. Information from the processing of data may be received in the virtual machines. The network devices may include a plurality of: servers, switches, routers, racks, blades, mainframes, personal data assistants, smart phones, desktop computers, and/or laptop devices.

Abstract: A method and apparatus for speculatively executing a single threaded program within a multi-core processor which includes identifying an idle core within the multi-core processor, performing a look ahead operation on the single thread instructions to identify speculative instructions within the single thread instructions, and allocating the idle core to execute the speculative instructions.

Abstract: A method and apparatus for speculatively executing a single threaded program within a multi-core processor which includes identifying an idle core within the multi-core processor, performing a look ahead operation on the single thread instructions to identify speculative instructions within the single thread instructions, and allocating the idle core to execute the speculative instructions.

Abstract: Embodiments of apparatuses, methods for partitioning systems, and partitionable and partitioned systems are disclosed. In one embodiment, a system includes processors and a partition manager. The partition manager is to allocate a subset of the processors to a first partition and another subset of the processors to a second partition. The first partition is to execute first operating system level software and the second partition is to execute second operating system level software. The first operating system level software is to manage the processors in the first partition as resources individually accessible to the first operating system level software, and the second operating system level software is to manage the processors in the second partition as resources individually accessible to the second operating system level software.

Abstract: The present application a new and improved system and method of enhanced Lean Document Production (LDP), which applies cellular manufacturing to document printing operations. The LDP process incorporates process friendly cells and, a push model to order to improve efficiency, reduce work in progress and smooth out the “frictions” in production environments. The current application presents an earliest-completion-time strategy for assigning jobs to cells and a dynamic-priority-based-batch-scheduling algorithm.

Abstract: Even if a multiprocessor includes an uneven performance core, an inoperative core or a core that does not satisfy such a performance as designed but if the contrivance of task allocation can satisfy the requirement of an application to be executed, the multiple processors are shipped. In a task group allocation method for allocating, to a processor having a plurality of cores, task groups included in an application for the processor to execute, a calculation section measures performances and disposition patterns of the cores, generates a restricting condition associating the measured performances and disposition patterns of the cores with information indicating whether the application can be executed, and, with reference to the restricting condition, reallocates to the cores, the task groups that have previously been allocated to the cores.

Abstract: Methods, systems and computer programs for migrating a virtual machine (VM) executing on a first host to a second host are presented, where the first host and the second are on different networks. One embodiment of a method includes assigning to the VM a VM address (VMA) belonging to a VM network and publishing a first route to an associated network (AN) via a first virtual router executing on the first host. The method further includes migrating the VM from the first host to the second host, the VM maintaining the assigned VMA after migrating, and publishing a second route to the AN via a second virtual router executing on the second host. The first and second virtual routers have addresses belonging to the VM network, and network packets to and from the VM flow through the virtual router where the VM is executing. A temporary tunnel between the virtual routers allows traffic to flow to the VM while the new route to AN is propagated throughout the network.

Abstract: A system and method employing the system for pushing work request associated contexts into a computer device includes issuing a request to a device in a computer system. Context data is fetched from a data storage device for the device. Context is determined for specified data requests, and context misses in the device are predicted. The system and method then initiates a context push and pushes the context into the device using a controller when a context miss is detected. Thereby, reducing the context miss latency time or delay in retrieving context data.

Abstract: Apparatus and methods are provided for utilizing a plurality of processing units. A method comprises selecting a pending job from a plurality of unassigned jobs based on a plurality of assigned jobs for the plurality of processing units and assigning the pending job to a first processing unit. Each assigned job is associated with a respective processing unit, wherein the pending job is associated with a first segment of information that corresponds to a second segment of information for a first assigned job. The method further comprises obtaining the second segment of information that corresponds to the first segment of information from the respective processing unit associated with the first assigned job, resulting in an obtained segment of information and performing, by the first processing unit, the pending job based at least in part on the obtained segment of information.

Abstract: In a storage area network, a task manager identifies a set of preconditions for execution of storage management tasks. The set of preconditions establish dependencies between tasks in the storage area network. Execution of the tasks is contingent upon satisfaction of the set of preconditions. In addition, the task manager generates a scheduling data structure based on the set of preconditions in order to schedule execution of the tasks. As a result, the task manager can utilize the scheduling data structure to optimize task execution in the storage area network (e.g., by applying a task optimization algorithm). Such optimization minimizes resource consumption (e.g., thread allocation, processor time commitment, etc.) in the storage area network during execution of the tasks.

Abstract: The present disclosure is directed to a method for managing tasks in a computer system having a plurality of CPUs. Each task in the computer system may be configured to indicate a migration ready indicator of the task. The migration ready indicator for a task may be given when the set of live data for that task reduces or its working set of memory changes. The method may comprise associating a migration readiness queue with each of the plurality of CPUs, the migration readiness queue having a front-end and a back-end; analyzing a task currently executing on a particular CPU, wherein the particular CPU is one of the plurality of CPUs; placing the task in the migration readiness queue of the particular CPU based on status of the task and/or the migration ready indicator of the task; and selecting at least one queued task from the front-end of the migration readiness queue of the particular CPU for migration when the particular CPU receives a task migration command.

Abstract: A system and method for interaction with a remote server is described. Using an enterprise scheduler, jobs and other tasks may be scheduled on a remote server. Typically, the enterprise scheduler and remote server communicate through an API which serves as an interpreter between them. A Java API is used when the remote server utilizes Java technology.

Abstract: A method and system of managing resource lease duration for on-demand computing is provided. The system can include one or more resources having a metric capturing tool; and a provisioning manager in communication with the one or more resources. The provisioning manager can receive a request for at least one resource from the requester. The provisioning manager can provision the at least one resource from the one or more resources. The metric capturing tool can communicate one or more metrics associated with performance of the at least one resource to the provisioning manager. The provisioning manager can determine a lease modifier based at least in part on the one or more metrics. The provisioning manager can adjust a lease duration for the at least one resource based at least in part on the lease modifier.