A new k-graph partition algorithm for distributed P2P simulation systems

Authors:
Chunjiang Wu;Shijie Zhou;Linna Wei;Jiaqing Luo;Yanli Wang;Xiaoqian Yang
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chendu, Sichuan, P.R. China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chendu, Sichuan, P.R. China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chendu, Sichuan, P.R. China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chendu, Sichuan, P.R. China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chendu, Sichuan, P.R. China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chendu, Sichuan, P.R. China
Venue:
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Year:
2007

Citing 7
Cited 0

HARP: a fast spectral partitioner

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Graph Partitioning and Continuous Quadratic Programming

SIAM Journal on Discrete Mathematics
Expander flows, geometric embeddings and graph partitioning

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Introduction to simulation: introduction to simulation

Proceedings of the 34th conference on Winter simulation: exploring new frontiers
A survey of peer-to-peer content distribution technologies

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

While simulating a P2P system with distributed simulator, it generally requires that one single large network topology should be predivided into some small sub-nets, each of which denotes a group of peers in the P2P system. Because of interconnectivity of the simulated network, the subnets running on different simulation node must exchange message with each other to complete the simulation task. Based on the knowledge of degree sequence and breadth-first search, this paper proposes a novel approximate algorithm of k-graph partition. By this optimized algorithm, a large P2P network topology can be divided into k sub-nets while not only the traffic among different subnet is minimized, but also the tasks of simulation are balanced. Through the analysis of time complexity, load balance and edge-cut experimental results for different network topology, it shows our algorithm is a feasible method applied for distributed P2P simulation systems.