IEEE Transactions on Computers · 1985 · 23 citations · 5 references
ComputingComputer ScienceComputer ArchitectureParallel AlgorithmsParallel ComputingData ParallelismData-flow AnalysisParallel ArchitecturesParallel ComputationParallel Computing SystemsParallel Performance AnalysisAutomatic ParallelizationEmpirical EvaluationParallel Algorithm AnalysisParallel Data ProcessingParallel ProcessingParallel ProgrammingParallel Speedup AnalysisParallelization
The feasibility of automatic restructuring of nonnumerical programs for parallel processing is studied through experiments using Parafrase, an automatic restructurer at the University of Illinois, Urbana-Champaign. Parallel processing speedup results due to automatic restructuring for several basic nonnumerical problems are presented. The loops encountered are classified at a low level. On the basis of the speedup results and the analyses of the loop types, the difficulty and the effectiveness of automatic restructuring are discussed. The experiments suggest that automatic restructuring can be a useful tool for exploiting parallelism in the sequential form of nonnumerical programs.
5
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Efficient parallel algorithms for some graph problems
Francis Y. L. Chin, John Lam, I-Ngo Chen · Communications of the ACM · 1982 · 207 citations · Full text
Utpal Banerjee · 1979 · 152 citations