Identifying parallelism in programs with cyclic graphs

• Published in: Journal of parallel and distributed computing Vol. 63; no. 3; pp. 337 - 355
• Main Authors: Hwang, Yuan-Shin, Saltz, Joel H.
• Format: Journal Article
• Language: English
• Published: San Diego, CA Elsevier Inc 01.03.2003; Elsevier
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Computer science; control theory; systems; Exact sciences and technology; Theoretical computing; Parallelism; Bipartite graph; Data structure; Pattern analysis; Acyclic graph
• ISSN: 0743-7315; 1096-0848
• DOI: 10.1016/S0743-7315(02)00026-6

Dependence analysis algorithms have been proposed to identify parallelism in programs with tree-like data structures. However, they cannot analyze the dependence of statements if recursive data structures of programs are cyclic. This paper presents a technique to identify parallelism in programs with cyclic graphs. The technique consists of three steps: (1) traversal patterns that loops or recursive procedures traverse graphs are identified, and the statements that construct the links of traversal patterns will be located by definition–use chains of recursive data structures; (2) traversal-pattern-sensitive shape analysis is performed to estimate possible shapes of traversal patterns; (3) dependence analysis is performed to identify parallelism using the result of shape analysis. This approach can identify parallelism in programs with cyclic data structures due to the facts that many programs follow acyclic structures (i.e. traversal patterns) to access all nodes on the cyclic data structures. Once the traversal patterns are isolated from the overall data structures, dependence analysis can be applied to identify parallelism.