|
|
Creator | Title | Description | Subject | Date |
| 76 |
 |
Pascucci, Valerio | Visualizing network traffic to understand the performance of massively parallel simulations | The performance of massively parallel applications is often heavily impacted by the cost of communication among compute nodes. However, determining how to best use the network is a formidable task, made challenging by the ever increasing size and complexity of modern supercomputers. This paper appli... | | 2012-01-01 |
| 77 |
 |
Kirby, Robert Michael II | ElVis: A system for the accurate and interactive visualization of high-order finite element solutions | This paper presents the Element Visualizer (ElVis), a new, open-source scientific visualization system for use with high order finite element solutions to PDEs in three dimensions. This system is designed to minimize visualization errors of these types of fields by querying the underlying finite ele... | | 2012-01-01 |
| 78 |
 |
Pascucci, Valerio | Generalized topological simplification of scalar fields on surfaces | We present a combinatorial algorithm for the general topological simplification of scalar fields on surfaces. Given a scalar field f, our algorithm generates a simplified field g that provably admits only critical points from a constrained subset of the singularities of f, while guaranteeing a small... | | 2012-01-01 |
| 79 |
 |
Kasera, Sneha K. | Detecting receiver attacks in VRTI-based device free localization | Variance-based Radio Tomographic Imaging (VRTI) is an emerging technology that locates moving objects in areas surrounded by simple and inexpensive wireless sensor nodes. VRTI uses human motion induced variation in RSS and spatial correlation between link variations to locate and track people. An ar... | | 2012-01-01 |
| 80 |
 |
Pascucci, Valerio | Computing morse-smale complexes with accurate geometry | Topological techniques have proven highly successful in analyzing and visualizing scientific data. As a result, significant efforts have been made to compute structures like the Morse-Smale complex as robustly and efficiently as possible. However, the resulting algorithms, while topologically consis... | | 2012-01-01 |
| 81 |
 |
Pascucci, Valerio | The parallel computation of morse-smale complexes | Topology-based techniques are useful for multi-scale exploration of the feature space of scalar-valued functions, such as those derived from the output of large-scale simulations. The Morse-Smale (MS) complex, in particular, allows robust identification of gradient-based features, and therefore is s... | | 2012-01-01 |
| 82 |
 |
Gopalakrishnan, Ganesh | Parameterized verification of GPU kernel programs | We present an automated symbolic verifier for checking the functional correctness of GPGPU kernels parametrically, for an arbitrary number of threads. Our tool PUG checks the functional equivalence of a kernel and its optimized versions, helping debug errors introduced during memory coalescing and b... | | 2012-01-01 |
| 83 |
 |
Pascucci, Valerio | Flow visualization with quantified spatial and temporal errors using edge maps | Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Traditional analysis and visualization techniques rely primarily on computing streamlines through numerical integration. The inherent numerical errors of such... | | 2012-01-01 |
| 84 |
 |
Hansen, Charles D. | A practical workflow for making anatomical atlases for biological research | An anatomical atlas provides a detailed map for medical and biological studies of anatomy. These atlases are important for understanding normal anatomy and the development and function of structures, and for determining the etiology of congenital abnormalities. Unfortunately, for biologists, generat... | | 2012-01-01 |
| 85 |
 |
Berzins, Martin | Radiation modeling using the Uintah heterogeneous CPU/GPU runtime system | The Uintah Computational Framework was developed to provide an environment for solving fluid-structure interaction problems on structured adaptive grids on large-scale, long-running, data-intensive problems. Uintah uses a combination of fluid-flow solvers and particle-based methods for solids, toget... | | 2012-01-01 |
| 86 |
 |
Berzins, Martin | Data and range-bounded polynomials in ENO methods | Essentially Non-Oscillatory (ENO) methods and Weighted Essentially Non- Oscillatory (WENO) methods are of fundamental importance in the numerical solution of hyperbolic equations. A key property of such equations is that the solution must remain positive or lie between bounds. A modification of the ... | | 2012-01-01 |
| 87 |
 |
Pascucci, Valerio | Extreme-scale visual analytics | The September/October 2004 CG&A introduced the term visual analytics (VA) to the computer science literature.1 In 2005, an international advisory panel with representatives from academia, industry, and government defined VA as "the science of analytical reasoning facilitated by interactive visual in... | | 2012-01-01 |
| 88 |
 |
Hansen, Charles D. | Design of 2D time-varying vector fields | Design of time-varying vector fields, i.e., vector fields that can change over time, has a wide variety of important applications in computer graphics. Existing vector field design techniques do not address time-varying vector fields. In this paper, we present a framework for the design of time-vary... | | 2012-01-01 |
| 89 |
 |
Cohen, Elaine | A triangulation-invariant method for anisotropic geodesic map computation on surface meshes | This paper addresses the problem of computing the geodesic distance map from a given set of source vertices to all other vertices on a surface mesh using an anisotropic distance metric. Formulating this problem as an equivalent control theoretic problem with Hamilton-Jacobi-Bellman partial different... | | 2012-01-01 |
| 90 |
 |
Balasubramonian, Rajeev | Understanding the impact of 3D stacked layouts on ILP | 3D die-stacked chips can alleviate the penalties imposed by long wires within micro-processor circuits. Many recent studies have attempted to partition each microprocessor structure across three dimensions to reduce their access times. In this paper, we implement each microprocessor structure on a s... | | 2007-01-01 |
| 91 |
 |
Balasubramonian, Rajeev | LOT-ECC: LOcalized and tiered reliability mechanisms for commodity memory systems | Memory system reliability is a serious and growing concern in modern servers. Existing chipkill-level mem- ory protection mechanisms suffer from several draw- backs. They activate a large number of chips on ev- ery memory access - this increases energy consump- tion, and reduces performance due to t... | | 2012-01-01 |
| 92 |
 |
Henderson, Thomas C. | Target-directed navigation using wireless sensor networks and implicit surface interpolation | Abstract-This paper extends the novel research for event localization and target-directed navigation using a deployed wireless sensor network (WSN) [4]. The goal is to have an autonomous mobile robot (AMR) navigate to a target-location by: (i) producing an artificial magnitude distribution within th... | | 2012-01-01 |
| 93 |
 |
Regehr, John | Hierarchical schedulers, performance guarantees, and resource management | An attractive approach to scheduling applications with diverse CPU scheduling requirements is to use different schedulers for different applications. For example: real-time schedulers allow applications to perform computations before deadlines, time-sharing schedulers provide high throughput for com... | | 1999-01-01 |
| 94 |
 |
Regehr, John | Issues in using commodity operating systems for time-dependent tasks: experiences from a study of windows NT | This paper presents a snapshot of early results from a study of Windows NT aimed at understanding and improving its limitations when used for time-dependent tasks, such as those that arise for audio and video processing. Clearly there are time scales for which it can achieve effectively perfect reli... | | 1998-01-01 |
| 95 |
 |
Regehr, John | An isotach implementation for myrinet | An isotach network provides strong guarantees about message delivery order. We show that an isotach network can be implemented efficiently entirely in software, using commercial o-the-shelf hardware. This report describes that effort. Parts of this implementation could be performed much more efficie... | | 1997-01-01 |
| 96 |
 |
Regehr, John | The case for hierarchical schedulers with performance guarantees | | | 2000-01-01 |
| 97 |
 |
Johnson, Christopher R. | Biomedical visual computing: case studies and challenges | Advances in computational geometric modeling, imaging, and simulation let researchers build and test models of increasing complexity, generating unprecedented amounts of data. As recent research in biomedical applications illustrates, visualization will be critical in making this vast amount of data... | | 2012-01-01 |
| 98 |
 |
Regehr, John | The problems you're having may not be the problems you think you're having: results from a latency study of windows NT | This paper is intended to catalyze discussions on two intertwined systems topics. First, it presents early results from a latency study of Windows NT that identifies some specific causes of long thread scheduling latencies, many of which delay the dispatching of runnable threads for tens of millisec... | | 1999-01-01 |
| 99 |
 |
Regehr, John | Predictable scheduling for digital audio | This paper presents results from applying the Rialto/ NT scheduler to some real Windows 2000 application scenarios. We report on two aspects of this work. First, we studied the reliability of an audio player application and the middleware and kernel components running beneath it in order to assess i... | | 2000-01-01 |
| 100 |
 |
Regehr, John | Operating system support for multimedia: the programming model matters | Multimedia is an increasingly important part of the mix of applications that users run on personal computers and workstations. The requirements placed on a multimedia operating system are demanding and often conflicting: untrusted, independently written soft real-time applications must be able to co... | | 2000-01-01 |
