Abstract: A system is provided. The system comprises a first computer located in a first plant, a first memory, and a first object based process management application stored in the first memory. The system further comprises a second computer located in a location separate from the first plant, a second memory, and a second object based process management application stored in the second memory. When executed on the first computer, the first application invokes scripts in response to events and the scripts launch tasks. When executed on the second computer, the second computer invokes scripts in response to events and the scripts launch tasks, one of the events acted on by the second application is a message received from the first application.

Abstract: A single application can be executed across multiple execution environments in an efficient manner if at least a relevant portion of the virtual memory assigned to the application was equally accessible by each of the multiple execution environments. A request by a process in one execution environment can, thereby, be directed to an operating system, or other core software, in another execution environment and can be made by a shadow of the requesting process in the same manner as the original request was made by the requesting process itself. Because of the memory invariance between the execution environments, the results of the request will be equally accessible to the original requesting process even though the underlying software that responded to the request may be executing in a different execution environment. A similar thread invariance can be maintained to provide for accurate translation of requests between execution environments.

Abstract: A communication unit acquires image data. A flow control unit controls execution of a workflow in which optional processing on the image data and check processing are combined. A determining unit determines whether user confirmation is needed for a result of check target processing included in the check processing according to the workflow. A notification unit notifies a user of confirmation of the result when it is determined that the user confirmation is needed. A receiving unit receives a modification input of the result of the check target processing from the user. A modification unit modifies the image data according to the modification input when the receiving unit receives the modification input, while the unit modifies the image data corresponding to the check target processing when it is determined that the user confirmation is not needed.

Abstract: Systems and methods for dynamic generation of scenarios for managing computer system entities are described herein. A number of management programs are deployed in an administrator framework as embedded plug-ins. One or more management descriptors are provided for the plug-ins. The management descriptors include a number of relationships between the deployed programs and a number of computer system entities. The relationships indicate that the management applications can administer one or more aspects of the corresponding entities. A first management program is selected from the number of deployed management programs to administer a related computer system entity. One or more other management programs are dynamically identified and presented to the user as possible management scenarios. The identification of the other management programs is based on correspondence defined in the management descriptors to the aspects or the types of the computer system entity.

Abstract: A plurality of job profiles is received. Each job profile describes a job to be executed, and each job includes map tasks and reduce tasks. An execution duration for a map stage including the map tasks and an execution duration for a reduce stage including the reduce tasks of each job is estimated. The jobs are scheduled for execution based on the estimated execution duration of the map stage and the estimated execution duration of the reduce stage of each job.

Abstract: A job execution apparatus includes: a receiving unit configured to receive each job; a calculation unit configured to calculate an index value representing a load needed to execute each of a pre-processing sub-job and a post-processing sub-job when each of n jobs (n is a natural number equal to or more than 2) is decomposed into a pre-processing sub-job for generating information, and a post-processing sub-job for causing an output unit to output information generated by executing the pre-processing sub-job; a pre-processing execution unit configured to sequentially execute pre-processing sub-jobs which are respectively included in jobs received by the receiving unit and registered in a pre-processing sub-job queue; and a post-processing execution unit configured to sequentially execute, upon completion of the pre-processing sub-jobs, post-processing sub-jobs which are respectively included in the received jobs and which are registered in a post-processing sub-job queue.

Abstract: In a storage system, using a pool of encryption processing cores, the encryption processing cores are assigned to process either encryption operations, decryption operations, and decryption and encryption operations, that are scheduled for processing. A maximum number of the encryption processing cores are set for processing only the decryption operations, thereby lowering a decryption latency. A minimal number of the encryption processing cores are allocated for processing the encryption operations, thereby increasing encryption latency. Upon reaching a throughput limit for the encryption operations that causes the minimal number of the plurality of encryption processing cores to reach a busy status, the minimal number of the plurality of encryption processing cores for processing the encryption operations is increased.

Abstract: This invention relates to a machine implemented method of executing CPU instructions on a plurality of computers in one or more locations, logically arranged in a weighted, lattice-like structure representing information about CPUs, CPU cores, operating system threads, network interconnects, and computer locations in a many-to-many relationship. This approach, by weighting nodes and costing edges, provides a natural method for commoditizing the execution of a workload. Furthermore, this approach lends itself to a means of determining the incremental value (or cost) of additional nodes. Consequently, the creation of a virtual crowd-sourcing market—in which either CPUs singularly or lattices as a whole are market participants—is a natural extension of the method.

Abstract: The subject matter disclosed herein provides methods and apparatus, including computer program products, for providing a weak dependency linking two tasks of a workflow of task. In one aspect, there is provided a computer-implemented method. The method receives, from a user interface, an indication representing a link between a first task and a second task. The link being a weak dependency linking the first and second task. The weak dependency representing that one or more tasks may be inserted between the first and second tasks. The first and second tasks including the link representing the weak dependency may be provided to the user interface. The link presented at the user interface to enable identification of the weak dependency. Related apparatus, systems, methods, and articles are also described.

Abstract: Each of a plurality of process execution portions includes an accumulation portion to accumulate a job in which the first process among processes not yet executed is an in-charge process, and a batch processing portion to execute the in-charge process on combination data including one or more data on condition that a total process volume becomes equal to or greater than a lower limit value predetermined for the in-charge process. The batch processing portion includes a determination portion to determine whether there exists a job having a previous process now being executed, a first delay portion to delay start of the in-charge process until a prescribed time has elapsed since the total process volume becomes equal to or greater than the lower limit value, and a second delay portion to delay start of the in-charge process until a job determined that the previous process is now being executed is accumulated.

Abstract: Various embodiments involve monitoring the execution of jobs in a work plan. For example, a system maintains a risk level associated with the critical job may be maintained to represent whether the execution of a job preceding the critical job has a problem, and a list associated with the critical job may be maintained so as to quickly identify the preceding job which may cause a delay to the critical job execution.

Abstract: This disclosure describes monitoring the execution of jobs in a work plan. In an embodiment, a system maintains a risk level associated with the critical job to represent whether the execution of a job preceding the critical job has a problem, and it maintains the list associated with the critical job so as to quickly identify the preceding job which may cause a delay to the critical job execution.

Abstract: Methods and systems to identify and reproduce concurrency violations in multi-threaded programs are disclosed. An example method disclosed herein comprises determining whether a condition is met and serializing an operation of a first thread of a multi-threaded program relative to an operation of a second thread of the multi-threaded program. The serialization of the operations of the first and second threads results in a concurrency violation or bug thereby causing the multi-threaded program to crash. In this way, the operations of the first and second threads of the multi-threaded program that are responsible for the concurrency violation are identified and can be revised to remove the bug.

Abstract: A method to be implemented using a computer system, the method comprising the steps of providing a resource database that specifies locations of resources for use by consumers, receiving a location communication originated by a mobile consumer device associated with a consumer at a time temporally proximate a time when the consumer accesses a resource where the location communication indicates the location of the consumer device and using the location of the consumer device indicated in the communication to update the resource database.

Abstract: Implementing fair scalable reader writer mutual exclusion for access to a critical section by a plurality of processing threads is accomplished by creating a first queue node for a first thread, the first queue node representing a request by the first thread to access the critical section; setting at least one pointer within a queue to point to the first queue node, the queue representing at least one thread desiring access to the critical section; waiting until a condition is met, the condition comprising the first queue node having no preceding write requests as indicated by at least one predecessor queue node on the queue; permitting the first thread to enter the critical section in response to the condition being met; and causing the first thread to release a spin lock, the spin lock acquired by a second thread of the plurality of processing threads.

Abstract: Generation of a dependency graph for code that includes code portions such as resources or functions or both. For some or all of the nodes, the dependency is calculated by determining that the given node, a depending node, depends on an affecting node. The dependency is recorded so as to be associated with the node. Furthermore, the dependency calculation method is recorded so as to be associated with the dependency. The code may perhaps include portions within two different domains, in which the mechanism for calculating dependencies may differ. In some cases, the dependency graph may be constructed in stages, and perhaps additional properties may be associated with the node, and metadata of the properties may also be recorded.

Abstract: Systems, methods, and computer-readable media for optimizing emulated fixed-function and programmable graphics operations are provided. Data comprising fixed function and programmable states for an image or scenario to be rendered is received. The data for the image is translated into operations. One or more optimizations are applied to the operations. The optimized operations are implemented to render the scenario.

Abstract: The subject disclosure is directed towards scheduling computing task execution by dynamically evaluating dependencies between computing tasks. After executing independent computing tasks in parallel, one or more dependent tasks are scheduled for execution. Unless a task failed, dependencies between remaining tasks are examined to identify one or more computing tasks that do not correspond to a dependency and/or one or more computing tasks that depend upon successfully completed tasks. Dynamic dependency evaluation may be applied to improve self-healing task execution.

Abstract: The system and methods described herein may be used to implement NUMA-aware locks that employ lock cohorting. These lock cohorting techniques may reduce the rate of lock migration by relaxing the order in which the lock schedules the execution of critical code sections by various threads, allowing lock ownership to remain resident on a single NUMA node longer than under strict FIFO ordering, thus reducing coherence traffic and improving aggregate performance. A NUMA-aware cohort lock may include a global shared lock that is thread-oblivious, and multiple node-level locks that provide cohort detection. The lock may be constructed from non-NUMA-aware components (e.g., spin-locks or queue locks) that are modified to provide thread-obliviousness and/or cohort detection. Lock ownership may be passed from one thread that holds the lock to another thread executing on the same NUMA node without releasing the global shared lock.

Abstract: A method performed by a system including one or more data processing systems. The method includes receiving a plurality of requesting process calls for a target process from one or more requesting processes, and identifying dependencies between the requesting process calls. The method includes sending the requesting process call to the target process for execution on multiple threads, including sending thread execution parameters corresponding to the requesting process calls. The method includes receiving results, corresponding to the requesting process calls, from the target process. The method includes sending the results to the requesting processes corresponding to the respective requesting process calls.

Abstract: Methods, apparatuses, and computer program products for selected alert delivery in a distributed processing system are provided. Embodiments include receiving a plurality of events from one or more event producing components of the distributed processing system; creating, by an incident analyzer, in dependence upon the events a truth space representing events that make one or more conditional event processing rules true, the truth space including a set of truth points, each truth point including a set of events and a set of event locations; creating, by the incident analyzer, in dependence upon the truth space one or more alerts including assigning one of the locations of the truth space to one or more of the alerts; and sending, by the incident analyzer, the alerts to at least one component of the distributed processing system.

Abstract: One or more embodiments of the invention enable a system and method for ordering tasks with complex interrelationships. The present invention as described herein may be used to produce a linear ordering of tasks with complex interrelationships including dependencies and constraints. In one or more embodiments optional tasks may be permitted such that a given task may or may not be added to the execution queue depending on the scheduling of earlier tasks following evaluation of their dependencies—that is, the system of the invention supports the management of optional tasks in a task ordering operation where some or all of tasks have complex interdependencies.

Abstract: An apparatus for controlling a machine includes a machine-sided control computer. The machine-sided control computer includes computer readable media on which a virtual computer is stored, and the virtual computer includes one or more computer programs selected from the group consisting of a machine operating computer program, a communication network connection computer program, and a communication network encryption computer program.

Abstract: A synchronization system is described herein that synchronizes two environments by correctly matching identity objects in a source environment with related objects in a target environment. In addition to matching identities based on primitive attributes, the system matches identities across multiple heterogeneous environments based on their relative positions in an identity graph. The system builds the identity graph by first matching some identity objects based on primitive attribute value comparisons. The system fills in the remainder of the identity graph by comparing references to/from the matched identity objects. The combination of attribute value comparisons and comparing references enables identity-aware applications to complete a single identity graph, determine the equivalency of identities in this graph, and apply policy based on this new relationship.

Abstract: A unified architecture for dynamic generation, execution, synchronization and parallelization of complex instructions formats includes a virtual register file, register cache and register file hierarchy. A self-generating and synchronizing dynamic and static threading architecture provides efficient context switching.

Abstract: Embodiments of the present invention relate to the field of communications network technologies and provide a method and an apparatus for synchronization processing based on a multi-core system, which can improve efficiency in system scheduling and consume fewer resources. According to the solutions provided in the present invention, an initialization setting is sent by any processing device in a first group of processing devices that synchronously process a same current task and initialization is performed; then a notification message sent by any processing device in the first group of processing devices is received and 1 is subtracted from a value of a counting semaphore; and when the value of the counting semaphore is 0, a control message is sent to a second group of processing devices through a message sending interface. The solutions provided in the present invention are applicable to processing synchronization and communication between multiple modules.

Abstract: Various embodiments are directed toward improving Virtual Machine performance by reducing the amount of communication protocol processing performed between co-resident Virtual Machine guest applications executing on the same physical machine. Overhead can be reduced by short-circuiting the full communication protocol stack when a plurality of Virtual Machine guest applications are hosted and executing on the same physical machine such as a data storage node or a compute accelerator node. Improvements may also be realized by enabling the sharing in virtual memory of physical memory pages between co-resident Virtual Machine guest applications, and employing a low latency high bandwidth network for enabling guest applications to communicate with each other that are located in different nodes in a data storage cluster.

Abstract: Performing a local barrier operation with parallel tasks executing on a compute node including, for each task: retrieving a present value of a counter; calculating, in dependence upon the present value of the counter and a total number of tasks performing the local barrier operation, a base value, the base value representing the counter's value prior to any task joining the local barrier; calculating, in dependence upon the base value and the total number of tasks performing the local barrier operation, a target value of the counter, the target value representing the counter's value when all tasks have joined the local barrier; joining the local barrier, including atomically incrementing the value of the counter; and repetitively, until the present value of the counter is no less than the target value of the counter: retrieving the present value of the counter and determining whether the present value equals the target value.

Abstract: Performing a local barrier operation with parallel tasks executing on a compute node including, for each task: retrieving a present value of a counter; calculating, in dependence upon the present value of the counter and a total number of tasks performing the local barrier operation, a base value of the counter, the base value representing the counter's value prior to any task joining the local barrier; calculating, in dependence upon the base value and the total number of tasks performing the local barrier operation, a target value, the target value representing the counter's value when all tasks have joined the local barrier; joining the local barrier, including atomically incrementing the value of the counter; and repetitively, until the present value of the counter is no less than the target value of the counter: retrieving the present value of the counter and determining whether the present value equals the target value.

Abstract: A processor of a data processing system executes a controlling thread of a program and detects occurrence of a particular asynchronous event during execution of the controlling thread of the program. In response to occurrence of the particular asynchronous event during execution of the controlling thread of the program, the processor initiates execution of an assist thread of the program such that the processor simultaneously executes the assist thread and controlling thread of the program.

Abstract: A task is marked as dependent upon a preceding task. The task that is attempted to be taken for execution from a head of a pending task queue that is marked is deferred. The deferred task is removed from the pending task queue and placed in a deferred task queue. The deferred task is reinserted back into the pending task queue for execution upon determining that the preceding tasks are completed.

Abstract: A processor registers a scheduled start timing and a scheduled end timing for each of a plurality of processes in advance into a storage unit, decides, based on the scheduled start timings and the scheduled end timings registered in the storage unit, whether or not the processes have a dependency relationship therebetween, and extracts a plurality of schedule paths by connecting those of the processes decided to have the dependency relationship therebetween to each other. A schedule path of the processes can be produced in a simplified maker without significantly breaking the accuracy of the time relationship among the processes.

Abstract: The disclosure relates in particular to the processing of commands targeting at least one element of a cluster including a plurality of elements, the at least one element having a link of dependency according to the at least one command with at least one other element. After having identified the at least one element and at least one dependency rule from the at least one command, a dependency graph is generated from the at least one identified element, by applying the at least one identified dependency rule, the dependency graph including peaks representing at least the element and the at least one other element, an action linked with the at least one command being associated with the peaks of the dependency graph. A sequence of instructions is then generated from the dependency graph.

Abstract: Computations are performed on shared datasets in a distributed computing cluster using aggressive speculation and a distributed runtime that executes code transactionally. Speculative transactions are conducted with currently available data on the assumption that no dependencies exist that will render the input data invalid. For those specific instances where this assumption is found to be incorrect—that the input data did indeed have a dependency (thereby impacting the correctness of the speculated transaction)—the speculated transaction is aborted and its results (and all transactions that relied on its results) are rolled-back accordingly for re-computation using updated input data. In operation, shared state data is read and written using only the system's data access API which ensures that computations can be rolled-back when conflicts stemming from later-determined dependencies are detected.

Abstract: Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node. As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

Abstract: A deadlock detection method and computer system for parallel programs. A determination is made that a lock of the parallel programs is no longer used in a running procedure of the parallel programs. A node corresponding to the lock that is no longer used, and edges relating to the lock that is no longer used, are deleted from a lock graph corresponding to the running procedure of the parallel programs in order to acquire an updated lock graph. The lock graph is constructed according to a lock operation of the parallel programs. Deadlock detection is then performed on the updated lock graph.

Abstract: A thread processing method that is executed by a multi-core processor, includes supplying a command to execute a first thread to a first processor; judging a dependence relationship between the first thread and a second thread to be executed by a second processor; comparing a first threshold and a frequency of access of any one among shared memory and shared cache memory by the first thread; and changing a phase of a first operation clock of the first processor when the access frequency is greater than the first threshold and upon judging that no dependence relationship exists.

Abstract: Guiding OS thread scheduling in multi-core and/or multi-threaded microprocessors by: determining, for each thread among the active threads, the power consumed by each instruction type associated with an instruction executed by the thread during the last context switch interval; determining for each thread among the active threads, the power consumption expected for each instruction type associated with an instruction scheduled by said thread during the next context switch interval; generating at least one combination of N threads among the active threads (M), and for each generated combination determining if the combination of N threads satisfies a main condition related to the power consumption per instruction type expected for each thread of the thread combination during the next context switch interval and to the thread power consumption per instruction type determined for each thread of the thread combination during the last context switch interval; and selecting a combination of N threads.

Abstract: A method and computer program product for defining a plurality of tags, each of which is associated with a discrete process executable on activity content. At least one of the plurality of tags is associated with a piece of content within an activity, thus defining one or more associated tags.

Abstract: Computer-implemented methods, systems, and computer-readable storage media are disclosed to coordinate a plurality of devices in performing a task. A particular computer-implemented method includes storing updated status information at a device where the updated status information reflects a change in a vote for a task state of one or more of a plurality of devices. A first updated status message is sent to one or more of the plurality of devices where the first updated status message communicates the updated status information. A task consensus at the device is updated when the updated status information indicates that at least a predetermined quantity of the plurality of devices agrees on the task status.

Abstract: Implementations of the present disclosure provide methods including executing a virtual machine configured to execute a plurality of applications and perform a plurality of I/O operations; storing meta information for a first I/O operation performed by the virtual machine in an I/O information holder for the virtual machine; receiving a request to begin an I/O profiling session on the virtual machine after storing the meta information; and reporting an I/O event record for a second I/O operation performed by the virtual machine using the meta information for the first I/O operation, wherein the second I/O operation is performed after beginning an I/O profiling session on the virtual machine.

Abstract: A cross-logical entity group is created that includes one or more accelerators to be shared by a plurality of logical entities. Instantiated on the accelerators are functions that are common across multiple logical entities. The functions to be instantiated are determined, for instance, dynamically during run-time.

Abstract: According to one embodiment a first node of a network communicates with a second node of the network. The first node tells the second node to perform an operation and how to perform the operation using computer code. Additionally, the first node tells the second node what to do with the result of the operation.

Abstract: In a meshing method for use in a computer-aided design (CAD) or computer-aided engineering (CAE) system, in which one or more serial meshing units are used to carry out a decoupled parallel meshing process in respect of all parts of a CAD assembly model, input parameters for the meshing process automatically, for each part to be processed, are set using live runtime information about the meshing process for the part concerned, such as information about the outcome of previous attempts to carry out the meshing process of the part.

Abstract: A technique for performing barrier synchronization among a plurality of program threads. More particularly, at least one embodiment of the invention keeps track of completed tasks associated with a number of program threads using bits within a barrier register that can be updated and reassigned without incurring the amount of bus traffic as in the prior art.

Abstract: Automated service level management of applications can include automated deployment, monitoring, forecasting, and/or predicting based on a plurality of service levels comprising application level, application server platform level, virtual machine level, and/or infrastructure level, and optimizations at multiple levels using a plurality of techniques including automated dynamic application migration. Automated deployment of applications in a cloud computing environment using deployment descriptors comprises receiving values for service level parameters for an application, creating a deployment descriptor based on the parameters, identifying application servers that satisfy the deployment descriptors, and deploying the application to the identified application servers.

Abstract: A method for monitoring the coordinated execution of sequenced tasks by an electronic card including at least one first processor (PP1) and a second processor (PP2) synchronized to the same clock of determined time period, includes: recording in memory means by the first processor (PP1) of a first identifier (ID1) characterizing the time period (T1) in the course of which the first sequenced task has been executed; recording in the memory means by the second processor (PP2) of a second identifier (ID2) characterizing the time period (T1) in the course of which the first accessory task (N1) has been executed; comparing by the first processor (PP1) the first identifier (ID1) and the second identifier (ID2); and signaling by the first processor (PP1) in the case of failure of the comparison so as to signal a defect of coordination of the processors (PP1, PP2).

Abstract: A method for monitoring the coordinated execution of sequenced tasks by an electronic device including a main electronic card including at least one main processor synchronized to a main clock and at least one auxiliary electronic card including at least one auxiliary processor synchronized to an auxiliary clock, includes emitting by the main processor of a coordination marker to the auxiliary processor at the start of each main time period; emitting by the auxiliary processor of a response word formed on the basis of the last coordination marker received to the main processor at the end of each auxiliary time period; validating by the main processor of the response word received with respect to the first coordination marker emitted; and signaling by the main processor if the response word received is not valid so as to signal a defect of coordination of the auxiliary processor.

Abstract: Techniques for evaluating and managing cloud networks are provided. Geographical locations for cloud processing environments are combined with attributes and usage metrics to form associations between each cloud processing environment's geographical location and that cloud's corresponding attributes and usage metrics. A map is organized for the associations to form a cloud network. The map is dynamically updated, supplied to services, and rendered for evaluation of the cloud network.

Abstract: Technologies for low power execution of one or more threads of a multithreaded program by one or more processing elements are generally disclosed.