@techreport{oai:ipsj.ixsq.nii.ac.jp:00033280,
 author = {峰尾, 昌明 and 上原, 哲太郎 and 齋藤, 彰一 and 國枝, 義敏 and Masaaki, Mineo and Tetsutaro, Uehara and Shoichi, Saito and Yoshitoshi, Kunieda},
 issue = {92(2004-MPS-051)},
 month = {Sep},
 note = {自動並列化コンパイラにとって，並列実行可能性を判別するためにデータ依存解析モジュールは必須である．配列要素間のデータ依存解析手法は種々提案されており，各手法には解析の速度と厳密性との間にトレードオフがある．厳密性を重視した手法としてOmegaテストが有名である．しかし，Omegaテストは，解析にかかる時間が長く，また実装が困難である．本論文では，実装が容易かつ，多くの場合Omegaテストより，高速に厳密な解析を行う新たな手法を提案する．本手法は，線形計画法と全探索を組みあわせ，さらに，GCDテスト，Banerjeeテスト，分離テストの機能をも取り込んだ新しい独自の総合的アルゴリズムである．, Data dependence analysis is essential for automatic parallelizing compilers. Several dependence analysis tests on array data have already been proposed. Each test cannot avoid the trade-off between its speed and exactness. Among conventional tests, Omega test is well known as an exact test. However, the algorithm of Omega test is so complicated that its analysis is very time consuming and it is difficult to implement Omega test. Therefore, in this paper a new original analysis method is proposed, whose algorithm is based and combined both linear programming and exhaustive solution search method. This algorithm also includes the features of GCD test, Banerjee test, and Separability test.},
 title = {並列化可能性判定のための配列データ依存解析問題のモデル化とシンプレックス法を基とする解法の提案},
 year = {2004}
}