Results 1  10
of
3,392
ExternalMemory Graph Algorithms
, 1995
"... We present a collection of new techniques for designing and analyzing efficient externalmemory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of specific problems. Our results include: ffl Proximateneighboring. We present a simple method for der ..."
Abstract

Cited by 186 (22 self)
 Add to MetaCart
We present a collection of new techniques for designing and analyzing efficient externalmemory algorithms for graph problems and illustrate how these techniques can be applied to a wide variety of specific problems. Our results include: ffl Proximateneighboring. We present a simple method
Visualizing Memory Graphs
 IN REVISED LECTURES ON SOFTWARE VISUALIZATION, INTERNATIONAL SEMINAR
, 2001
"... To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture and explore program states. A memory graph gives a comprehensive view of all data structures of a program; data items are ..."
Abstract

Cited by 46 (2 self)
 Add to MetaCart
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture and explore program states. A memory graph gives a comprehensive view of all data structures of a program; data items
Passing Run � Memory Graphs
"... Let G = (V, E, root) be a memory graph containing a set V of vertices, a set E of edges, and a dedicated vertex root. <Root> i’ j h a’ size a i argc argv ..."
Abstract
 Add to MetaCart
Let G = (V, E, root) be a memory graph containing a set V of vertices, a set E of edges, and a dedicated vertex root. <Root> i’ j h a’ size a i argc argv
On External Memory Graph Traversal
 IN PROC. ACMSIAM SYMP. ON DISCRETE ALGORITHMS
, 2000
"... We describe a new external memory data structure, the buffered repository tree, and use it to provide the first nontrivial external memory algorithm for directed breadthfirst search (BFS) and an improved external algorithm for directed depthfirst search. We also demonstrate the equivalence of var ..."
Abstract

Cited by 59 (1 self)
 Add to MetaCart
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first nontrivial external memory algorithm for directed breadthfirst search (BFS) and an improved external algorithm for directed depthfirst search. We also demonstrate the equivalence
CUTE: A Concolic Unit Testing Engine for C
 IN ESEC/FSE13: PROCEEDINGS OF THE 10TH EUROPEAN
, 2005
"... In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in which case the inputs to the unit are memory graphs. The paper addresses the pro ..."
Abstract

Cited by 480 (22 self)
 Add to MetaCart
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in which case the inputs to the unit are memory graphs. The paper addresses
Edge partitioning in externalmemory graph search
 In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI07
, 2007
"... There is currently much interest in using external memory, such as disk storage, to scale up graphsearch algorithms. Recent work shows that the local structure of a graph can be leveraged to substantially improve the efficiency of externalmemory graph search. This paper introduces a technique, ca ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
There is currently much interest in using external memory, such as disk storage, to scale up graphsearch algorithms. Recent work shows that the local structure of a graph can be leveraged to substantially improve the efficiency of externalmemory graph search. This paper introduces a technique
Routing with Guaranteed Delivery in ad hoc Wireless Networks
, 2001
"... We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of ..."
Abstract

Cited by 849 (80 self)
 Add to MetaCart
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication
Parallel External Memory Graph Algorithms
"... In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the privatecache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to solutions for many problems on trees, such as computing the Euler to ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the privatecache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to solutions for many problems on trees, such as computing the Euler
Dryad: Distributed DataParallel Programs from Sequential Building Blocks
 In EuroSys
, 2007
"... Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set of availa ..."
Abstract

Cited by 762 (27 self)
 Add to MetaCart
Dryad is a generalpurpose distributed execution engine for coarsegrain dataparallel applications. A Dryad application combines computational “vertices ” with communication “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set
Synchronous data flow
, 1987
"... Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path. Synchronous data flow (SDF) is a special case ..."
Abstract

Cited by 622 (45 self)
 Add to MetaCart
with data flow evaporates. Multiple sample rates within the same system are easily and naturally handled. Conditions for correctness of SDF graph are explained and scheduling algorithms are described for homogeneous parallel processors sharing memory. A preliminary SDF software system for automatically
Results 1  10
of
3,392