Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"Distributed Graph Processing"”.
-
Approximate failure recovery in distributed graph processing systems
Distributed graph processing systems are an emerging area of big data systems. As graphs continue to grow in size and prevalence, these systems must become faster and more scalable. However, after failures, distributed graph processing systems either largely rely on proactive fault tolerance …
-
Topology-aware distributed graph processing for tightly-coupled clusters
… Specifically, we look at a class of distributed machine learning systems called distributed graph processing systems, and run them on NCSA Blue Waters. Partitioning the graph is key to achieving performance in distributed graph processing systems. We present new topology-aware …
-
Improving distributed graph processing by load balancing and redundancy reduction
… A significant portion of this data is stored as graphs in various domains, such as online retail and social networks. Analyzing large-scale graphs provides important insights that are highly utilized in many areas, such as recommendation systems, banking systems, and medical diagnosis. To …
-
Zorro: zero-cost reactive failure recovery in distributed graph processing
Distributed graph processing frameworks have become increasingly popular for processing large graphs. However, existing frameworks either lack the ability to recovery from failures or support proactive recovery methods. Proactive recovery methods like checkpointing incur high overheads during …
-
An experimental comparison of partitioning strategies in distributed graph processing
… of choosing among partitioning strategies in distributed graph processing systems. To this end, we evaluate and characterize both the performance and resource usage of different partitioning strategies under various popular distributed graph processing systems, applications, input graphs, and …
-
Scale-free graph processing on a NUMA machine
The importance of high-performance graph processing to solve big data problems targeting high-impact applications is greater than ever before. Graphs incur highly irregular memory accesses which leads to poor data locality, load imbalance, and data-dependent parallelism. Distributed graph …
-
Τεχνικές επεξεργασίας κατανεμημένων γράφων και ρευμάτων γράφων
… networks are routinely represented using graphs. The volume of graph data produced in today’s interlinked world allows for realizing numerous fascinating applications but also posses important challenges. Consider for example the friendship graph of a social networking site and the …
-
CUTTANA : scalable graph partitioning for faster distributed graph databases and analytics
Graph partitioning plays a pivotal role in various distributed graph processing applications, including graph analytics, graph neural network training, and distributed graph databases. A good graph partitioner reduces workload execution time, worker imbalance, and network overhead. Graphs that …
-
Performance Improvement of Distributed Computing Framework and Scientific Big Data Analysis
… due to the requirement of massive parallel processing. Distributed computing frameworks are being explored as a viable solution. For example, Google proposed MapReduce, which is becoming a de facto computing architecture for Big data solutions. However, scheduling in MapReduce is coarse …
-
On Improving Distributed Pregel-like Graph Processing Systems
The considerable interest in distributed systems that can execute algorithms to process large graphs has led to the creation of many graph processing systems. However, existing systems suffer from two major issues: (1) poor performance due to frequent global synchronization barriers and limited …
-
Scaling overlapping community detection algorithms
… the underlying structure of communities in graphs with a greater degree of correctness. This specific area of graph mining is known as community detection. It is one of the most critical components of graph mining. It helps in understanding the underlying properties of the graph. While a lot …
-
UNDERSTANDING AND MANAGING COMPLEX DATASETS
… and unstructured data still dominate the scene, graphs are becoming ever more prominent, bringing new challenges. The size and complexity of graph datasets have increased, thus renewing the interest in graph databases and distributed graph processing. The current abundance of data and content …
-
Link Prediction in Agent-based Graph Database System
… Simulation (MASS) library. By extending MASS’s distributed graph infrastructure and property-aware computation model, we implement both classical topological heuristics and embedding-based approaches—most notably Fast Random Projection (FastRP) combined with k-Nearest Neighbors (kNN)—to infer …
-
Algorithm-Level Optimizations for Scalable Parallel Graph Processing
Efficiently processing large graphs is challenging, since parallel graph algorithms suffer from poor scalability and performance due to many factors, including heavy communication and load-imbalance. Furthermore, it is difficult to express graph algorithms, as users need to understand and …