公开(公告)号：US20160078118A1

公开(公告)日：2016-03-17

申请号：US14486668

申请日：2014-09-15

Applicant: Autodesk, Inc.

Inventor： Timothy E. Abla ,  Michael Alan Foster ,  John T. Koerner ,  Mikel L. Martin ,  Dennis M. Mulonas ,  Matthew W. Smith

IPC: G06F17/30

Abstract: A method, apparatus, system, computer program product, and computer readable storage medium provide the ability to parallel process hierarchical data. Hierarchical data is obtained. The hierarchical data is organized in a relationship graph having two or more nodes (consisting of parent nodes that are dependent on child nodes). The relationship graph requires bottom-up processing. Cycles are identified in the relationship graph. The relationship graph is leveled by traversing the graph and assigning all graph nodes into levels. The hierarchical data is processed by parallel processing the nodes in a first level of the one or more levels before parallel processing the nodes in a subsequent level.

Abstract translation: 方法，装置，系统，计算机程序产品和计算机可读存储介质提供并行处理分层数据的能力。 获得分层数据。 层次数据被组织在具有两个或多个节点（由依赖于子节点的父节点组成）的关系图中。 关系图需要自下而上的处理。 在关系图中标识循环。 关系图通过遍历图并将所有图形节点分配到等级来进行分级。 在并行处理后续级别中的节点之前，通过并行处理在一个或多个级别的第一级中的节点来处理分级数据。

公开(公告)号：US10423693B2

公开(公告)日：2019-09-24

申请号：US14486668

申请日：2014-09-15

Applicant: Autodesk, Inc.

Inventor： Timothy E. Abla ,  Michael Alan Foster ,  John T. Koerner ,  Mikel L. Martin ,  Dennis M. Mulonas ,  Matthew W. Smith

IPC: G06F17/00 ,  G06F17/10 ,  G06F9/50 ,  G06F17/50

Abstract: A method, apparatus, system, computer program product, and computer readable storage medium provide the ability to parallel process hierarchical data. Hierarchical data is obtained. The hierarchical data is organized in a relationship graph having two or more nodes (consisting of parent nodes that are dependent on child nodes). The relationship graph requires bottom-up processing. Cycles are identified in the relationship graph. The relationship graph is leveled by traversing the graph and assigning all graph nodes into levels. The hierarchical data is processed by parallel processing the nodes in a first level of the one or more levels before parallel processing the nodes in a subsequent level.