Designing Parallel Algorithms from Regular Graphs and Semi-regular Graphs

[[abstract]]D. I. Moldovan (1982, 1986) has proposed a systematic approach to design parallel algorithms for nested loop algorithms. The authors extend Moldovan's results to the design of parallel algorithms from the regular graphs and the semiregular graphs. A regular graph is a directed graph whose arcs can be completely specified by a set of deterministic dependence vectors; a semiregular graph is a directed graph whose arcs can be completely specified by a set of nondeterministic dependence vectors.[[fileno]]2020416030011[[department]]工工