检索结果-内蒙古大学图书馆

9th ieee symposium on large data Analysis and visualization (LDAV)

作者： Marrinan, Thomas Rizzi, Silvio Insley, Joseph A. Long, Lance Renambot, Luc Papka, Michael E. Univ St Thomas Houston TX 77006 USA Argonne Natl Lab Argonne IL 60439 USA Northern Illinois Univ De Kalb IL 60115 USA Univ Illinois Chicago IL USA

ISBN: (纸本)9781728126050

When dealing with extremely large data sets or computationally expensive rendering pipelines, local workstations may not he able to render the full data set or maintain interactive frame rates. In these cases, high-performance graphics clusters can he leveraged for distributed rendering. However, this traditionally has removed real-time feedback from the visualization system. In order to harness the power of distributed rendering and the real-time nature of local rendering, we developed PxStream - a streaming framework to transfer dynamically rendered images from high-performance graphics clusters to remote machines in real-time. PxStream clients can range from a standard computer with single monitor to a cluster-driven tiled display wall. Additionally, the PxStream server supports multiple concurrent endpoints to allow collaborators at different physical locations to simultaneously view the image stream. Initial tests demonstrate that PxStream can simultaneously stream 66 megapixel images to two locations at nearly 50 frames per second.

关键词： Streaming in situ big data analysis ultra-high-resolution visualization high-performance computing

来源：评论

学校读者我要写书评

暂无评论

Message from the program chairs

Message from the program chairs

引用

1st ieee symposium on large-Scale data Analysis and visualization 2011, LDAV 2011

作者： Rogers, David Silva, Cláudio T. Sandia National Laboratories United States Polytechnic Institute of New York University United States

ISBN: (纸本)9781467301541

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

parallel rendering techniques for massively parallel visualization

Parallel rendering techniques for massively parallel visuali...

引用

2nd AIZU International symposium on parallel Algorithms/Architecture Synthesis

作者： Hansen, C Krogh, M Painter, J Los Alamos Natl Lab Los Alamos United States

ISBN: (纸本)0818678704

As the resolution of simulation models increases, scientific visualization algorithms which take advantage of the large memory and parallelism of Massively parallel Processors (MPPs) are becoming increasingly important. For large applications rendering on the MPP tends to be preferable to rendering on a graphics workstation due to the MPP's abundant resources: memory, disk, and numerous processors. The challenge becomes developing algorithms that carl exploit these resources while minimizing overhead, typically communication costs. This paper will describe recent efforts in parallel rendering for polygonal primitives as well as parallel volumetric techniques. This paper presents rendering algorithms, developed for massively parallel processors (MPPs), for polygonal, spheres, and volumetric data. The polygon algorithm uses a data parallel approach whereas the sphere and volume render use a MIMD approach. Implementations for these algorithms are presented far the Thinking Machines Corporation CM-5 and the Cray Research Inc T3D.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-Time Compression of Dynamically Generated Images for Offscreen Rendering 9

Real-Time Compression of Dynamically Generated Images for Of...

引用

9th ieee symposium on large data Analysis and visualization (LDAV)

作者： Emerson, Leah Marrinan, Thomas Univ St Thomas St Paul MN 55105 USA Argonne Natl Lab Argonne IL 60439 USA

ISBN: (纸本)9781728126050

Ultra-high-resolution visualizations of large-scale data sets are often rendered using a remotely located graphics cluster that does not have a connected display. In such instances, rendered images must either be streamed over a network for live viewing, or saved to disk for later viewing. This process introduces the additional overhead associated with transferring data off of the GPU device. We present early work on real-time compression of rendered visualizations that aims to reduce both the device-to-host data transfer time and the I/O time for streaming or writing to disk. By using OpenGL / CUDA interop, images are compressed on the GPU prior to transferring the data to main memory. Although there is a computation cost to performing compression, our results show that this overhead is more than offset by the reduced data transfer and I/O times.

关键词： Image compression offline rendering ultra-high-resolution visualization distributed rendering

来源：评论

学校读者我要写书评

暂无评论

parallel Assemblies Plot, a visualization tool to explore categorical and quantitative data: application to digital mobility outcomes 16

Parallel Assemblies Plot, a visualization tool to explore ca...

引用

ieee 16th Pacific visualization symposium (ieee PacificVis)

作者： Cantu, Alma Mico-Amigo, Maria Encarna Del Din, Silvia Fernstad, Sara Johansson Newcastle Univ Sch Comp Newcastle Upon Tyne Tyne & Wear England Newcastle Univ Translat & Clin Res Inst Newcastle Upon Tyne Tyne & Wear England

ISBN: (纸本)9798350321241

This paper presents a tool enabling the visual analysis of multivariate heterogeneous data. large amounts of measured and contextual data are being gathered for a large number of applications, increasing connectivity across different data types. While measured data are often quantitative, contextual data tend to be categorical. This results in datasets containing multivariate data with heterogeneous properties. Difference in the natures of these properties raises challenges when combining them for analysis. This paper presents the design of a tool that enables the exploration of multivariate heterogeneous data by combining the strengths of parallel Coordinates and parallel Sets. The design relied on the application domain of real-life mobility monitoring that is particularly affected by the challenge mentioned above. To validate the suggested approach this paper presents the result of a usability evaluation, which confirms that the presented design is as efficient as other exiting tools while providing more features for correlation analysis.

关键词： Heterogeneous data Multivariate data visualization Technique Scientific visualization

来源：评论

学校读者我要写书评

暂无评论

Implicit Sphere Shadow Maps 10

Implicit Sphere Shadow Maps

引用

ieee Pacific visualization symposium (ieee PacificVis)

作者： Krone, Michael Reina, Guido Zahn, Sebastian Tremel, Tina Bahnmueller, Carsten Ertl, Thomas Univ Stuttgart Visualizat Res Ctr Stuttgart Germany

ISBN: (纸本)9781509057382

Particle data are commonly visualized by rendering a sphere for each particle. Since interactive rendering usually relies on fast local lighting, the spatial arrangement of the spheres is often very hard to perceive. That is, larger functional structures formed by the particles are not easily recognizable. Using global effects such as ambient occlusion or shadows adds important depth cues. In this work, we present Implicit Sphere Shadow Maps (ISSM), an application-tailored approach for large, dynamic particle data sets. This approach can be combined with state-of-the-art object-space ambient occlusion to further emphasize the spatial structure of molecules. We compare our technique against state-of-the-art methods for interactive rendering with respect to image quality and performance.

关键词： Computer graphics [I.3.7]: Three-Dimensional graphics and Realism-Color, shading shadowing, and texture Computer graphics [I.3.8]: Applications-Molecular visualization

来源：评论

学校读者我要写书评

暂无评论

Streamline Integration Using MPI-Hybrid parallelism on a large Multicore Architecture

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2011年第11期17卷 1702-1713页

作者： Camp, David Garth, Christoph Childs, Hank Pugmire, Dave Joy, Kenneth I. Univ Calif Davis Lawrence Berkeley Natl Lab Davis CA 95616 USA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Oak Ridge Natl Lab Oak Ridge TN 37831 USA

Streamline computation in a very large vector field data set represents a significant challenge due to the nonlocal and data-dependent nature of streamline integration. In this paper, we conduct a study of the performance characteristics of hybrid parallel programming and execution as applied to streamline integration on a large, multicore platform. With multicore processors now prevalent in clusters and supercomputers, there is a need to understand the impact of these hybrid systems in order to make the best implementation choice. We use two MPI-based distribution approaches based on established parallelization paradigms, parallelize over seeds and parallelize over blocks, and present a novel MPI-hybrid algorithm for each approach to compute streamlines. Our findings indicate that the work sharing between cores in the proposed MPI-hybrid parallel implementation results in much improved performance and consumes less communication and I/O bandwidth than a traditional, nonhybrid distributed implementation.

关键词： Concurrent programming parallel programming modes of computation parallelism and concurrency picture/image generation display algorithms

来源：评论

学校读者我要写书评

暂无评论

Standardized data-parallel Rendering Using ANARI 14

Standardized Data-Parallel Rendering Using ANARI

引用

14th symposium on large data Analysis and visualization

作者： Wald, Ingo Zellmann, Stefan Amstutz, Jefferson Wu, Qi Griffin, Kevin Jaros, Milan Wesner, Stefan NVIDIA Santa Clara CA 95051 USA Univ Cologne Cologne Germany Univ Calif Davis Davis CA USA VSB Tech Univ Ostrava IT4Innovat Ostrava Czech Republic

ISBN: (纸本)9798331516932;9798331516925

We propose and discuss a paradigm that allows for expressing data-parallel rendering with the classically non-parallel ANARI API. We propose this as a new standard for data-parallel rendering, describe two different implementations of this paradigm, and use multiple sample integrations into existing applications to show how easy it is to adopt, and what can be gained from doing so.

关键词： anari distributed rendering ray tracing sci-vis

来源：评论

学校读者我要写书评

暂无评论

IExchange: Asynchronous Communication and Termination Detection for Iterative Algorithms 11

IExchange: Asynchronous Communication and Termination Detect...

引用

ieee 11th symposium on large data Analysis and visualization (LDAV)

作者： Morozov, Dmitriy Peterka, Tom Guo, Hanqi Raj, Mukund Xu, Jiayi Shen, Han-Wei Lawrence Berkeley Natl Lab Berkeley CA 94720 USA Argonne Natl Lab Lemont IL USA Ohio State Univ Columbus OH 43210 USA

ISBN: (纸本)9781665432832

Iterative parallel algorithms can be implemented by synchronizing after each round. This bulk-synchronous parallel (BSP) pattern is inefficient when strict synchronization is not required: global synchronization is costly at scale and prohibits amortizing load imbalance over the entire execution, and termination detection is challenging with irregular data-dependent communication. We present an asynchronous communication protocol that efficiently interleaves communication with computation. The protocol includes global termination detection without obstructing computation and communication between nodes. The user's computational primitive only needs to indicate when local work is done;our algorithm detects when all processors reach this state. We do not assume that global work decreases monotonically, allowing processors to create new work. We illustrate the utility of our solution through experiments, including two large data analysis and visualization codes: parallel particle advection and distributed union-find. Our asynchronous algorithm is several times faster with better strong scaling efficiency than the synchronous approach.

关键词： Computing methodologies parallel computing methodologies parallel algorithms Massively parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Interactive point-based rendering of higher-order tetrahedral data

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2006年第5期12卷 1229-1236页

作者： Zhou, Yuan Garland, Michael Univ Illinois Dept Comp Sci Urbana IL 61801 USA

Computational simulations frequently generate solutions defined over very large tetrahedral volume meshes containing many millions of elements. Furthermore, such solutions may often be expressed using non-linear basis functions. Certain solution techniques, such as discontinuous Galerkin methods, may even produce non-conforming meshes. Such data is difficult to visualize interactively, as it is far too large to fit in memory and many common data reduction techniques, such as mesh simplification, cannot be applied to non-conforming meshes. We introduce a point-based visualization system for interactive rendering of large, potentially non-conforming, tetrahedral meshes. We propose methods for aclaptively sampling points from non-linear solution data and for decimating points at run time to fit GPU memory limits. Because these are streaming processes, memory consumption is independent of the input size. We also present an order-independent point rendering method that can efficiently render volumes on the order of 20 million tetrahedra at interactive rates.

关键词： interactive large higher-order tetrahedral volume visualization point-based visualization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：