|
|
Creator | Title | Description | Subject | Date |
51 |
|
Wan, Yong | Interactive extraction of neural structures with user-guided morphological diffusion | Extracting neural structures with their fine details fromconfocal volumes is essential to quantitative analysis in neurobiology research. Despite the abundance of various segmentation methods and tools, for complex neural structures, both manual and semi-automatic methods are ineffective either in f... | | 2012-01-01 |
52 |
|
Hansen, Charles D. | Interactive rendering and efficient querying for large multivariate seismic volumes on consumer level PCs | We present a volume visualization method that allows interactive rendering and efficient querying of large multivariate seismic volume data on consumer level PCs. The volume rendering pipeline utilizes a virtual memory structure that supports out-of-core mul- tivariate multi-resolution data and a GP... | | 2013-01-01 |
53 |
|
Pascucci, Valerio | Mapping applications with collectives over sub-communicators on torus networks | The placement of tasks in a parallel application on specific nodes of a supercomputer can significantly impact performance. Traditionally, this task mapping has focused on reducing the distance between communicating tasks on the physical network. This minimizes the number of hops that point-to-point... | | 2012-01-01 |
54 |
|
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 |
55 |
|
Regehr, John | Efficient memory safety for TinyOS | Reliable sensor network software is difficult to create: applications are concurrent and distributed, hardware-based memory protection is unavailable, and severe resource constraints necessitate the use of unsafe, low-level languages. Our work improves this situation by providing efficient memory an... | | 2007-01-01 |
56 |
|
Regehr, John | Eliminating the call stack to save RAM | Most programming languages support a call stack in the programming model and also in the runtime system.We show that for applications targeting low-power embedded microcontrollers (MCUs), RAM usage can be significantly decreased by partially or completely eliminating the runtime callstack. We presen... | | 2009-01-01 |
57 |
|
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 |
58 |
|
Regehr, John | Help, help, Im being suppressed the significance of suppressors in software testing | Abstract-Test features are basic compositional units used to describe what a test does (and does not) involve. For example, in API-based testing, the most obvious features are function calls; in grammar-based testing, the obvious features are the elements of the grammar. The relationship between fea... | | 2013-01-01 |
59 |
|
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 |
60 |
|
Berzins, Martin | Investigating applications portability with the Uintah DAG-based runtime system on PetaScale supercomputers | Present trends in high performance computing present formidable challenges for applications code using multicore nodes possibly with accelerators and/or co-processors and reduced memory while still attaining scalability. Software frameworks that execute machine-independent applications code using a ... | | 2013-01-01 |
61 |
|
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 |
62 |
|
Gopalakrishnan, Ganesh | MAPPED: Predictive dynamic analysis tool for MPI applications | Abstract-Formal dynamic analysis of MPI programs is critically important since conventional testing tools for message passing programs do not cover the space of possible non-deterministic communication matches, thus may miss bugs in the unexamined execution scenarios. While modern dynamic verificati... | | 2012-01-01 |
63 |
|
Pascucci, Valerio | Exploring power behaviors and trade-offs of in-situ data analytics | As scientific applications target exascale, challenges related to data and energy are becoming dominating concerns. For example, coupled simulation workflows are increasingly adopting in-situ data processing and analysis techniques to address costs and overheads due to data movement and I/O. However... | | 2013-01-01 |
64 |
|
Kasera, Sneha K. | Exploiting altruism in social networks for friend-to-friend malware detection | We propose a novel malware detection application- SocialScan-which enables friend-to-friend (f2f) malware scanning services among social peers, with scanning resource sharing governed by levels of social altruism. We show that with f2f sharing of resources, SocialScan achieves a 65% increase in the ... | | 2014-01-01 |
65 |
|
Pascucci, Valerio | Exploring performance data with boxfish | The growth in size and complexity of scaling applications and the systems on which they run pose challenges in analyzing and improving their overall performance. With metrics coming from thousands or millions of processes, visualization techniques are necessary to make sense of the increasing amount... | | 2012-01-01 |
66 |
|
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 |
67 |
|
Kirby, Robert Michael | GPU-based volume visualization from high-order finite element fields | This paper describes a new volume rendering system for spectral/hp finite-element methods that has as its goal to be both accurate and interactive. Even though high-order finite element methods are commonly used by scientists and engineers, there are few visualization methods designed to display thi... | | 2014-01-01 |
68 |
|
Regehr, John | HLS: a framework for composing soft real-time schedulers | Hierarchical CPU scheduling has emerged as a way to (1) support applications with diverse scheduling requirements in open systems, and (2) provide load isolation between applications, users, and other resource principals. Most existing work on hierarchical scheduling has focused on systems that prov... | | 2001-01-01 |
69 |
|
Regehr, John | How to rapidly prototype a real-time scheduler | Implementing a new scheduling algorithm in an OS kernel is often an important step in scheduling research because it permits evaluation of the algorithm's performance on real workloads. However, developing a new scheduler is not a trivial task because it requires sophisticated programming skills and... | | 2002-01-01 |
70 |
|
Bronson, Jonathan Richard | Lattice cleaving: a multimaterial tetrahedral meshing algorithm with guarantees | We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral... | | 2014-01-01 |
71 |
|
Gopalakrishnan, Ganesh | Efficient search for inputs causing high floating-point errors | Tools for floating-point error estimation are fundamental to program understanding and optimization. In this paper, we focus on tools for determining the input settings to a floating point routine that maximizes its result error. Such tools can help support activities such as precision allocation, p... | | 2014-01-01 |
72 |
|
Pascucci, Valerio | Efficient data restructuring and aggregation for I/O acceleration in PIDX | Hierarchical, multiresolution data representations enable interactive analysis and visualization of large-scale simulations. One promising application of these techniques is to store high performance computing simulation output in a hierarchical Z (HZ) ordering that translates data from a Cartesian ... | | 2012-01-01 |
73 |
|
Venkatasubramanian, Suresh | Efficient protocols for distributed classification and optimization | A recent paper [1] proposes a general model for distributed learning that bounds the communication required for learning classifiers with e error on linearly separable data adversarially distributed across nodes. In this work, we develop key improvements and extensions to this basic model. Our first... | | 2012-01-01 |
74 |
|
Regehr, John | Efficient type and memory safety for tiny embedded systems | We report our experience in implementing type and memory safety in an efficient manner for sensor network nodes running TinyOS: tiny embedded systems running legacy, C-like code. A compiler for a safe language must often insert dynamic checks into the programs it produces; these generally make progr... | | 2006-01-01 |
75 |
|
Regehr, John | Finding and understanding bugs in C compilers | Compilers should be correct. To improve the quality of C compilers, we created Csmith, a randomized test-case generation tool, and spent three years using it to find compiler bugs. During this period we reported more than 325 previously unknown bugs to compiler developers. Every compiler we tested w... | | 2011-01-01 |