Results 1 - 10 of 1,007

Dryad: Distributed Data-Parallel Programs from Sequential Building Blocks

by Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, Dennis Fetterly - In EuroSys , 2007
"... Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad applica-tion combines computational “vertices ” with communica-tion “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 general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad applica-tion combines computational “vertices ” with communica-tion “channels ” to form a dataflow graph. Dryad runs the application by executing the vertices of this graph on a set

A Signal Processing Approach To Fair Surface Design

by Gabriel Taubin , 1995
"... In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing, or fai ..."
Abstract - Cited by 654 (15 self) - Add to MetaCart
, or fairing, to low-pass filtering. We describe a very simple surface signal low-pass filter algorithm that applies to surfaces of arbitrary topology. As opposed to other existing optimization-based fairing methods, which are computationally more expensive, this is a linear time and space complexity algorithm

A Data Structure for Dynamic Trees

by Daniel D. Sleator, Robert Endre Tarjan , 1983
"... A data structure is proposed to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract - Cited by 347 (21 self) - Add to MetaCart
A data structure is proposed to maintain a collection of vertex-disjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n

� An Introduction to Dryad and

by unknown authors
"... The goal of DryadLINQ is to make distributed computing on large computer clusters simple enough for ordinary programmers. DryadLINQ combines two important pieces of Microsoft technology: the Dryad distributed execution engine and the.NET Language Integrated Query (LINQ). About this brief: We introdu ..."
Abstract - Add to MetaCart
The goal of DryadLINQ is to make distributed computing on large computer clusters simple enough for ordinary programmers. DryadLINQ combines two important pieces of Microsoft technology: the Dryad distributed execution engine and the.NET Language Integrated Query (LINQ). About this brief: We

A Computational Approach for Corner and Vertex Detection

by Rachid Deriche, Gerard Giraudon - International Journal of Computer Vision , 1992
"... Corners and vertices are strong and useful features in Computer Vision for scene analysis, stereo matching and motion analysis. This paper deals with the development of a computational approach to these important features. We consider first a corner model and study analytically its behavior once it ..."
Abstract - Cited by 132 (1 self) - Add to MetaCart
of the corner. A new scale-space based approach that combines useful properties from the Laplacian and Beaudet's measure [Bea78] is then proposed in order to correct and detect exactly the corner position. An extension of this approach is then developed to solve the problem of trihedral vertex

Jacobian-free Newton-Krylov methods: a survey of approaches and applications

by Dana A. Knoll, David E. Keyes - J. Comput. Phys
"... Jacobian-free Newton-Krylov (JFNK) methods are synergistic combinations of Newton-type methods for superlinearly convergent solution of nonlinear equa-tions and Krylov subspace methods for solving the Newton correction equations. The link between the two methods is the Jacobian-vector product, which ..."
Abstract - Cited by 204 (6 self) - Add to MetaCart
Jacobian-free Newton-Krylov (JFNK) methods are synergistic combinations of Newton-type methods for superlinearly convergent solution of nonlinear equa-tions and Krylov subspace methods for solving the Newton correction equations. The link between the two methods is the Jacobian-vector product

Analyzing CUDA workloads using a detailed gpu simulator

by Ali Bakhoda, George L. Yuan, Wilson W. L. Fung, Henry Wong, Tor M. Aamodt - In Proceedings of the International Symposium on Performance Analysis of Systems and Software , 2009
"... Modern Graphic Processing Units (GPUs) provide suffi-ciently flexible programming models that understanding their performance can provide insight in designing tomorrow’s manycore processors, whether those are GPUs or other-wise. The combination of multiple, multithreaded, SIMD cores makes studying t ..."
Abstract - Cited by 168 (8 self) - Add to MetaCart
applications demonstrating varying levels of performance improvement on GPU hardware (versus a CPU-only sequential version of the application). We study the performance of these applica-tions on our GPU performance simulator with configurations comparable to contemporary high-end graphics cards. We

Conditions For Unique Graph Realizations

by Bruce Hendrickson - SIAM J. Comput , 1992
"... . The graph realization problem is that of computing the relative locations of a set of vertices placed in Euclidean space, relying only upon some set of inter-vertex distance measurements. This paper is concerned with the closely related problem of determining whether or not a graph has a unique re ..."
Abstract - Cited by 155 (1 self) - Add to MetaCart
. The graph realization problem is that of computing the relative locations of a set of vertices placed in Euclidean space, relying only upon some set of inter-vertex distance measurements. This paper is concerned with the closely related problem of determining whether or not a graph has a unique

Using DryadLINQ for Large Matrix Operations

by Thomas L. Rodeheffer, Frank Mcsherry , 2011
"... DryadLINQ [7] is a system that facilitates the construc-tion of distributed execution plans for processing large amounts of data on clusters containing potentially thou-sands of computers. In this paper, we explore how to use DryadLINQ to perform basic matrix operations on large matrices. DryadLINQ ..."
Abstract - Add to MetaCart
DryadLINQ [7] is a system that facilitates the construc-tion of distributed execution plans for processing large amounts of data on clusters containing potentially thou-sands of computers. In this paper, we explore how to use DryadLINQ to perform basic matrix operations on large matrices. Dryad

Photon Mapping on Programmable Graphics Hardware

by Timothy J. Purcell, Craig Donner, Mike Cammarano, Henrik Wann Jensen, Pat Hanrahan - GRAPHICS HARDWARE , 2003
"... We present a modified photon mapping algorithm capable of running entirely on GPUs. Our implementation uses breadth-first photon tracing to distribute photons using the GPU. The photons are stored in a grid-based photon map that is constructed directly on the graphics hardware using one of two met ..."
Abstract - Cited by 151 (4 self) - Add to MetaCart
methods: the first method is a multipass technique that uses fragment programs to directly sort the photons into a compact grid. The second method uses a single rendering pass combining a vertex program and the stencil buffer to route photons to their respective grid cells, producing an approximate
Results 1 - 10 of 1,007