An Efficient Data Distribution Strategy for Distributed Graph Processing System
Abstract
References
Index Terms
- An Efficient Data Distribution Strategy for Distributed Graph Processing System
Recommendations
GraBi: Communication-Efficient and Workload-Balanced Partitioning for Bipartite Graphs
ICPP '20: Proceedings of the 49th International Conference on Parallel ProcessingMachine Learning and Data Mining (MLDM) applications, such as recommendation and topic modeling, generally represent their input data in bipartite graphs with two disjoint vertex-subsets connected only by edges between them. Despite the prevalence of ...
Flexible application-aware approximation for modern distributed graph processing frameworks
GRADES-NDA '22: Proceedings of the 5th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)The interest in the ability of processing data that has an underlying graph structure has grown in the recent past. This has led to the development of many distributed graph processing systems. However, due to rapidly growing amount of data, e.g., web ...
Solving the Graph Planarization Problem Using an Improved Genetic Algorithm
An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0