Abstract: Apparatuses, methods, and systems for enabling system management mode in a secure system are disclosed. In one embodiment, a processor includes sub-operating-system mode logic, virtual machine logic, and control logic. The sub-operating-system mode logic is to support a sub-operating-system mode. The virtual machine logic is to support virtualization. The control logic is to prevent virtualization from being enabled when the sub-operating-system mode is disabled.

Abstract: Concepts and technologies are described herein for providing task continuity and supporting task completion across devices and time. A task management application is configured to monitor one or more interactions between a user and a device. The interactions can include the use of the device, the use of one or more applications, and/or other tasks, subtasks, or other operations. Predictive models constructed from data or logical models can be used to predict the attention resources available or allocated to a task or subtask as well as the attention and affordances available within a context for addressing the task and these inferences can be used to mark or route the task for later reminding and display. In some embodiments, the task management application is configured to remind or execute a follow-up action when a session is resumed. Embodiments include providing users with easy to use gestures and mechanisms for providing input about desired follow up on the same or other devices.

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: A method for processing a plurality of jobs in a production environment may include receiving a plurality of jobs and receiving one or more instructions into a workflow management system to process the plurality of jobs. The one or more instructions may include a setup characteristic. The method may also include clustering, by the workflow management system, the plurality of jobs into super-groups based on the setup characteristic, determining, by the workflow management system, a processing sequence based on the clustering and processing the jobs according to the determined processing sequence.

Abstract: A system and method is disclosed for creating a reusable control from various applications or portions of applications. Using a pre-existing application or one specifically developed for the control, a developer programmatically declares which functionalities of the original application are to be included in the new control. This control building logic becomes a part of the application code. On execution of the application with the added control building logic, the native code that will re-create the control functionality is automatically generated. The control developer may now extend the generated code using simple Object Oriented Programming (OOP) inheritance to add properties and parameters that will control its behavior. The resulting control may then be referenced by other developers when creating a new software application.

Abstract: A method of compiling code includes ordering instructions that protect and release critical sections in the code to improve parallel execution of the code according to an intrinsic order of the critical sections. According to one embodiment, the intrinsic order of the critical sections in the code is determined from data dependence and control dependence of instructions in the critical sections, and additional dependencies are generated to enforce the intrinsic order of the critical sections. Other embodiments are described and claimed.

Abstract: A runtime system implemented in accordance with the present invention provides an application platform for parallel-processing computer systems. Such a runtime system enables users to leverage the computational power of parallel-processing computer systems to accelerate/optimize numeric and array-intensive computations in their application programs. This enables greatly increased performance of high-performance computing (HPC) applications.

Abstract: Methods, systems, and techniques that enable enhanced coordination and management of a plurality of servers cooperatively operating in a cluster of servers. In one implementation, a plurality of enhanced Virtual Desktop Management (VDM) Servers operating in a Federated Virtual Desktop Management (VDM) Cluster are provided. Each of the enhanced VDM Servers active in the Federated VDM Cluster use federated task information pertaining to and derived from various executing federated tasks. However, only a single selected one of the plurality of enhanced VDM Servers is executing a particular one of the federated tasks at a time so that each federated task is continuously running somewhere in the Federated VDM Cluster.

Abstract: Techniques are provided for deploying applications hosted by an application service provider. An application in a first environment is automatically deployed to a second environment in response to receiving a request over a network from the party for whom the second environment is being hosted. The first environment may be an environment where applications are developed by the party over the network. Deployment of the application may entail provisioning of an environment for the application.

Abstract: A first instance and a second instance of an activity of a process model may be executed, the first instance, the second instance, and the activity being associated with activity state data describing one or more states thereof. A co-process associated with the first instance, the second instance, and the activity may be spawned, and the co-process may be executed based on the activity state data.

Abstract: An electronic system comprises a memory, a parser, and a device driver. A plurality of applications and a document are stored in a user space of the memory, the document storing configuration parameters. The parser module parses the document to retrieve the parameters in response to invocation from at least one application. The device driver creates data structure for the parameters in the kernel space of the memory, thus to facilitate a plurality of programs to execute different functions of the system by commonly utilizing the parameters through the device driver.

Abstract: Methods and systems for coordinating sharing of resources among a plurality of tasks operating in parallel in a document presentation environment while host communications and task processing may be performed asynchronously with respect to one another. A mapped resource manager manages activation (addition) and deactivation (deletion) of resources shared by a plurality of tasks operating in parallel to assure that each task may continue processing with a consistent set of files as resources despite changes made by other tasks or by operator intervention.

Abstract: Interacting with an external environment of a segmented virtual machine is disclosed. An indication that a communication with an external environment is desired is received. It is determined whether the communication can be initiated directly from a core virtual machine of the segmented virtual machine without initiating the communication from a shell virtual machine of the segmented virtual machine. An attempt to initiate the communication is made based as at least in part on the determination.

Abstract: A data push service method and system are provided. The service data push method includes: providing a device with data push information regarding service data to be pushed to at least one device; and pushing the service data to the device when receiving a data push service request from the at least one device. Accordingly, the server does not need to maintain and manage information of the at least one device.

Abstract: Systems and processes may perform actions on a huge set of business objects, often in a batch process. A mass data run object may be instantiated based, at least in part, on a batch process request in a service-oriented architecture. Mass data run objects may include, potentially among other things, description elements and selection elements. The batch process can then be executed on a plurality of data elements using the mass data run object and its selection element.

Abstract: An analysis tool analyzes a software system by simulating runtime binding in order to identify function-level code dependencies. The tool receives a list of one or more entry point functions and identifies other functions that can be invoked if the entry point functions are executed. The tool generates a tracker graph having tracker nodes representing classes that can be instantiated from the entry points. Each tracker node identifies functions/methods in that class that can be invoked from the entry points. If the software system uses an object-relational mapping to a database, the tracker graph also identifies the portions of the database that can be accessed from the entry points. The tool can be used to partition the functionalities of the software system into core and non-core functionalities in order to support upgrading while maintaining high-availability.

Abstract: Various technologies and techniques are disclosed that dynamically implement method selections based on declarative requirements and interaction scope. Requirements that describe when each of multiple methods that can perform a particular operation should be called can be declared using a declarative syntax. Based upon a program event, the system determines that a request should be made to select a most appropriate method of the available methods to call to perform the particular operation. Upon receiving the request to select the most appropriate method, a sort process is executed that uses an interaction scope of a current user context in combination with a plurality of sort rules to generate a sorted list of the available methods into a particular order based upon appropriateness. A most appropriate method, if any, is returned to the calling application, and then called to perform the particular operation.

Abstract: A computer readable storage medium including executable instructions for managing a task. Instructions include receiving a request. Instructions further include determining a task corresponding with the request using a request-to-task mapping. Instructions include obtaining a task entry corresponding with the task from a task store, where the task entry associates the task with an action and a predicate for performing the action. Instructions further include creating a task object in a task pool using the task entry. Instructions further include receiving an event notification at the task engine, where the event notification is associated with an event. Instructions further include determining whether the predicate for performing the action is satisfied by the event. Instructions further placing the task object in a task queue when the predicate for performing the action is satisfied by the event.

Abstract: A computer readable storage medium including executable instructions for heuristics-based task scheduling. Instructions include receiving a first event notification associated with a first event, where the first event is determined from the first event notification. Instructions further include determining whether a predicate for an action is satisfied by the first event, where the action predicate, the action, and an action parameter are associated with a task object in a task pool. Instructions further include obtaining the action parameter when the action predicate is satisfied by the first event, where a priority is assigned using a heuristics policy to the task object based on the action parameter. Instructions further include inserting the task object into a task queue using the assigned priority. The action associated with the task object is performed by an execution thread. The performance of the action is a second event associated with a second event notification.

Abstract: An apparatus, program product and method support the deallocation of a data structure in a multithreaded computer without requiring the use of computationally expensive semaphores or spin locks. Specifically, access to a data structure is governed by a shared pointer that, when a request is received to deallocate the data structure, is initially set to a value that indicates to any thread that later accesses the pointer that the data structure is not available. In addition, to address any thread that already holds a copy of the shared pointer, and thus is capable of accessing the data structure via the shared pointer after the initiation of the request, all such threads are monitored to determine whether any thread is still using the shared pointer by determining whether any thread is executing program code that is capable of using the shared pointer to access the data structure.