A graph-based program specification includes: a plurality of components, each corresponding to a processing task and including one or more ports, including scalar data ports for sending or receiving a single data element and collection data ports for sending or receiving a collection of multiple data elements; and one or more links, each connecting an output port of an upstream component to an input port of a downstream component. Prepared code is generated representing subsets of the plurality of components, including: identifying one or more subset boundaries, including identifying one or more links connecting a collection data port of a component to a scalar data port of a component; forming the subsets based on the identified subset boundaries; and generating prepared code for each formed subset that when used for execution by a runtime system causes processing tasks corresponding to the components in each formed subset to be performed.

A method is described for processing keyed data items that are each associated with a value of a key, the keyed data items being from a plurality of distinct data streams, the processing including collecting the keyed data items, determining, based on contents of at least one of the keyed data items, satisfaction of one or more specified conditions for execution of one or more actions and causing execution of at least one of the one or more actions responsive to the determining.

Systems and methods may be used to provide and implement a state machine in a display software user interface environment, and used to handle events and actions associated with the state machine. In one example embodiment, a virtual display environment provided by an engine is interfaced with a state machine that is configured to interpret various state machine definitions corresponding to states occurring in the virtual display environment. The state machine definitions may be used to determine how a particular state of a virtual item in the display environment may be represented, interacted with, and transitioned into another state. Use of the state machine definitions may enable representation of complex scenarios for virtual objects and events in the display environment in a unified definition format, without requiring specialized programming or scripting commands to implement the scenarios.

Methods, systems and computer program products are provided for automated runtime configuration for dataflows to automatically select or adapt a runtime environment or resources to a dataflow plan prior to execution. Metadata generated for dataflows indicates dataflow information, such as numbers and types of sources, sinks and operations, and the amount of data being consumed, processed and written. Weighted dataflow plans are created from unweighted dataflow plans based on metadata. Weights that indicate operation complexity or resource consumption are generated for data operations. A runtime environment or resources to execute a dataflow plan is/are selected based on the weighted dataflow and/or a maximum flow. Preferences may be provided to influence weighting and runtime selections.

A system and method for automatically generating a dependency graph based on input and output requirements of information. The method includes obtaining, by a processing device, an object representing a plurality of modules executing on one or more processing devices. The plurality of modules is associated with a plurality of input requirements and a plurality of output requirements. Each module is configured to generate an output dataset of a respective output requirement of the plurality of output requirements based on an input dataset of a respective input requirement of the plurality of input requirements. The method includes generating, by the processing device, a dependency hierarchy of the plurality of modules based on the plurality of input requirements and the plurality of output requirements. The dependency hierarchy indicates one or more routes for the output datasets between at least a subset of the plurality of modules.

An electronic system implements a software application described in the form of a graph of the Kahn network type, and includes actors. At least one of the actors includes a processor, and at least another one of the actors includes a hardware accelerator. Buffer memories are coupled between the actors. A central processor is configured to enable communications between the actors according to a communications and synchronization protocol. The processor and the hardware accelerator are configured to use different individual communications protocols.

A system and method for facilitating self-device for managing functionality of a service is disclosed. One or more service components associated with a service are configured in at least one database. Further, the processor suggests one or more predefined action for managing the service. The one or more predefined actions are executed according to the one or more self-service components.

Distributed processing of a data collection includes receiving information for configuring a distributed processing system. A first configuration of components is formed including sources of data elements and workers configured to process data elements, distributed among computing resources. Each data element includes a partition value that identifies a subset of the workers according to a partition rule. Data elements are accepted from the sources for a first part of the data collection in a first processing epoch and the data elements are routed through the first configuration. After accepting a first part of the data collection, change of configuration is initiated to a second configuration. A succession of two or more transitions between configurations of components is performed to a succession of modified configurations, a last of which corresponds to the second configuration. Further data elements are accepted from sources of the second configuration in a second processing epoch.

An impact analysis-based task redoing method using an impact analysis calculation apparatus and a one-click resetting apparatus includes receiving an impact analysis request, where the impact analysis request includes a source procedure identifier, an impact start time, and an impact end time; obtaining a dependency list and a procedure information list of a source procedure according to the source procedure identifier; obtaining a period of the source procedure and a period of a target procedure according to the source procedure identifier and the target procedure identifier in the dependency list; obtaining, according to the period of the source procedure, the period of the target procedure, the impact start time, and the impact end time, a procedure instance list corresponding to each procedure identifier included in the procedure instance list; and sending the procedure instance list and the procedure information list.

A smart tuple manager includes a mechanism for merging a smart tuple, and for automatically generating one or more classes from existing classes when a smart tuple is merged. When a first smart tuple and a second smart tuple are merged into a new third smart tuple, a class for the third smart tuple is automatically generated from the classes for the first and second smart tuples. The class for the third smart tuple is a superset of the classes for the first and second smart tuples. After a class is automatically generated, new code segments may be added to the class as needed.