logo

SCIENCE CHINA Information Sciences, Volume 60, Issue 1: 019103(2017) https://doi.org/10.1007/s11432-015-0163-7

Identifying superword level parallelism with extended directed dependence graph reachability

More info
  • ReceivedMar 19, 2016
  • AcceptedJun 3, 2016
  • PublishedOct 13, 2016

Abstract


Funded by

HEGAOJI Major Project of China(2009ZX01036-001-001-2)

and Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing(2013A11)


Acknowledgment

Acknowledgments

This work was supported by HEGAOJI Major Project of China (Grant No. 2009ZX01036-001-001-2) and Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing (Grant No. 2013A11).


References

[1] Larsen S, Amarasinghe S. Exploiting superword level parallelism with multimedia instruction sets. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. New York: ACM, 2000. 145--156. Google Scholar

[2] Padua D A, Wolfe M J. Advanced compiler optimizations for supercomputers. Commun ACM, 1986, 29: 1184-1201 CrossRef Google Scholar

[3] Bulic P, Gustin V. D-test: an extension to Banerjee test for a fast dependence analysis in a multimedia vectorizing compiler. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS). Washington: IEEE Computer Society, 2004. 535--546. Google Scholar

[4] Liu J, Zhang Y, Jang O, et al. A compiler framework for extracting superword level parallelism. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation. New York: ACM, 2012. 347--358. Google Scholar

Copyright 2020 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1