MANAGING INTERFACES FOR DATAFLOW GRAPHS COMPOSED OF SUB-GRAPHS
    1.
    发明申请
    MANAGING INTERFACES FOR DATAFLOW GRAPHS COMPOSED OF SUB-GRAPHS 审中-公开
    管理组合子图的数据流格局界面

    公开(公告)号:WO2015085152A1

    公开(公告)日:2015-06-11

    申请号:PCT/US2014/068754

    申请日:2014-12-05

    CPC classification number: G06F8/10 G06F8/34

    Abstract: Specifications of dataflow graphs are generated and/or combined. A sub-graph interface (123) of a dataflow graph includes one or more flow junctions. A flow junction (204D) representing a connection between: a flow of data outside the sub-graph interface, and a flow of data inside the sub-graph interface. In some embodiments, information is processed to generate a combined dataflow graph specification (300), including: identifying an association between the sub-graph interface and the first dataflow graph specification, for at least a first flow junction, determining a direction associated with transferring a value of a descriptor, and transferring a value of a descriptor according to the determined direction. In some embodiments, a link (229) is rendered between the first flow junction and a second flow junction based on user input indicating a relationship between a first descriptor and a second descriptor.

    Abstract translation: 生成和/或组合数据流图的规范。 数据流图的子图界面(123)包括一个或多个流路。 表示在子图界面之外的数据流与子图界面内的数据流的连接的流连接点(204D)。 在一些实施例中,处理信息以生成组合数据流图规范(300),包括:识别子图接口和第一数据流图规范之间的关联,用于至少第一流连接,确定与传送相关联的方向 描述符的值,并根据确定的方向传送描述符的值。 在一些实施例中,基于指示第一描述符和第二描述符之间的关系的用户输入,在第一流连接点和第二流动连接点之间呈现链接(229)。

    PROCESSING TRANSACTIONS IN GRAPH-BASED APPLICATIONS
    2.
    发明申请
    PROCESSING TRANSACTIONS IN GRAPH-BASED APPLICATIONS 审中-公开
    在基于图形的应用程序中处理交易

    公开(公告)号:WO2011038096A1

    公开(公告)日:2011-03-31

    申请号:PCT/US2010/049966

    申请日:2010-09-23

    CPC classification number: G06F9/466 G06F9/4494 G06F11/1474

    Abstract: A graph-based computation has a plurality of nodes representing graph components connected by one or more links representing data flows between the components. Preparing the computation includes: identifying at least a first set of components to process a plurality of transactions in the computation; and associating with a first transaction a first group of one or more data records and data operations corresponding to the data records, and associating with a second transaction a second group of one or more data records and data operations corresponding to the data records. Executing the computation to process at least the first and second transactions includes delaying execution by the first set of components of a data operation corresponding to an initial data record of the second group until after execution by the first set of components of a data operation corresponding to a final data record of the first group.

    Abstract translation: 基于图的计算具有多个节点,这些节点表示通过表示组件之间的数据流的一个或多个链接所连接的图组件。 准备计算包括:识别至少第一组分量以处理计算中的多个交易; 以及将与所述数据记录对应的第一组一个或多个数据记录和数据操作与第二事务相关联,以及将与所述数据记录对应的第二组一个或多个数据记录和数据操作与第一事务相关联。 执行计算以至少处理第一和第二事务包括延迟与第二组的初始数据记录相对应的数据操作的第一组分组的执行,直到第一组分组执行对应于 第一组的最终数据记录。

Patent Agency Ranking