Results 1  10
of
337
Fast Iterative Graph Computation: A Path Centric Approach
 In SC
, 2014
"... Abstract—Large scale graph processing represents an interesting systems challenge due to the lack of locality. This paper presents PathGraph, a system for improving iterative graph computation on graphs with billions of edges. Our system design has three unique features: First, we model a large gra ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
graph using a collection of treebased partitions and use pathcentric computation rather than vertexcentric or edgecentric computation. Our pathcentric graph parallel computation model significantly improves the memory and disk locality for iterative computation algorithms on large graphs. Second
Pregel: A system for largescale graph processing
 IN SIGMOD
, 2010
"... 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 ..."
Abstract

Cited by 496 (0 self)
 Add to MetaCart
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 vertexcentric approach
PerformanceEffective and LowComplexity Task Scheduling for Heterogeneous Computing
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NPcomplete in general cases as well as in several restricted cases. Because of its key importance, this problem has been exte ..."
Abstract

Cited by 255 (0 self)
 Add to MetaCart
and the CriticalPathonaProcessor (CPOP) algorithm. The HEFT algorithm selects the task with the highest upward rank value at each step and assigns the selected task to the processor, which minimizes its earliest finish time with an insertionbased approach. On the other hand, the CPOP algorithm uses
Fast computation of graph kernels
 In
, 2007
"... Using extensions of linear algebra concepts to Reproducing Kernel Hilbert Spaces (RKHS), we define a unifying framework for random walk kernels on graphs. Reduction to a Sylvester equation allows us to compute many of these kernels in O(n 3) worstcase time. This includes kernels whose previous wors ..."
Abstract

Cited by 42 (7 self)
 Add to MetaCart
Using extensions of linear algebra concepts to Reproducing Kernel Hilbert Spaces (RKHS), we define a unifying framework for random walk kernels on graphs. Reduction to a Sylvester equation allows us to compute many of these kernels in O(n 3) worstcase time. This includes kernels whose previous
Fast iterative alignment of pose graphs with poor initial estimates
 In IEEE Intl. Conf. on Robotics and Automation (ICRA
, 2006
"... Abstract — A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms attempt to fuse these estimates to produce a map and a robot trajectory. The constraints are generally nonlinear ..."
Abstract

Cited by 81 (9 self)
 Add to MetaCart
given a poor initial estimate. Our approach uses a variant of Stochastic Gradient Descent on an alternative statespace representation that has good stability and computational properties. We compare our algorithm to several others, using both real and synthetic data sets.
Fast Iterative Graph Computation with Block Updates
"... Scaling iterative graph processing applications to large graphs is an important problem. Performance is critical, as data scientists need to execute graph programs many times with varying parameters. The need for a highlevel, highperformance programming model has inspired much research on graph pr ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
propose a novel blockoriented computation model, in which computation is iterated locally over blocks of highly connected nodes, significantly improving the amount of computation per cache miss. Following this model, we describe the design and implementation of a blockaware graph processing runtime
Fast Iterative Graph Computation with Resource Aware Graph Parallel Abstractions
"... Iterative computation on large graphs has challenged system research from two aspects: (1) how to conduct high performance parallel processing for both inmemory and outofcore graphs; and (2) how to handle large graphs that exceed the resource boundary of traditional systems by resource aware gr ..."
Abstract
 Add to MetaCart
Iterative computation on large graphs has challenged system research from two aspects: (1) how to conduct high performance parallel processing for both inmemory and outofcore graphs; and (2) how to handle large graphs that exceed the resource boundary of traditional systems by resource aware
Fast computation of reachability labeling for large graphs
 In Proc. of EDBT’06
, 2006
"... There are numerous applications that need to deal with a large graph and need to query reachability between nodes in the graph. A 2hop cover can compactly represent the whole edge transitive closure of a graph in O(V  · E  1/2) space, and be used to answer reachability query efficiently. Howev ..."
Abstract

Cited by 49 (17 self)
 Add to MetaCart
feature of our approach is that we compute 2hop cover while partitioning. In brief, in every iteration of topdown partitioning, we provide techniques to compute the 2hop cover for connections between the two subgraphs first. A cover is computed to cut the graph into two subgraphs, which results
A fast incremental/iterative solution procedure that handles snapthrough’, Comput
"... Abstract Riks [l) has recently proposed a new solution procedure for overcoming limit points. To this end, he adds, to the standard equilibrium equations, a constraint equation fixing the length of the incremental oad step in load/deflection space. The applied load level becomes an additional vari ..."
Abstract

Cited by 47 (0 self)
 Add to MetaCart
variable. The present paper describes a means of modifying Rik’s approach so that it is suitable for use with the finite element method. The procedure is applied in conjunction with the modified NewtonRapbson method in both its original and accelerated forms. The resulting techniques not only allow limit
Fast topk pathbased relevance query on massive graphs
 In ICDE’14
, 2014
"... AbstractThe task of obtaining the items highlyrelevant to a given set of query items is a basis for various applications, such as recommendation and prediction. A family of pathbased relevance metrics, which quantify item relevance based on the paths in a given item graph, have been shown to be e ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to be effective in capturing the relevance in many applications. Despite their effectiveness, pathbased relevance normally requires timeconsuming iterative computation. We propose an approach to obtain the topk most relevant items for a given query item set quickly. Our approach can obtain the topk items
Results 1  10
of
337