Abstract: The information service providing device of the disclosure of the present application selects sensors which may be used for the implementation of an information service to be provided within a plurality of sensors which the device can make use of, and in addition, selects the most appropriate one within the sensors which may be used and selects an appropriate parameter for the sensors and processing programs in order for the information service to be provided appropriately, and set to these in response to the environment in which the information service is implemented. Furthermore, the information service providing device of the disclosure of the present application provides, with only the receipt of the designation of desired information service by a user, various information services are provided by appropriately combining various kinds of sensors and a plurality of processing programs.

Abstract: In one embodiment, the present invention includes a method of assigning a location within a shared variable for each of multiple threads and writing a value to a corresponding location to indicate that the corresponding thread has reached a barrier. In such manner, when all the threads have reached the barrier, synchronization is established. In some embodiments, the shared variable may be stored in a cache accessible by the multiple threads. Other embodiments are described and claimed.

Abstract: A method, apparatus and computer program product are provided to synchronize multiple devices. In regards to a method, an indication is received that a view of a task is presented by a first device. The method causes state information to be provided to a second device to permit the second device to be synchronized with the first device and to present a different view of the task than that presented by the first device. The method also receives information relating to a change in state of the task that is provided by one of the devices while a first view of the task is presented thereupon. Further, the method causes updated state information to be provided to another one of the devices to cause the other device to remain synchronized and to update a second view of the task, different than the first view of the task, that is presented.

Abstract: A synchronization method of multiple threads is executed by a computer. The synchronization method includes determining a type of a synchronization process of a first thread performing the synchronization process for synchronization with a second thread; starting time measurement when the type of the synchronization process of the first thread is a first type; performing the synchronization process of the first thread and a synchronization process of the second thread based on a synchronization process history of the second thread when the measured time exceeds a permitted response period of the first thread; and updating the permitted response period and performing the synchronization processes of the first thread and the second thread based on the synchronization process history of the second thread, when another processing request is received.

Abstract: A method, information processing system, and computer program product are provided for managing operating system interference on applications in a parallel processing system. A mapping of hardware multi-threading threads to at least one processing core is determined, and first and second sets of logical processors of the at least one processing core are determined. The first set includes at least one of the logical processors of the at least one processing core, and the second set includes at least one of a remainder of the logical processors of the at least one processing core. A processor schedules application tasks only on the logical processors of the first set of logical processors of the at least one processing core. Operating system interference events are scheduled only on the logical processors of the second set of logical processors of the at least one processing core.

Abstract: In a method of identifying a globally consistent state in a multithreaded program, a plurality of locally consistent states is identified, in which a locally consistent state of a thread comprises a set of memory locations and their corresponding data values accessed between points in the multithreaded program where no locks are held. Globally consistent states are identified based at least in part on the locally consistent states.

Abstract: Provided are a synchronization control section that executes a current thread and a reference thread in parallel, a waiting time calculation section that calculates the time needed for the reference thread to reach a second synchronization point as a waiting time of the current thread when the reference thread does not reach the second synchronization point at a time when the current thread reaches a first synchronization point, a quality difference calculation section that estimates a quality difference between data that the current thread generates by referring to processing data at the second synchronization point of the reference thread and data that the current thread generates without referring to the processing data, and a synchronization determination section that determines whether to make the current thread wait until the reference thread reaches the second synchronization point depending on the waiting time and the magnitude of the quality difference.

Abstract: A task count controller, a task count control method, and a computer program capable of dynamically controlling the number of tasks that can be processed in parallel simultaneously without increasing computational load are provided. When a plurality of tasks are to be executed simultaneously in parallel processing, the number of tasks that can be executed simultaneously is controlled. The tasks to be executed simultaneously are added in units of a predetermined number of tasks and the throughput in one unit of work is measured for each task every time the tasks are added. The total sum of the measured throughputs is calculated, and it is determined whether the calculated total sum of throughputs is more than the total sum of throughputs immediately before the predetermined number of tasks are added.

Abstract: A computer network connects to a first computer, a second computer, other multiple computers, and a job category database A service to be executed by any of the other multiple computers is divided into multiple jobs; the job category is associated with each of the divided jobs; a region code and an instruction to execute the service are received from the first computer; and for each of the multiple jobs, the job category database is searched with the received region code and the associated job category as keys to acquire the operation identifier list corresponding to the job; the operation identifier list is transmitted to at least one of the other multiple computers; and a combination of the job, the identifier of that other computer and the identifier list are transmitted to the first computer.

Abstract: A method includes receiving a command for migration of a workload partition having multiple processes from a source machine to a target machine. The method includes executing, for each of the multiple processes at least partially in parallel, an operation to create checkpoint data. The operation to create the checkpoint data provides an estimation of a size of the checkpoint data that is needed for migration, wherein the operation to create the checkpoint data is independent of storing the checkpoint data in the file. The method includes allocating areas within the file for storage of the checkpoint data for each of the multiple processes. The method includes storing the checkpoint data, for each of the multiple processes at least partially in parallel, into the areas allocated within the file based on offsets in the file for each of the multiple processes.

Abstract: Technologies for an automated testing environment (ATE) framework can support the creation and execution of various automated tests on data storage systems. The ATE framework can support various configurations of multiple client systems exercising multiple storage target systems. A connectionless communication model can be supported among elements within the ATE. Complex tests can be subdivided into smaller jobs that can be executed sequentially, in parallel, or any combination thereof. Sophisticated scheduling mechanisms can include dependency relationships that can require one job to finish before another job begins. Multiple storage targets and multiple initiators can be involved in various configurations and combinations for specific testing tasks. The ATE framework can support extensibility, test tracking, reporting of test results, and fault injection.

Abstract: In a computer system with a multi-core processor, the execution of tasks is scheduled in that a first queue for new tasks and a second queue for suspended tasks are related to a first core, and a third queue for new tasks and a fourth queue for suspended tasks are related to a second core. The tasks have instructions, the new tasks are tasks where none of the instructions have been executed by any of the cores, and the suspended tasks are tasks where at least one of the instructions has been executed by any of the cores. New tasks are popped from the first queue to the first core; and in case the first queue being empty, tasks are popped to the first queue in the following preferential order: suspended tasks from the second queue, new task from the third queue, and new tasks from the fourth queue.

Abstract: A method, a system and a product are disclosed for executing a taskflow in a distributed taskflow architecture and for providing the latter. In at least one embodiment, the taskflow is generated by interconnecting modular tasks, having a synchronization mechanism in order to be able to execute the taskflow on different processing instances both in an online mode and in an offline mode and in order to allow a change between the modes even during performance of the taskflow.

Abstract: A technique of performing a workflow on a plurality of task servers involves starting a plurality of task server processes on the plurality of task servers. Each task server provides an operating system which is constructed and arranged to locally run a respective task server process. The technique further involves receiving a workflow which includes a set of dependency-related predefined activities, and placing task identifiers in a queue structure based on the received workflow. The task identifiers identify tasks to be performed in a distributed manner by the plurality of task server processes started on the plurality of task servers. Each task is a specific execution of a dependency-related predefined activity of the workflow. Progress in performing the workflow is made as the plurality of task server processes (i) claim task identifiers from the queue structure and (ii) perform the tasks identified by the claimed task identifiers.

Abstract: In some embodiments, a method includes receiving a request to generate a thread and supplying a request to a queue in response at least to the received request. The method may further include fetching a plurality of instructions in response at least in part to the request supplied to the queue and executing at least one of the plurality of instructions. In some embodiments, an apparatus includes a storage medium having stored therein instructions that when executed by a machine result in the method. In some embodiments, an apparatus includes circuitry to receive a request to generate a thread and to queue a request to generate a thread in response at least to the received request. In some embodiments, a system includes circuitry to receive a request to generate a thread and to queue a request to generate a thread in response at least to the received request, and a memory unit to store at least one instruction for the thread.

Abstract: Method and apparatus for configuring systems implementing diverse platforms in a network is described. In one example, functional units of the systems are exposed to define abstract function signatures. A template is specified using at least one of the abstract function signatures to define at least one executable task. The template is translated into configuration data adapted to configure each of the system to collectively perform the at least one executable task. The configuration data is applied to the systems through a coupler layer adapted to interface with each of the diverse platforms.

Abstract: Disclosed are various embodiments for the management of dependencies on data. Multiple jobs are executed in one or more computing devices. It is determined that a first one of the jobs consumes data produced by a second one of the jobs, and a dependency is recorded. It is then determined whether the dependency is satisfied. When the dependency is determined to be unsatisfied, execution of the first one of the jobs is suspended. When the second one of the jobs produces the data, the dependency is updated as being satisfied. Execution of the first one of the jobs is resumed in response to the dependency being updated as being satisfied.

Abstract: Disclosed are apparatus and methods for executing software applications with an actual environment. Handlers for a software application are registered. Each handler can be executed upon receiving an indication of a triggering event. A determination is made that a triggering event for the software application has occurred. In response to the triggering event: a handler environment for the triggering event is determined based on the actual environment, triggered handlers of the registered handlers are determined to be executed, at least a respective portion of the handler environment is made available to each triggered handler, executing the triggered handlers, where at least one triggered handler updates its respective portion of the handler environment during execution, determining an updated-handler environment based on the handler environment and the portions of the handler environments after execution of the triggered handlers, and updating the actual environment based on the updated-handler environment.

Abstract: A concurrency assertions system disclosed herein provides for atomic evaluation of an assertion expression by locking an assertion lock upon initiating an assertion and thereby protecting the assertion evaluation from concurrent modifications to the variables in the assertion expressions. When a violation of an assertion is detected, the concurrency assertions system ensures that the exception statistics at the time of the assertion violation represents a program state where the assertion is violated, thus improving analysis of assertion violations. Furthermore, the concurrency assertions system continuously evaluates an expression for an assertion for a time period while other threads in the program are being executed.

Abstract: A network architecture is used for the communication between elementary calculus units or nodes of a supercomputer to execute a super-calculus processing application, partitionable and scalable at the level of calculus power in the range of PetaFLOPS. The supercomputer comprises a plurality of modular structures, each of which comprises a plurality of elementary calculus units or nodes defined by node cards, a backplane, a root card, and a node communication network of the switched fabric fat tree type; ii) a synchronization architecture comprising a plurality of distinct node communication networks, configured for the communication of specific synchronization information different from network to network and with different characteristics; iii) a re-configurable Programmable Network Processor that implements the nodes both of the n-toroidal network and those of the synchronization networks.

Abstract: A job assignment apparatus includes: a correlation calculation unit to calculate a correlation between an execution time used for processing a program that depends on a computer resource operating at the start of an execution request job and an execution time used for processing a predetermined amount of data in the execution request job which operates immediately after completion of an operation of the program; a resource identification unit to identify the computer resource on which the execution request job depends on the basis of the correlation calculated by the correlation calculation unit; and a job assignment unit to assign the execution request job to one of execution servers connected to the job assignment apparatus so as to exclude simultaneous execution of a job that depends on the same computer resource as the computer resource identified by the resource identification unit and the execution request job.

Abstract: The present invention discloses methods of solving mixed integer programs (MIP) in distributed environments, where the number of computers or users involved in the optimization can be extremely high. The proposed methods are designed to be robust in order to cope with all the difficulties in public and heterogeneous environments including load balancing and privacy. The present invention also describes a market on computation power.

Abstract: The execution environment provides for scalability where components will execute in parallel and exploit various patterns of parallelism. Dataflow applications are represented by reusable dataflow graphs called map components, while the executable version is called a prepared map. Using runtime properties the prepared map is executed in parallel with a thread allocated to each map process. The execution environment not only monitors threads, detects and corrects deadlocks, logs and controls program exceptions, but also data input and output ports of the map components are processed in parallel to take advantage of data partitioning schemes. Port implementation supports multi-state null value tokens to more accurately report exceptions. Data tokens are batched to minimize synchronization and transportation overhead and thread contention.

Abstract: The present disclosure involves systems, software, and computer implemented methods for preserving a Hypertext Transfer Protocol (HTTP) request. One process includes operations for receiving an HTTP request and generating request and response objects representing the HTTP request. Multiple child threads are generated and then executed at content providers to render content in response to the HTTP request. A first portion of the rendered content is transmitted, but the request and response objects are stored in memory and made accessible to content providers associated with pending child threads. The content providers associated with the pending child threads utilize the request and response objects to render a second portion of the content.

Abstract: The present disclosure provides a method, computer program product, and activity recording system for identifying idleness in a processor via a concurrent software environment. A thread state indicator records an indication of a synchronization state of a software thread that is associated with an identification of the software thread. A time profiler identifies a processor of the computer system being idle and records an indication that the processor is idle. A dispatch monitor identifies a dispatch of the software thread to the processor. In response to the dispatch monitor determining the indication identifies that the processor is idle and the indication of a synchronization state of the software thread indicating the software thread ceases to execute in the processor, the dispatch monitor generates a record attributing the idleness of the processor to the software thread and the indicated synchronization state.

Abstract: A batch computer or batch processor may implement conditional execution at the command level of the batch processor or higher. Conditional execution may involve execution of one batch buffer depending on the results achieved upon execution by another batch buffer.

Abstract: A process modeling tool provides a process designer with the ability to design a plurality of business process models that include tasks for achieving a desired result(s). The process modeling tool allows the process designer to merge the process models into a merged process model by replacing event flow coordinators within the process models with control flow coordinators that dictate a flow of the merged process model. Accordingly, the process designer is allowed to use the merged process model for monitoring of a current status of the tasks, and for re-distributing the tasks in a desired manner for execution by selected entities, while the original process models are maintained and may be executed in their original execution environment.

Abstract: What is disclosed is a novel fault tolerant page parallel RIP system having a plurality of distributed RIP nodes and a method for robust recovery in the event of a fault having occurred on the system. In one embodiment, the present fault tolerant page parallel RIP system comprises at least a plurality of RIP nodes, a supervisor node, and a splitter node. The splitter receives a location of the job file and splits the job file into at least one original chunk. In formation sufficient to regenerate the original chunk in the event of a fault condition having occurred on the page parallel RIP system is stored. The splitter then sends the original chunk to a destination RIP node wherein the original chunk is RIP'ed into at least one page in print-ready form. The one page is the provided in print-ready form to an output subsystem. Various embodiments are disclosed.

Abstract: In general, in one aspect, the disclosure describes a method to detect a transaction and direct non transactional memory (TM) user functions within the transaction. The non TM user functions are treated as TM functions and added to the TM list.

Abstract: An exemplary method involves receiving a request to monitor a resource within a computer system. The request may be a monitoring resource request or a configuration request. A plurality of requests may be received and collected in a collector. The method also involves selecting a monitoring process from a plurality of monitoring processes and forwarding the request to the selected monitoring process. The capabilities of each monitoring process within the plurality of monitoring processes are registered with the collector. The method further involves enabling the selected monitoring process to terminate after execution of the request.

Abstract: Methods, apparatus, and products are disclosed for executing an application on a parallel computer that include: executing, by a current compute node, a current task of the application, including producing results; determining, by the current compute node in dependence upon current network characteristics and application characteristics, whether to transfer the results to a next compute node for further processing by a next task on the next compute node or to execute the next task for further processing of the results on the current compute node; transferring, by the current compute node, the results to the next compute node for further processing by the next task on the next compute node if the determination specifies transferring the results to the next node; and executing, by the current compute node, the next task for further processing of the results if the determination specifies executing the next task on the current compute node.

Abstract: Systems and methods for domain management in a virtualized computing environment are provided. In one embodiment, the method comprises collating advice received from one or more domain advisors connected in the virtualized computing environment; resolving any conflicts among the advice received from said one or more domain advisors; utilizing the collated advice to generate a placement plan comprising a plurality of operations for virtual machines in said virtualized computing environment; and executing the one or more operations in the placement plan, wherein one or more domain handlers may be called to update the virtualized computing environment before, during or after execution of one or more operations from among said plurality of operations in the plan.

Abstract: A computer system and a method are disclosed for use in automatically deploying an application program to execute with one or more library resources. The computer system includes a deployment unit which deploys the application program into a runtime execution environment. When a predetermined trigger condition is detected, the deployment unit clones a first library resource to create a clone, transforms the application to depend upon the clone and resolves the dependencies of the application using the clone. In one embodiment, the trigger condition relates to a pinning situation, whereby a library upon which the application program depends cannot be wired to the application program to resolve the dependency. Here, the clone now satisfies that dependency. In another embodiment, the trigger condition is a mandatory cloning property that requires the library to be cloned. The mandatory cloning property may also be user-specified through a user interface.

Abstract: A system, method, and computer program product are provided for processing a task utilizing a virtual machine as a function of an aspect of another virtual machine. In use, a task to be processed is identified. Furthermore, the task is processed utilizing at least one virtual machine located in a device as a function of at least one aspect of at least one other virtual machine located on the device.

Abstract: A portable communication device operating method includes the following steps: receiving a first software opening command to open a first software. Then, a portable communication device opens the first software. The portable communication device stores several pre-load relations, wherein each of the pre-load relations records at least one pre-load software to be pre-loaded after a preset software is opened. At least one second software to be pre-loaded after the first software is opened is obtained by inquiring the pre-load relations according to the first software. The portable communication device pre-loads the second software. A second software opening command to open the second software is received. The portable communication device opens the pre-loaded second software.

Abstract: Disclosed is a simple but yet effective strategy to check pairwise reachability in an online analysis under a general locking scheme where locks may be acquired in recursive, non-nested, or nested manner. Under data abstraction, such an approach guarantees true positives and negatives for two-threaded system. For more than two threaded, it guarantees either true positive or true negative (but not both). It uses time stamped lock/unlock events to identify and avoid redundant and inconsistent sequence. Importantly, the approach is incremental and reduce amortized cost of checking multiple pairwise reachability problems. The worst case complexity is quadratic in the length of the history; in practice, however, the running cost is linear in the length of the history.

Abstract: A system and method for buffering intermediate data in a processing pipeline architecture stores the intermediate data in a shared cache that is coupled between one or more pipeline processing units and an external memory. The shared cache provides storage that is used by multiple pipeline processing units. The storage capacity of the shared cache is dynamically allocated to the different pipeline processing units as needed, to avoid stalling the upstream units, thereby improving overall system throughput.

Abstract: A job analyzing method includes classifying jobs in log data in accordance with a time segment to which an end time of each of the jobs belongs; generating, for first jobs included in a first time segment, first data indicating an execution sequence relation between the first jobs based on end time of the jobs, and generating, for second jobs included in a second time segment succeeding the first time segment, second data indicating an execution sequence relation between the second jobs based on end time of the second jobs; and analyzing an execution sequence relation between the first and second jobs based on the end time of the first jobs and the end time of the second jobs, and generating data indicating the execution sequence relation between the first and second jobs across the first and second time segments.

Abstract: One embodiment of the present invention sets forth a technique for automatic launching of a dependent task when execution of a first task completes. Automatically launching the dependent task reduces the latency incurred during the transition from the first task to the dependent task. Information associated with the dependent task is encoded as part of the metadata for the first task. When execution of the first task completes a task scheduling unit is notified and the dependent task is launched without requiring any release or acquisition of a semaphore. The information associated with the dependent task includes an enable flag and a pointer to the dependent task. Once the dependent task is launched, the first task is marked as complete so that memory storing the metadata for the first task may be reused to store metadata for a new task.

Abstract: In one or more embodiments, one or more methods and/or systems described can perform displaying, on a handheld device, multiple icons associated with multiple segments; receiving first user input indicating a first segment of the multiple segments; executing a first virtual machine associated with the first segment on the handheld device; executing a first application on the first virtual machine; receiving second user input indicating a second segment of the multiple segments; executing a second virtual machine associated with the second segment on the handheld device; and executing a second application on the second virtual machine. In one or more embodiments, one or more methods and/or systems described can further perform before executing the second virtual machine, receiving authentication information and determining that the user is authenticated. In one or more embodiments, the authentication information can include at least one of a user name, a password, and/or biometric information.

Abstract: A data processing method according to the present invention includes executing a third thread for performing a series of procedures (reception, operation, storage, and transmission), in which the series of procedures includes receiving a control signal transmitted from a first thread that supplies input data, then executing an operation using the input data, storing a result of the operation to a data region specified by the control signal, and transmitting the control signal to a second thread that uses the result. This guarantees exclusive data access without locking/unlocking data at the time of executing threads with data dependency and also reduces data transfer cost.

Abstract: A method and an apparatus for concomitance scheduling a work thread and assistant threads associated with the work thread in a multi-threading processor system. The method includes: searching one or more assistant threads associated with the running of the work thread when preparing to run/schedule the work thread; running the one or more assistant threads that are searched; and running the work thread after all of the one or more assistant threads associated with the running of the work thread have run.

Abstract: A processing time estimation method for estimating a processing time of each of a plurality of jobs, the processing time estimation method including determining, executed by a computer, whether the each job has a preceding job thereof on the basis of previous execution data including previous information of a plurality of previous start times and previous finish times of respective jobs of the plurality of jobs, the preceding job of the each job being included in the plurality of jobs and at least having the previous finish time earlier than the previous finish time of the each job.

Abstract: An information processing device includes a processing unit which manages an association processing network formed by image processing devices. The processing unit includes a service evaluation content generating unit which acquires requirement performance information of a service to be stored from a service requirement performance managing unit and generates an evaluation content to be evaluated for the service by including the requirement performance information in an evaluation object, a service evaluation unit which evaluates the evaluation content of the service according to a predetermined requirement, and an association object managing unit which registers the service as a new association object the evaluation content of the service the predetermined requirement of which has been met by the evaluation of the service evaluation unit.

Abstract: A data processing method has a device control thread for each peripheral device capable of an independent operation, a CPU processing thread for each data processing that is performed by a CPU, a control thread equipped with a processing part for constructing an application. The control thread checks an output from the thread related with each processing part, performs with a higher priority from the processing part in which output data of the preprocessing part as a configuration of the application exists and that is near termination, and instructs execution of the each device control thread and the CPU processing thread, and data input/output. Each of device control thread and CPU processing thread processes the data according to the instructions, and sends a processing result and a notification to the control thread.

Abstract: A system for managing transactions, including a first reference cell associated with a starting value for a first variable, a first thread having an outer atomic transaction including a first instruction to write a first value to the first variable, a second thread, executing in parallel with the first thread, having an inner atomic transaction including a second instruction to write a second value to the first variable, where the inner atomic transaction is nested within the outer atomic transaction, a first value node created by the outer atomic transaction and storing the first value in response to execution of the first instruction, and a second value node created by the inner atomic transaction, storing the second value in response to execution of the second instruction, and having a previous node pointer referencing the first value node.

Abstract: Disclosed herein are methods and systems for enforcing dependencies in an account management system using publish/subscribe. Messages containing account information may be published and received by one or more account servicers. Account servicers may not perform account management tasks based on a message unless the message satisfies a keyword, which may express dependencies of the account servicer. Keywords may be based on the content of received messages. If a received message matches a keyword, the account servicer may perform an account management task, and cause a subsequent message to be published with an additional keyword related to the account servicer.

Abstract: A job control method includes: acquiring, from electronic information accepted, set information set for each setting item contained in the electronic information; setting the set information, which is acquired in the acquiring step, for an usable state in the job within a job item contained in a plurality of job items whose executing procedure are preset, the plurality of job items including a first job item and a second job item; and changing the set information, which is used in the job within a first job item, into an unusable state in the job within a second job item to be executed after the first job item has been executed.

Abstract: A system for selecting services that are used for a composite service, may include an accessing unit and a processing unit. The accessing unit may be configured to access: tasks of the composite service, transactional requirements of the tasks, services that are configured to fulfill the tasks, and transactional properties of the services. The processing unit may be configured to: compute conditions for services that are configured to fulfill a task and select a service configured to fulfill the task and having transactional properties that fulfill the conditions, wherein the conditions are computed using data comprising the transactional requirements of the tasks.

Abstract: Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session.