• Cui Y, Liu S, Zou N and Wu W. A Dynamic Parallel Strategy for DOACROSS Loops. Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region. (108-115).

    https://doi.org/10.1145/3149457.3149469

  • Xiao L, Zhang X, Kuang Z, Feng B and Kang J. (2006). Auto-CFD-NOW. The Journal of Supercomputing. 38:2. (189-217). Online publication date: 1-Nov-2006.

    https://doi.org/10.1007/s11227-006-8324-z

  • Li Xiao , Xiadong Zhang , Zhengqian Kuang , Baiming Feng and Jichang Kang . (2003). Auto-FCD: efficiently parallelizing CFD applications on clusters Proceedings IEEE International Conference on Cluster Computing CLUSTR-03. 10.1109/CLUSTR.2003.1253298. 0-7695-2066-9. (46-53).

    http://ieeexplore.ieee.org/document/1253298/

  • Chen D and Yew P. (1999). Redundant Synchronization Elimination for DOACROSS Loops. IEEE Transactions on Parallel and Distributed Systems. 10:5. (459-470). Online publication date: 1-May-1999.

    https://doi.org/10.1109/71.770138

  • Rajamony R and Cox A. Optimally synchronizing DOACROSS loops on shared memory multiprocessors 1997 International Conference on Parallel Architectures and Compilation Techniques. 10.1109/PACT.1997.644017. 0-8186-8090-3. (214-224).

    http://ieeexplore.ieee.org/document/644017/

  • Kelly W, Pugh W, Rosser E and Shpeisman T. (1996). Transitive Closure of Infinite Graphs and Its Applications. International Journal of Parallel Programming. 24:6. (579-598). Online publication date: 1-Dec-1996.

    /doi/10.5555/247013.2949463

  • Kelly W, Pugh W, Rosser E and Shpeisman T. (2016). Transitive Closure of Infinite Graphs and Its Applications. International Journal of Parallel Programming. 10.1007/BF03356760. 24:6. (579-598). Online publication date: 1-Dec-1996.

    http://link.springer.com/10.1007/BF03356760

  • Kelly W, Pugh W, Rosser E and Shpeisman T. (1996). Transitive closure of infinite graphs and its applications. Languages and Compilers for Parallel Computing. 10.1007/BFb0014196. (126-140).

    http://link.springer.com/10.1007/BFb0014196

  • Chao H and Harper M. (1995). Minimizing redundant dependencies and interprocessor synchronizations. International Journal of Parallel Programming. 10.1007/BF02577868. 23:3. (245-262). Online publication date: 1-Jun-1995.

    http://link.springer.com/10.1007/BF02577868

  • Blume W and Eigenmann R. (1992). Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs. IEEE Transactions on Parallel and Distributed Systems. 3:6. (643-656). Online publication date: 1-Nov-1992.

    https://doi.org/10.1109/71.180621

  • Lu L and Chen M. Parallelizing loops with indirect array references or pointers. Languages and Compilers for Parallel Computing. 10.1007/BFb0038666. (201-217).

    http://www.springerlink.com/index/10.1007/BFb0038666

  • Girkar M and Polychronopoulos C. (1994). The hierarchical task graph as a universal intermediate representation. International Journal of Parallel Programming. 22:5. (519-551). Online publication date: 1-Oct-1994.

    https://doi.org/10.1007/BF02577777