Web-site-based partitioning techniques for efficient parallelization of the PageRank computation (ハイパフォーマンスコンピューティング)

スポンサーリンク

概要

• 論文の詳細を見る

• The efficiency of the PageRank computation is important since the constantly evolving nature of the Web requires this computation to be repeated many times. PageRank computation includes repeated iterative sparse matrix-vector multiplications. Due to the enourmous size of the Web matrix to be multiplied, PageRank computations are usually carried out on parallel systems. Graph and hypergraph partitioning techniques are widely used for efficient parallelization of matrix-vector multiplications. These techniques suffer from high preprocessing overhead for PageRank algorithm. In this work, we propose Web-site-based partitioning techniques to reduce the preprocessing overhead of Parallel PageRank computation.

• 一般社団法人情報処理学会の論文
• 2007-09-09

著者

• Satoshi Matsuoka

  Tokyo Institute of Technology

• Cevahir Ali

  東工大

• MATSUOKA SATOSHI

  東工大

• Satoshi Matsuoka

  National Inst. Of Informatics

関連論文

• MPI-CUDA Applications Checkpointing
• Efficient PageRank on GPU Clusters
• Low-overhead checkpoint for large-scale GPU-accelerated systems
• Low-overhead checkpoint for large-scale GPU-accelerated systems
• Efficient PageRank on GPU Clusters
• Web-site-based partitioning techniques for efficient parallelization of the PageRank computation (ハイパフォーマンスコンピューティング)
• CG on GPU-enhanced Clusters
• CG on GPU-enhanced Clusters
• Fast GPU Read Alignmennt with Burrows Wheeler Transform Based Index
• GPU-based approach for elastic-plastic deformation simulations
• Data Ownership Assurance in the Inter-Cloud supporting data dynamics
• Towards an Asynchronous Checkpointing System
• Towards an Asynchronous Checkpointing System
• Towards an Asynchronous Checkpointing System
• Towards an Asynchronous Checkpointing System
• Towards Fast PGAS Implementation of Multithreaded Asynchronous Large-Scale Graph Traversal for Supercomputers with Local Semi-External Memory
• Towards a Dataflow FMM using the OmpSs Programming Model
• Avoiding silent data corruption in checkpoint files
• Burst SSD Buffer: Checkpoint Strategy at Extreme Scale
• Multi-level Temporal Blocking for Stencil Computation for Memory Hierarchy on TSUBAME2.5
• Performance modeling of a hierarchcial N-body algorithm for arbitrary particle distribution (Unrefereed Workshop Manuscript)
• Increasing GPU batch queue's utilization using rCUDA (Unrefereed Workshop Manuscript)
• Visualizing Collectives over InfiniBand Networks (Unrefereed Workshop Manuscript)

もっと見る 閉じる

スポンサーリンク