Abstract: Described are techniques for consolidating tasks into a composite job. A server processes a composite request to create a composite job on the server. The composite request comprises a plurality of nested job create requests. The composite job comprises a plurality of jobs. Each job in the plurality of jobs corresponds to a job create request in the plurality of nested job create requests. The server generates a dependency tree indicating a dependency of each job in the plurality of jobs. The server executes the composite job in accordance with the dependency tree. On determining that a first job is dependent on a second job, the server executes the second job prior to executing the first job. The server passes the output of the second job as input to the first job.

Abstract: Managing the execution of a computer software application by duplicating a primary instance of a computer software application during its execution in a primary execution context to create multiple duplicate instances of the computer software application in corresponding duplicate execution contexts, and effecting a selection of a different candidate subset of predefined elements for each of the duplicate instances.

Abstract: Managing the execution of a computer software application by duplicating a primary instance of a computer software application during its execution in a primary execution context to create multiple duplicate instances of the computer software application in corresponding duplicate execution contexts, and effecting a selection of a different candidate subset of predefined elements for each of the duplicate instances.

Abstract: A method and a system embodying the method for pre-fetching and processing work for processor cores in a network processor, comprising requesting pre-fetch work by a requestor; determining that the work may be pre-fetched for the requestor; searching for the work to pre-fetch; and pre-fetching the found work into one of one or more pre-fetch work-slots associated with the requestor is disclosed.

Abstract: A method for managing a background application is provided. The method includes determining whether an operating feature of the background application satisfies a preset condition, and when it is determined that the operating feature of the background application satisfies the preset condition, displaying an operating interface in a foreground interface of a mobile device for a user to close the background application.

Abstract: Methods and apparatus for power-based scheduling of tasks among processors are disclosed. A method may include executing processor executable code on one or more of the processors to prompt a plurality of executable tasks for scheduling among the processors. Processor-demand information is obtained about the plurality of executable tasks in addition to capacity information for each of the processors. Processor power information for each of the processors is also obtained, and the plurality of executable tasks are scheduled on the lowest power processors where processor-demands of the tasks are satisfied.

Abstract: A workflow interpreter service that interprets a workflow definition language for specifying a workflow definition. Further, the workflow definition language provides features for maintaining control over data flows for data that is passed from one state to another among states of a state machine for a workflow. Such control over data flow in between states allows for a given workflow to be processed incrementally, and among multiple different computing resources.

Abstract: Embodiments provide a computerized method for adapting automating test scripts, said method including: utilizing at least one processor to execute computer code that performs the steps of: receiving, at an input device, an original test script created to test an application; utilizing the original test script to test, using the processor, a variant of the application; identifying, using the processor, failures in the original test script when the variant of the application is being tested; and modifying, using the processor, the original test script to overcome the identified failures.

Abstract: In accordance with embodiments of the present disclosure, an information handling system may include a processor, a target information handling resource for receiving input/output requests from an operating system executing on the processor, and a thermal filter driver comprising a program of instructions embodied in computer-readable media and executable by the processor. The thermal filter driver may be configured to, in response to issuance of one or more input/output requests to the target information handling resource, perform experimentation on an input/output queue comprising the one or more input/output requests and based on the experimentation, determine modifications to be made to the input/output queue in order to provide a minimal impact to performance of input/output requests at the target information handling resource while satisfying thermal constraints of the target information handling resource.

Abstract: A method comprising executing an application on a JAVA virtual machine, the JAVA virtual machine executing on a computing device, the application having allocated memory, monitoring, by the JAVA virtual machine, memory consumed by the application during execution, determining, based on the consumed memory, that the allocated memory is to be adjusted; and adjusting, by the JAVA virtual machine, the allocated memory during runtime without restarting the execution of the application.

Abstract: Example embodiments of the present invention relate to a method, an apparatus, and a computer program product for performing file system activities across administrative boundaries between a plurality of file systems. The method includes receiving a worldwide job to perform on a plurality of file systems, managing the worldwide job, and receiving results of the worldwide job from the plurality of file systems.

Abstract: A solution is proposed for deploying a virtual appliance onto a data processing system. A corresponding, method comprises instantiating the virtual appliance with a basic configuration onto the data processing system, determining a value of each one of a set of environmental features at a virtual data processing environment associated with the virtual appliance, and downloading a set of local software programs corresponding to the values of at least part of the environmental features onto the virtual appliance.

Abstract: A solution is proposed for deploying a virtual appliance onto a data processing system. A corresponding method comprises instantiating the virtual appliance with a basic configuration onto the data processing system, determining a value of each one of to set of environmental features of a virtual data processing environment associated with the virtual appliance, and downloading a set of local software programs corresponding to the values of at least part of the environmental features onto the virtual appliance.

Abstract: A system for executing an accelerator call function includes a processor, a register context memory, an accelerator scheduler, multiple accelerator cores, and a stack memory. The processor executes a program task. The processor includes a register that stores task context information of the program task. The accelerator call function includes an accelerator operation. The processor forwards the accelerator operation to the accelerator scheduler. Concurrently, the processor stores the task context information in the register context memory. The accelerator scheduler identifies one of the accelerator cores and forwards the accelerator operation to the identified core. The identified core executes the accelerator operation, generates a return value, and stores the return value in the register context memory, which in turn provides the return value and the task context information to the processor.

Abstract: Managing updates to executable programming code on a computer system in a computer network. A maintenance service utility is configured to launch a maintenance procedure at a specified time during operation of the computer system. Operation of a maintenance timer utility is activated during startup of the computer system to track and monitor the amount of time the computer system has been operating since startup. The maintenance service utility determines if there any updates to the executable programming code that require installation. The maintenance procedure is launched after a specified time if there are updates to the executable programming code. The computer system is automatically rebooted to install the updates to the executable programming code. A maintenance service editor utility enables the maintenance service utility to be configured to launch the maintenance procedure after a specified time if there are updates to the executable programming code.

Abstract: Data can be categorized into facts, information, hypothesis, and directives. Activities that generate certain categories of data based on other categories of data through the application of knowledge which can be categorized into classifications, assessments, resolutions, and enactments. Activities can be driven by a Classification-Assessment-Resolution-Enactment (CARE) control engine. The CARE control and these categorizations can be used to enhance a multitude of systems, for example diagnostic system, such as through historical record keeping, machine learning, and automation. Such a diagnostic system can include a system that forecasts computing system failures based on the application of knowledge to system vital signs such as thread or stack segment intensity and memory heap usage. These vital signs are facts that can be classified to produce information such as memory leaks, convoy effects, or other problems.

Abstract: An apparatus includes a processor and a storage storing instructions causing the processor to: maintain a federated area; receive a request to perform a job flow with a data set from a remote device; retrieve a job flow definition specifying the tasks of the job flow from the federated area; determine whether there is an instance log in the federated area generated by a previous performance of the job flow with the data set; in response to there being such an instance log, compare the version specified in the instance log of each task routine for each task to the most recent version stored in the federated area; and in response to each version specified in the instance log matching the most recent version, provide the remote device with access to a result report generated by the previous performance in lieu of generating a new result report.

Abstract: An apparatus includes a processor and a storage storing instructions causing the processor to: maintain a federated area; receive a request to perform a job flow with a data set from a remote device; retrieve a job flow definition specifying the tasks of the job flow from the federated area; determine whether there is an instance log in the federated area generated by a previous performance of the job flow with the data set; in response to there being such an instance log, retrieve the version specified in the instance log of each task routine for each task from the federated area; in response to there being no such instance log, retrieve the most recent version of each task routine; perform the job flow with the retrieved versions of the task routines and the data set to generate a result report; and provide the result report to the remote device.

Abstract: Various systems and methods to perform efficiently a first processing task in conjunction with a plurality of data sets. A first code sequence comprises a plurality of general commands, and a specific command including a description of a first data processing task to be performed in conjunction with the data sets. The general commands are received and processed in a standard manner. The specific command is identified automatically by its nature, and the description within the specific command is then converted into a first sequence of executable instructions executable by a plurality of compute elements holding the plurality of data sets. The ultimate result is an efficient implementation of the first processing task. In some embodiments, the implementation of the first processing task is assisted by a pre-defined procedure that allocates the data sets to the compute elements and shares instances of executable instructions with the compute elements.

Abstract: A method for non-preemption of interchangeable tasks is disclosed. The method for non-preemption of interchangeable tasks includes identifying a first task assigned to a first time slice, identifying a second task assigned to a subsequent time slice, comparing the first task to the second task, identifying whether the first task and the second task are interchangeable tasks, and executing the first task during the subsequent time slice in response to the first task and the second task being interchangeable. The first task may be currently executing on a processor or may be scheduled to execute on the processor.