Sciweavers

548 search results - page 47 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
PODC
2000
ACM
15 years 6 months ago
Garbage collection of timestamped data in Stampede
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
Rishiyur S. Nikhil, Umakishore Ramachandran
PDP
2007
IEEE
15 years 8 months ago
HAND: Highly Available Dynamic Deployment Infrastructure for Globus Toolkit 4
—Grid computing is becoming more and more attractive for coordinating large-scale heterogeneous resource sharing and problem solving. Of particular interest for effective Grid co...
Li Qi, Hai Jin, Ian T. Foster, Jarek Gawor
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
15 years 8 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
CGF
2008
227views more  CGF 2008»
15 years 2 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
PPOPP
1999
ACM
15 years 6 months ago
Dynamic Instrumentation of Threaded Applications
The use of threads is becoming commonplace in both sequential and parallel programs. This paper describes our design and initial experience with non-trace based performance instru...
Zhichen Xu, Barton P. Miller, Oscar Naim