Proceedings ArticleDOI
Pregel: a system for large-scale graph processing
Grzegorz Malewicz,Matthew H. Austern,Aart J. C. Bik,James C. Dehnert,Ilan Horn,Naty Leiser,Grzegorz Czajkowski +6 more
- pp 135-146
Reads0
Chats0
TLDR
A model for processing large graphs that has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier.Abstract:
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs - in some cases billions of vertices, trillions of edges - poses challenges to their efficient processing. In this paper we present a computational model suitable for this task. Programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent in the previous iteration, send messages to other vertices, and modify its own state and that of its outgoing edges or mutate graph topology. This vertex-centric approach is flexible enough to express a broad set of algorithms. The model has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier. Distribution-related details are hidden behind an abstract API. The result is a framework for processing large graphs that is expressive and easy to program.read more
Citations
More filters
Journal ArticleDOI
Defining and evaluating Twitter influence metrics: a higher-order approach in Neo4j
TL;DR: Examination of seven first-order influence metrics for Twitter, a strategy for deriving their higher-order counterparts, and a probabilistic evaluation framework are outlined, indicate that a single metric combining structural and functional features outperforms the rest in said framework.
Posted Content
Unifying Data, Model and Hybrid Parallelism in Deep Learning via Tensor Tiling.
TL;DR: This work proposes an algorithm that can find the best tiling to partition tensors with the least overall communication and builds the SoyBean system, which automatically transforms a serial dataflow graph captured by an existing deep learning system frontend into a parallel dataflowgraph based on the optimal tiling it has found.
Journal ArticleDOI
ReFOCUS+: Multi-Layers Real-Time Intelligent Route Guidance System With Congestion Detection and Avoidance
TL;DR: A dynamic semi-distributed, multi-layer, and Fog-Cloud based advance route guidance system architecture has been introduced and it is demonstrated that ReFOCUS+ outperforms existing solutions and improve traveling time, fuel consumption and gas emissions.
Journal ArticleDOI
Realtime analysis of information diffusion in social media
Io Taxidou,Peter M. Fischer +1 more
TL;DR: This thesis aims to investigate how information diffuses in real time on the underlying social network and the role of different users in the propagation process and compare the cost and quality of both approaches.
Book ChapterDOI
A Distributed Multilevel Force-Directed Algorithm
TL;DR: Multi-GiLA is presented, the first multilevel force-directed graph visualization algorithm based on a vertex-centric computation paradigm and experiments show that it can be successfully applied to compute high quality layouts of very large graphs on inexpensive cloud computing platforms.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This paper presents the implementation of MapReduce, a programming model and an associated implementation for processing and generating large data sets that runs on a large cluster of commodity machines and is highly scalable.
Journal ArticleDOI
MapReduce: simplified data processing on large clusters
Jeffrey Dean,Sanjay Ghemawat +1 more
TL;DR: This presentation explains how the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.
Journal ArticleDOI
The anatomy of a large-scale hypertextual Web search engine
Sergey Brin,Lawrence Page +1 more
TL;DR: This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Journal Article
The Anatomy of a Large-Scale Hypertextual Web Search Engine.
Sergey Brin,Lawrence Page +1 more
TL;DR: Google as discussed by the authors is a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems.