キャッシュヒット率を考慮したステレオマッチングの並列処理

書誌事項

タイトル別名
  • Parallel Processing Scheme of Stereo Matching Considering Cache Hit Rate
  • キャッシュヒットリツ オ コウリョ シタ ステレオマッチング ノ ヘイレツ ショリ

この論文をさがす

抄録

Stereo matching takes a long computation time. It is expected that we can speed up stereo matching by parallel processing. One of the parallel processing methods is line partitioned which is dividing the image domain into one line. This method assigns each line to a processor when searching point. Then, the load of the matching processing is distributed almost equally. However, it has the problem of cache memory in the case of read miss for dividing large domains. Therefore, this paper proposes the speed up scheme to improve the hit ratio of cache memory by dividing the domain into small blocks. Lastly, the effectiveness of the proposed method is shown by revealing the experimental results on the shared memory multiprocessor named ‘Sun Enterprise 4500’.

収録刊行物

参考文献 (19)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ