Suchergebnisse - MPI-parallel graph algorithm

Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling von van der Grinten, Alexander, Meyerhenke, Henning

“… Yet, the best shared-memory algorithms can still take hours of running time for large graphs, especially for graphs with a high diameter or when a small relative error …”
Volltext

An MPI-Parallel Algorithm for Static and Dynamic Top-k Harmonic Centrality von van der Grinten, Alexander, Custers, Geert, Thanh, Duy Le, Meyerhenke, Henning

“… determine a ranking of the top-k vertices with highest harmonic centrality. Such algorithms are available for many types of real-world graphs, including dynamic graphs …”
Volltext

Shape optimizing load balancing for MPI-parallel adaptive numerical simulations von Meyerhenke, Henning

“… Here we further explore the promising diffusion-based multilevel graph partitioning algorithm …”
Volltext

On construction of a visualization toolkit for MPI parallel programs in cluster environments von Kuan-Ching Li, Hsun-Chang Chang, Chao-Tung Yang, Liria Matsumoto Sato, Chung-Yuan Yang, Yin-Yi Wu, Mao-Yueh Pel, Hsiang-Kai Liao, Min-Chieh Hsieh, Chia-Wen Tsai

“… for visualization of MPI parallel programs, reflecting to its execution over time, with the use of DP …”
Volltext

MapReduce in MPI for Large-scale graph algorithms von Plimpton, Steven J., Devine, Karen D.

“… We describe a parallel library written with message-passing (MPI) calls that allows algorithms to be expressed in the MapReduce paradigm …”
Volltext

Parallel Communication Optimization Based on Graph Partition for Hexagonal Neutron Transport Simulation Using MOC Method von Zheng, Jingchao, Wang, Zhiqiang, Xie, Zeyi, Peng, Xingjie, Zhao, Chen, Wu, Wenbin

“… OpenMOC-HEX, a neutron transport calculation code with hexagonal modular ray tracing, has the capability of domain decomposition parallelism based on an MPI parallel programming model …”
Volltext

DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI von Liu, Yongchao, Schmidt, Bertil, Maskell, Douglas L

“… ) using a hybrid combination of CUDA and MPI parallel programming models. DecGPU provides CPU-based and GPU-based versions, where the CPU-based version employs coarse …”
Volltext

An Efficient Parallel Multi-Scale Segmentation Method for Remote Sensing Imagery von Gu, Haiyan, Han, Yanshun, Yang, Yi, Li, Haitao, Liu, Zhengjun, Soergel, Uwe, Blaschke, Thomas, Cui, Shiyong

“… ). Specifically, a minimum spanning tree (MST) algorithm in graph theory is proposed to be combined with a minimum heterogeneity rule (MHR …”
Volltext

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs von Sattar, Naw Safrin, Ibrahim, Khaled Z., Buluc, Aydin, Arifuzzaman, Shaikh

“… Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces …”
Volltext

Comparative Study of Graph Clustering Algorithms von Shah, Nishita Divyakant

“… We have implemented our algorithm parallelly. We have checked the efficiency and scalability of parallel algorithm on a modern MPI machine to work with large graphs and found …”
Volltext

PVGwfa: a multi-level parallel sequence-to-graph alignment algorithm von Peng, Chenchen, Xia, Zeyu, Tang, Shengbo, Guo, Yifei, Yang, Canqun, Tang, Tao, Cui, Yingbo

“… However, existing algorithms struggle with large-scale sequences. In this paper, we propose PVGwfa, a multi-level parallel sequence-to-graph alignment algorithm …”
Volltext

Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs von van der Grinten, Alexander, Custers, Geert, Thanh, Duy Le, Meyerhenke, Henning

“… For example, many algebraic graph algorithms rely on SpGEMM in the tropical semiring to compute shortest paths in graphs …”
Volltext

Developing a scalable hybrid MPI/OpenMP unstructured finite element model von Guo, Xiaohu, Lange, Michael, Gorman, Gerard, Mitchell, Lawrence, Weiland, Michèle

“… This imposes a strong evolutionary pressure on algorithms and software to efficiently utilise all levels of parallelism available on a given platform while minimising data movement …”
Volltext

Process Assignment in Multi-core Clusters Using Job Assignment Algorithm von Sudhakar, Chapram, Adhikari, Pankaj, Ramesh, T.

“… Parallel application can be modelled as a weighted graph showing the communication among the processes of that application …”
Volltext

Exploring the Thread-level Parallelisms for the Next Generation Geophysical Fluid Modelling Framework Fluidity-ICOM von Guo, Xiaohu, Gorman, Gerard, Lange, Michael, Mitchell, Lawrence, Weiland, Michèle

“… We demonstrate that utilising non-blocking algorithms and libraries are critical to mixed-mode application so that it can achieve better parallel performance than the pure MPI version …”
Volltext

A parallel framework for reverse search using mts von Avis, David, Jordan, Charles

“… mts is programmed in C, uses the MPI parallel environment, and can be run on a network of computers …”
Volltext

Parallel Spectral Clustering Algorithm Based on Matrix Computation von Zhang, Lufei, Hao, Ziyu, Chen, Zuoning

“… Spectral clustering algorithm based on algebraic graph theory is an emerging algorithm which uses spectrum structure to reduce computation complexity and ensure the clustering quality …”
Volltext

PVGwfa: a multi-level parallel sequence-to-graph alignment algorithm: PVGwfa: a multi-level parallel sequence-to-graph alignment von Peng, Chenchen, Xia, Zeyu, Tang, Shengbo, Guo, Yifei, Yang, Canqun, Tang, Tao, Cui, Yingbo

“… However, existing algorithms struggle with large-scale sequences. In this paper, we propose PVGwfa, a multi-level parallel sequence-to-graph alignment algorithm …”
Volltext

Parallel analysis of Ethereum blockchain transaction data using cluster computing von Kılıç, Baran, Özturan, Can, Sen, Alper

“… Using message passing libraries (MPI), we develop a scalable cluster-based system that constructs a distributed transaction graph in parallel and implement various transaction analysis algorithms …”
Volltext

Enhancing Distributed Graph Matching Algorithm with MPI RMA based Active Messages von Zhu, Xingyu, Huang, Dan, Lu, Yutong

“… Traditionally, most parallel graph algorithms have been implemented based on the BSP paradigm and using MPI two-sided communication as the underlying communication method …”
Volltext