A message based processor system (1) with a plurality of message based processor system cores (100) is proposed. Cores therein comprise a processor element controller that is configured to receive a message with an indication of a subset processor elements in the core to which it is directed as well as an indication of a target pattern, and to update the state value of the processor elements (Ei) in the subset in accordance with a specification of the target pattern. The processor element controller (PEC) is configurable in an address computation mode selected from a cyclic set of address computation modes, and configured to maintain its computation mode or assume a next address computation mode selected from the cyclic set dependent on a control value of a currently applied pattern element. Therewith a target pattern can efficiently specified.

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.

Specifications are input, comprising: a plurality of lanes in an environment for a controlled system; a plurality of lane maneuvers associated with the plurality of lanes; a plurality of lane subconditions associated with the controlled system; and a rule set comprising a plurality of rules, wherein a rule in the rule set specifies a rule condition and a rule action to take when the rule condition is satisfied, wherein the rule condition comprises a corresponding set of lane subconditions, and wherein the rule action comprises a corresponding lane maneuver. The controlled system is automatically navigated dynamically, at least in part by: monitoring the plurality of lane subconditions; evaluating rule conditions associated with the plurality of rules in the rule set to determine one or more rules whose corresponding rule conditions has been met; and executing one or more lane maneuvers that correspond to the one or more determined rules.

Disclosed herein is a method including receiving, from a user application, data to be transmitted from a source address to a destination address using a single connection through a network; and splitting the data into a plurality of packets according to a communication protocol. For each packet of the plurality of packets, a respective flowlet for the packet to be transmitted in is determined from a plurality of flowlets. Assignment of the flowlets to the packets can be dynamically adjusted based on utilization of the flowlets.

Some embodiments provide a non-transitory machine-readable medium that stores a program. The program observes a parameter associated with a computing system. Upon receiving a change associated with the parameter, the program further determines a routine definition from a set of routine definitions associated with the parameter. Each routine definition in the set of routine definitions specifies a set of instructions associated with a particular parameter associated with the computing system. The program also executes the set of instructions specified in the determined routine definition.

A computing environment of the invention comprises a graph structure, or multiple interconnected graph structures, the behavior of which is driven by data flow through interconnected nodes, independent of an external code base. The computer system may include a plurality of interconnected nodes in which data flow between the nodes drives execution of one or more functions and wherein code within the system is restricted to said nodes, each of which performs a dedicated function and an engine to drive communication between said system and operating hardware. Data are injected into a node and the node responds by outputting a value (data) to one or more subsequent nodes. Those nodes, in turn, output a behavior that is dependent upon the value (data) they received from one or more other nodes. Thus, it is the data that drives operation of the graph and not a traditional code stack.

A computing environment of the invention comprises a graph structure, or multiple interconnected graph structures, the behavior of which is driven by data flow through interconnected nodes, independent of an external code base. The computer system may include a plurality of interconnected nodes in which data flow between the nodes drives execution of one or more functions and wherein code within the system is restricted to said nodes, each of which performs a dedicated function and an engine to drive communication between said system and operating hardware. Data are injected into a node and the node responds by outputting a value (data) to one or more subsequent nodes. Those nodes, in turn, output a behavior that is dependent upon the value (data) they received from one or more other nodes. Thus, it is the data that drives operation of the graph and not a traditional code stack.

Disclosed examples to detect and annotate backedges in data-flow graphs include: a characteristic detector to store a node characteristic identifier in memory in association with a first node of a dataflow graph; a characteristic comparator to compare the node characteristic identifier with a reference criterion; and a backedge identifier generator to generate a backedge identifier indicative of a backedge between the first node and a second node of the dataflow graph based on the comparison, the memory to store the backedge identifier in association with a connection arc between the first and second nodes.

A type restriction contextually modifies an existing type descriptor. The type restriction is imposed on a data structure to restrict the values that are assumable by the data structure. The type restriction does not cancel or otherwise override the effect of the existing type descriptor on the data structure. Rather the type restriction may declare that a value of the data structure's type is forbidden for the data structure. Additionally or alternatively, the type restriction may declare that an element count allowable for a data structure's type is forbidden for the data structure. Type restriction allows optionality (where only a singleton value for a data structure is allowed), empty sets (where no value for a data structure is allowed), and multiplicity (where only a limited element count for a data structure) to be injected into a code set independent of data type. Type restriction allows certain optimizations to be performed.

Persistent storage contains a definition of a playbook and a plurality of subtasks for the playbook, wherein some of the subtasks are respectively associated with corresponding data sources that provide units of related information. One or more processors can: generate a representation of a graphical user interface including a menu pane, a subtask pane, and a related information pane, wherein the menu pane is populated with selectable objects representing the subtasks; receive an indication that a particular selectable object representing a particular subtask has been selected; determine that a particular data source corresponding to the particular subtask can provide a particular unit of the related information; obtain, from the particular data source, the particular unit of the related information; and update the representation to include details of the particular subtask in the subtask pane, and to include the particular unit of the related information in the related information pane.