Abstract
We have designed and implemented parallel compile-time analysis algorithms based on a family of general-purpose, hybrid algorithms for data flow analysis [MR90]. Recently, we have developed optimizations that improve algorithm performance by reducing the time taken for computation, communication and dynamic scheduling. The practicality of this improved algorithm is evidenced by empirical studies of the Reaching Definitions problem on a distributed-memory machine, the Intel iPSC/2.
Cite
CITATION STYLE
Lee, Y. F., & Ryder, B. G. (1993). Parallel hybrid data flow algorithms: A case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 757 LNCS, pp. 296–310). Springer Verlag. https://doi.org/10.1007/3-540-57502-2_54
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
