Abstract: A system or computer usable program product for managing jobs scheduled for execution on a target system in which some jobs may spawn additional jobs scheduled for execution on the target system including intercepting jobs scheduled for execution in the target system, determining whether there is resource sufficiency in the target system for executing jobs, responsive to an affirmative determination of resource sufficiency, releasing previously intercepted jobs for execution in the target system, computing a limit of a number of jobs which can be concurrently scheduled by an external system to the target system, and transmitting the computed limit to the external system.

Abstract: When a plurality of jobs are processed using a plurality of data processing units, data formats of the jobs to be processed can be determined to distribute a data processing load of the data processing units. A method for controlling a data processing apparatus for causing a plurality of data processing units to process data of a job includes storing data of a first job in a storing unit in first and second data formats, determining whether to process the stored data of the first job in the first or second data format, and causing the plurality of data processing units to process the data in the determined data format. The determination is made based on whether processing of data of a second job by the first or second processing unit requires longer time.

Abstract: An autonomic method, apparatus, and program product are provided for performance data collection. A start time and a stop time are monitored for an application. The start time is compared with the stop time to determine whether or not the application is meeting a performance target of the application. If the application is not meeting the performance target for the application, performance data collection is autonomically started for the application.

Abstract: The embodiments described herein relate to systems and methods for modifying content of mobile communication devices.

Abstract: According to one aspect of the present disclosure, a method and technique for rate of operation progress reporting is disclosed. The method includes: responsive to completion by an application of one or more batch operations, storing an operation count corresponding to each completed batch operation; and, responsive to being polled by a monitoring module: identifying a time reporting window for the batch operations; and reporting a rate of progress meter value for the batch operations to the monitoring module based on the operation counts and the time reporting window.

Abstract: A system and method can support batch job management in a distributed system using a queue system with a plurality of queues and one or more job management servers. The queue system can represent a life cycle for executing a job by a job execution component, with each queue in the queue system adapted to receive one or more messages that represent a job status in the life cycle for executing the job. The one or more job management servers in the distributed system can direct the job execution component to execute the job, with each job management server monitoring one or more queues in the queue system, and performing at least one operation on the one or more messages in the queue system corresponding to a change of a job status for executing the job.

Abstract: Transactional Lock Elision (TLE) may allow multiple threads to concurrently execute critical sections as speculative transactions. Transactions may abort due to various reasons. To avoid starvation, transactions may revert to execution using mutual exclusion when transactional execution fails. Because threads may revert to mutual exclusion in response to the mutual exclusion of other threads, a positive feedback loop may form in times of high congestion, causing a “lemming effect”. To regain the benefits of concurrent transactional execution, the system may allow one or more threads awaiting a given lock to be released from the wait queue and instead attempt transactional execution. A gang release may allow a subset of waiting threads to be released simultaneously. The subset may be chosen dependent on the number of waiting threads, historical abort relationships between threads, analysis of transactions of each thread, sensitivity of each thread to abort, and/or other thread-local or global criteria.

Abstract: A method and system for real-time monitoring of processes to obtain job data of jobs running on different non-compatible platforms with a Java monitoring agent, then saving, reporting and making the job data available at any time for viewing by a system administrator on a single display monitor.

Abstract: Method for issuing and monitoring a remote batch job, method for processing a batch job, and system for processing a remote batch job. The method for issuing and monitoring a remote batch job includes formatting a command to be sent to a remote server to include a sequence identification composed of an issuing server identification and a time stamp, forwarding the command from the issuing server to the remote server for processing, and determining success or failure of the processing of the command at the remote server. When the failure of the processing of the command at the remote server is determined, the method further includes instructing the remote server to retry the command processing.

Abstract: A recommended sequence of tasks to complete a complex task is programmatically defined. The recommended sequence is adaptive in that the sequence can be altered based on the completion status of one or more of the tasks.

Abstract: In accordance with embodiments disclosed herein, there are provided mechanisms and methods for batch processing in an on-demand service environment. For example, in one embodiment, mechanisms include receiving a processing request for a multi-tenant database, in which the processing request specifies processing logic and a processing target group within the multi-tenant database. Such an embodiment further includes dividing or chunking the processing target group into a plurality of processing target sub-groups, queuing the processing request with a batch processing queue for the multi-tenant database among a plurality of previously queued processing requests, and releasing each of the plurality of processing target sub-groups for processing in the multi-tenant database via the processing logic at one or more times specified by the batch processing queue.

Abstract: Multi-threaded, transactional memory systems may allow concurrent execution of critical sections as speculative transactions. These transactions may abort due to contention among threads. Hardware feedback mechanisms may detect information about aborts and provide that information to software, hardware, or hybrid software/hardware contention management mechanisms. For example, they may detect occurrences of transactional aborts or conditions that may result in transactional aborts, and may update local readable registers or other storage entities (e.g., performance counters) with relevant contention information. This information may include identifying data (e.g., information outlining abort relationships between the processor and other specific physical or logical processors) and/or tallied data (e.g., values of event counters reflecting the number of aborted attempts by the current thread or the resources consumed by those attempts).

Abstract: A data stream processing system is provided that utilizes independent sites to process user-defined inquires over dynamic, continuous streams of data. A mechanism is provided for processing these inquiries over the continuous streams of data by matching new inquiries to previously submitted inquiries. The job plans containing sets of processing elements that were created for both the new inquiry and the previous inquiries are compared for consistency in input and output formatting and commonality of processing elements used. In accordance with the comparison, the new job plan, previous job plans or a combination of the new and previous job plans are used to process the new inquiry. Based on the results of processing the new inquiry, a determination is made regarding which job plans are used for future inquiries.

Abstract: An operating system of a data processing system receives a request from a first process to acquire an exclusive lock for accessing a resource of the data processing system. A second priority of a second process is increased to reduce total execution time. The second process is currently in possession of the exclusive lock for performing a transactional operation with the resource. The second priority was lower than a first priority of the first process. The operating system notifies the second process to indicate that another process is waiting for the exclusive lock to allow the second process to complete or roll back the transactional operation and to release the exclusive lock thereafter.

Abstract: Techniques for business event processing are presented. Methods and apparatuses disclosed herein may operate to receiving a request to perform an operation on a listing previously published by an online marketplace; to identify at least one additional listing having certain characteristics in common with the listing from a plurality of previously published listings including the listing; and to automatically perform the operation on the at least one additional listing. The operation may include performing an inventory check on the at least one additional listing.

Abstract: A system for processing a batch job comprises a processor and a memory. The processor is configured to receive a job name for a job submitted to execute, to receive one or more job parameters, and to determine one or more nodes to run the job. The processor is configured to determine one or steps, where for each step: a step is executed on a node using a state of data associated with a start state of the step; and upon completion of executing the step, a result is stored to a durable storage. The durable storage stores the state of data associated with the start state of the step and the completion state of the step and are accessible by other execution processes as associated with either the start state of the step or the completion state of the step. The memory of the system is coupled to the processor and configured to provide processor with instructions.

Abstract: A batched unit of work is associated with a plurality of messages for use with a data store. A backout count, associated with a number of instances that work in association with the batched unit of work, is backed out. A backout threshold is associated with the backout count. A commit count is associated with committing the batched unit of work in response to successful commits for a predefined number of the plurality of messages. A checker checks whether the backout count is greater than zero and less than the backout threshold. An override component, responsive to the backout count being greater than zero and less than the backout threshold, overrides the commit count and commits the batched unit of work for a subset of the plurality of messages.

Abstract: Hybrid transaction memory systems and accompanying methods. A transaction to be executed is received, and an initial attempt is made to execute the transaction in a hardware path. Upon a failure to successfully execute the transaction in the hardware path, an attempt is made to execute the transaction in a hardware-software path. The hardware-software path includes a software path and at least one hardware transaction.

Abstract: A computer readable medium includes: storing an evaluation value and relating, to a plurality of evaluating target information, the evaluation value indicative of a possibility that a second processing for sequentially executing a first processing that is predetermined for each of the evaluating target information is successful; updating the evaluation value related to the evaluating target information based on a content of a third processing that is predetermined for the evaluating target information or information to be a processing target of the first processing corresponding to the evaluating target information when the third processing is executed; and determining an executing order in a sequential execution of the second processing for each of the evaluating target information based on the evaluation value.

Abstract: A computing system includes a plurality of computing units, a tiered storage unit including a first storage medium and a second storage medium having a transfer rate lower than that of the first storage medium, and connected to a plurality of the computing units; and a system management unit connected to a plurality of the computing units and the tiered storage unit. The system management unit creates a computation job execution schedule for a plurality of the computing units or obtains the computation job execution schedule from other unit in the computing system, plans a data migration in the tiered storage unit according to the execution schedule using a predetermined method, and instructs the tiered storage unit to migrate a data based on the plan.

Abstract: An apparatus and methods are disclosed for intelligently determining when to merge transactions to backup storage. In particular, in accordance with the illustrative embodiment, queued transactions may be merged based on a variety of criteria, including, but not limited to, one or more of the following: the number of queued transactions; the rate of growth of the number of queued transactions; the calendrical time; estimates of the time required to execute the individual transactions; a measure of importance of the individual transactions; the transaction types of the individual transactions; a measure of importance of one or more data updated by the individual transactions; a measure of availability of one or more resources; a current estimate of the time penalty associated with shadowing a page of memory; and the probability of rollback for the individual transactions, and for the merged transaction.

Abstract: According to the present invention, any deficiency caused by the use of a resource, which is in a different state from that assumed upon workflow registration, can be prevented. The workflow processing method of the present invention acquires and holds a resource or feature quantity, which is required upon workflow execution, so as to employ it upon workflow execution. In this manner, after execution of the workflow, the present invention can avoid the workflow execution result which is not intended by a user who has registered the workflow.

Abstract: Embodiments relate to routing a distributed transaction. An aspect includes receiving and storing distributed transaction initiation information from a transaction manager. Another aspect includes sending an okay message to the transaction manager. Another aspect includes receiving a distributed transaction having at least one function type from the transaction manager. Another aspect includes determining a resource manager for the distributed transaction based on the function type of the distributed transaction. Another aspect includes sending, based on the resource manager being ready, the distributed transaction to the determined resource manager.

Abstract: A distributed computing method and distributed computing system are provided. Said distributed computing method includes: distributedly computing an input task stream; reducing the computation results of said distributed computation; and storing the reduced computation results in reduction buffers. Said distributed computing system includes distributed computing device which are used for the distributed computation, multiple reduction units which are used for reducing the computation results of said distributed computation, one or more reduction buffer which are used for storing reduced computation results, and a reduction control device which is used for controlling the reduction from said computation results to said reduction buffers and the access to the reduction buffer.

Abstract: Techniques are provided to facilitate faster live migration of a virtual server from one physical server to another physical server by pausing IO activity of the virtual server and slowing memory state changes for CPU-bound activity of the virtual server during the live migration.

Abstract: Mechanisms are provided for executing a batch job associated with a mobile device. A batch job data structure is retrieved that defines a batch job having a plurality of operations to be executed and a scheduling rule having one or more criteria is retrieved. The one or more criteria comprises at least one of a geographical position criteria or a geographical movement criteria for defining a position or path of motion of the mobile device required for initiating execution of the batch job. A determination is made as to whether one of current or predicted future position or path of motion of the mobile device satisfies the criteria of the scheduling rule. In response to the current or predicted future position or path of motion of the mobile device satisfying the criteria of the scheduling rule, execution of the batch job is initiated.

Abstract: A system and a method are disclosed for batch execution of system calls in an operating system. In one implementation, a processing device configures a system call batching buffer table in a user space of an operating system, the system call batching buffer table including a plurality of system call units, associates a system call number with the system call batching buffer table, and issues a trap instruction to a kernel of the operating system to execute at least one of the plurality of system call units, the trap instruction including the system call number.

Abstract: An apparatus and method is disclosed for a computer processor configured to access a memory shared by a plurality of processing cores and to execute a plurality of memory access operations in a transactional mode as a single atomic transaction and to suspend the transactional mode in response to determining an implicit suspend condition, such as a program control transfer. As part of executing the transaction, the processor marks data accessed by the speculative memory access operations as being speculative data. In response to determining a suspend condition (including by detecting a control transfer in an executing thread) the processor suspends the transactional mode of execution, which includes setting a suspend flag and suspending marking speculative data. If the processor later detects a resumption condition (e.g., a return control transfer corresponding to a return from the control transfer), the processor is configured to resume the marking of speculative data.

Abstract: Disclosed are a system, method and computer-readable medium relating to managing resources within a compute environment having a group of nodes or computing devices. The method comprises, for each node in the compute environment: traversing a list jobs having a fixed time relationship, wherein for each job in the list, the following steps occur: obtaining a range list of available timeframes for each job, converting each availability timeframe to a start range, shifting the resulting start range in time by a job offset, for a first job, copying the resulting start range into a node range, and for all subsequent jobs, logically AND'ing the start range with the node range. Next, the method comprises logically OR'ing the node range with a global range, generating a list of acceptable resources on which to start and the timeframe at which to start and creating reservations according to the list of acceptable resources for the resources in the group of computing devices and associated job offsets.

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 method and apparatus for managing database transactions in a web service messaging environment. In one embodiment, the method includes receiving a web service call indicating a beginning of a database transaction from a client, and creating a database transaction in response to this web service call. The method further includes receiving subsequent web service calls from the client, and for each subsequent web service call, associating a corresponding web service call with the database transaction, and performing the corresponding web service call. Afterwards, the database transaction is terminated upon committing or rolling back data resulting from the subsequent web service calls.

Abstract: A system and method for managing transactions in an application server is described. In some example embodiments, the system registers to receive notifications from a timeout manager associated with a transaction (e.g., a database query). If the transaction becomes locked or runs longer than anticipated, the system receives a notification indicating a timeout event. The system, upon receiving the event notification, may then cancel the transaction or perform other actions to notify an application that initiated the transaction, such as via a newly created thread.

Abstract: A method and device for converting first program code into second program code, such that the second program code has an improved execution on a targeted programmable platform, is disclosed. In one aspect, the method includes grouping operations on data for joint execution on a functional unit of the targeted platform, scheduling operations on data in time, and assigning operations to an appropriate functional unit of the targeted platform. Detailed word length information, rather than the typically used approximations like powers of two, may be used in at least one of the grouping, scheduling or assigning operations.

Abstract: A component manages and minimizes latency introduced by virtualization. The virtualization component determines that a currently scheduled guest process has executed functionality responsive to which the virtualization component is to execute a virtualization based operation, wherein the virtualization based operation is one that is not visible to the guest operating system. The virtualization component causes the guest operating system to de-schedule the currently scheduled guest process and schedule at least one separate guest process. The virtualization component then executes the virtualization based operation concurrently with the execution of the at least one separate guest process. Responsive to completing the execution of the virtualization based operation, the virtualization component causes the guest operating system to re-schedule the de-scheduled guest process.

Abstract: The present invention provides for the adjustment of the timing of a scheduled job including determining when the execution time of a scheduled job is within a predetermined time period. Prior to this time, a job execution notification is generated and submitted to an end user. The notification includes a request for time delay in the event the job should not be executed on the time noted. If the job should be delayed, a user may submit a delay request including a time delay. Upon receipt, an internal timing parameter is temporarily reset based on the delay request. The job is then automatically rescheduled for the prescribed time. If no other delay is incurred, once the job is executed, the internal timing parameter is then reset to its original time value.

Abstract: A method and system in a Service Orchestration Architecture environment that provides rules engine-based service orchestration, task, and alert management for collaboration between one or more nodes of operation. The system provides multiple levels of configurability. In one aspect, the system includes a rules engine to define the command and control (C2) service orchestration.

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: In an embodiment, a method is provided. The method includes managing user-level threads on a first instruction sequencer in response to executing user-level instructions on a second instruction sequencer that is under control of an application level program. A first user-level thread is run on the second instruction sequencer and contains one or more user level instructions. A first user level instruction has at least 1) a field that makes reference to one or more instruction sequencers or 2) implicitly references with a pointer to code that specifically addresses one or more instruction sequencers when the code is executed.

Abstract: An apparatus and method is described herein for adaptive thread scheduling in a transactional memory environment. A number of conflicts in a thread over time are tracked. And if the conflicts exceed a threshold, the thread may be delayed (adaptively scheduled) to avoid conflicts between competing threads. Moreover, a more complex version may track a number of transaction aborts within a first thread that are caused by a second thread over a period, as well as a total number of transactions executed by the first thread over the period. From the tracking, a conflict ratio is determined for the first thread with regard to the second thread. And when the first thread is to be scheduled, it may be delayed if the second thread is running and the conflict ratio is over a conflict ratio threshold.

Abstract: One embodiment of the present invention enables threads executing on a processor to locally generate and execute work within that processor by way of work queues and command blocks. A device driver, as an initialization procedure for establishing memory objects that enable the threads to locally generate and execute work, generates a work queue, and sets a GP_GET pointer of the work queue to the first entry in the work queue. The device driver also, during the initialization procedure, sets a GP_PUT pointer of the work queue to the last free entry included in the work queue, thereby establishing a range of entries in the work queue into which new work generated by the threads can be loaded and subsequently executed by the processor. The threads then populate command blocks with generated work and point entries in the work queue to the command blocks to effect processor execution of the work stored in the command blocks.

Abstract: Even if the process for permitting execution of software is enabled in accordance with first license information, upon transmitting an invalidation signal from the invalidation signal transmitter 116, the execution of the process for permitting execution of software is limited in accordance with second license information. Thus, the invalidation signal can limit the execution of the process for permitting execution of software in accordance with specific license information and the execution of the licensed software without fail.

Abstract: A method for executing a transaction in a data processing system initiates the transaction by a transactional-memory system coupled to that memory component. The method includes initiating the transaction by a transactional-memory system that is part of a memory component of the data processing system. The transaction includes instructions for comparing multiple parameters, and aborting the transaction by the transactional-memory system based upon a comparison of the multiple parameters.

Abstract: A batching module that inspects call stacks within a stack evaluator to identify current expressions that can be evaluated in batch with other expressions. If such expressions are identified, the corresponding stacks are blocked from further processing and a batch processing request for processing the expressions is transmitted to the application server. The application server processes the expressions in batch and generates a value for each of the expressions. The blocked stacks are then populated with the values for the expressions.

Abstract: An image processing apparatus capable of registering in a memory the execution time interval or the next execution time for the periodic processing periodically executed, comprising: a unit adapted to registration for registering in the memory the execution time interval or the next execution time for a second periodic processing after registering in the memory the execution time interval and the next execution time for a first periodic processing; and a unit adapted to revising for comparing the next execution time for said second periodic processing and the next execution time for said first periodic processing according to the registration by said unit adapted to registration, and revising either of the next execution time for said second periodic processing and the next execution time for said first periodic processing.

Abstract: When there is a job activation request accompanied with variable information in which an execution attribute and an identifier of a job are associated, a job definition in which an execution attribute is described with an arbitrary identifier is referred, and based on the variable information, an identifier within the job definition is replaced with the execution attribute to create a job. Then, the job created in this manner is activated.

Abstract: A system for processing a batch of jobs is provided. The system comprises a plurality of processing elements that are characterized in that each processing element is configured to sequentially process jobs with an estimated process time within a respective allotted range of values. The jobs may comprise packets of data within a data processing system. The system is particularly useful for processing data corresponding to translated text in a text translation system.

Abstract: Systems (100) and methods (200) for managing transactional processing. The methods involve executing a first transaction (120) which is blocked by an exclusive lock of at least one second transaction (110) from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction.

Abstract: Systems and methods for detecting end of a transaction in a computing environment are provided. The method comprises determining a target area in a graphical user environment displayed on a display screen, wherein a change is expected to occur when end of a transaction is reached; masking the target area at least partially to remove content included in the target area that is present before or after the transaction was initiated; monitoring the target area for change in content; and detecting the end of the transaction when the content of the target area has changed.

Abstract: Systems (100) and methods (200) for managing transactional processing. The methods involve executing a first transaction (120) which is blocked by an exclusive lock of at least one second transaction (110) from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction.

Abstract: Operating system virtual memory management for hardware transactional memory. A system includes an operating system deciding to unmap a first virtual page. As a result, the operating system removes the mapping of the first virtual page to the first physical page from the virtual memory page table. As a result, the operating system performs an action to discard transactional memory hardware state for at least the first physical page. Embodiments may further suspend hardware transactions in kernel mode. Embodiments may further perform soft page fault handling without aborting a hardware transaction, resuming the hardware transaction upon return to user mode, and even successfully committing the hardware transaction.