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

Proceedings of the 5th symposium on the Frontiers of Massively parallel Computation

作者： Srinivas, Suresh Indiana Univ Bloomington United States

A new programming style for large-scale parallel programs centered around distributed data structures has emerged. The current parallel program visualization tools were intended for the old style and do not deal with distributed data structures. We show, with several examples of visualizations and animations developed for large scale pC++ programs, that visualizing and animating distributed data structures is an important part of debugging and performance tuning for the new style parallel programs. Our approach is based on a new methodology for recording execution behavior that uses I/O abstractions and compile time source analysis and instrumentation.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Optimal parallel algorithm for volume ray casting

Optimal parallel algorithm for volume ray casting

引用

Proceedings of the 5th symposium on the Frontiers of Massively parallel Computation

作者： Goel, Vineet Mukherjee, Amar Univ of Central Florida Orlando United States

Volume rendering by ray casting is a computation-ally expensive problem. For interactive volume visualization, rendering has to be done in real time (30 frames/sec). Since the typical 3-D dataset size is 2563, the use of parallel processing is imperative. In this paper, we present an O(log n) EREW algorithm for volume rendering using O(n3) processors which can be optimized to O(log3 n) time using O(n3/log3 n) processors. We have implemented our algorithm on MasPar MP1200. The implementation results show that a frame from 2563 data size is generated in 11 seconds using 4096 processors. This time can be further reduced by using a large number of processors.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication overhead for space science applications on the Beowulf parallel workstation

Communication overhead for space science applications on the...

引用

Proceedings of the 4th ieee International symposium on High Performance Distributed Computing

作者： Sterling, Thomas Savarese, Daniel Becker, Donald J. Fryxell, Bruce Olson, Kevin NASA Goddard Space Flight Cent Greenbelt United States

The Beowulf parallel workstation combines 16 PC-compatible processing subsystems and disk drives using dual Ethernet networks to provide a single-user environment with 1 Gops peak performance, half a Gbyte of disk storage, and up to 8 times the disk I/O bandwidth of conventional workstations. The Beowulf architecture establishes a new operating point in price-performance for single-user environments requiring high disk capacity and bandwidth. The Beowulf research project is investigating the feasibility of exploiting mass market commodity computing elements in support of Earth and space science requirements for large data-set browsing and visualization, simulation of natural physical processes, and assimilation of remote sensing data. This paper reports the findings from a series of experiments for characterizing the Beowulf dual channel communication overhead. It is shown that dual networks can sustain 70% greater throughput than a single network alone but that bandwidth achieved is more highly sensitive to message size than to the number of messages at peak demand. While overhead is shown to be high for global synchronization, its overall impact on scalability of real world applications for computational fluid dynamics and N-body gravitational simulation is shown to be modest.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Real-time volume rendering on shared memory multiprocessors using the shear-warp factorization 95

Real-time volume rendering on shared memory multiprocessors ...

引用

Proceedings of the 1995 parallel Rendering symposium

作者： Lacroute, Philippe Stanford Univ Stanford CA United States

ISBN: (纸本)9780897917742

This paper presents a new parallel volume rendering algorithm that can render 2563 voxel medical data sets at over 10 Hz and 1283 voxel data sets at over 30 Hz on a 16-processor Silicon graphics Challenge. The algorithm achieves these results by minimizing each of the three components of execution time: computation time, synchronization time, and data communication time. Computation time is low because the parallel algorithm is based on the recently-reported shear-warp serial volume rendering algorithm which is over five times faster than previous serial algorithms. Synchronization time is minimized by using dynamic load balancing and a task partition that minimizes synchronization events. data communication costs are low because the algorithm is implemented for shared-memory multiprocessors, a class of machines with hardware support for low-latency fine-grain communication and hardware caching to hide latency. We draw two conclusions from our implementation. First, we find that on shared-memory architectures data redistribution and communication costs do not dominate rendering time. Second, we find that cache locality requirements impose a limit on parallelism in volume rendering algorithms. Specifically, our results indicate that shared-memory machines with hundreds of processors would be useful only for rendering very large data sets.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel volume rendering

Parallel volume rendering

引用

International symposium on parallel Processing

作者： R. Westermann Scientific Visualization Group German National Research Center for Computer Science (GMD) Sankt Augustin Germany

Several methods have been developed to visualize three dimensional volume data on multiprocessor computer systems. Most of these algorithms were strongly adapted to the underlying target architecture, and often did not take account requirements such as scalability, portability, or memory minimization. The paper outlines a new approach for rendering large scale volume data on distributed memory parallel computers. Within this framework, the only limiting factor concerning the resolution of the processed data is the node local memory. Furthermore, porting to other multiprocessor systems is straight forward, and scalability with increasing numbers of processors is achieved.< >

关键词： Integral equations data visualization Scalability Rendering (computer graphics) Optical attenuators Computer science Computer architecture Marketing and sales Concurrent computing Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

An optimal parallel algorithm for volume ray casting

An optimal parallel algorithm for volume ray casting

引用

Frontiers of Massively parallel Computation

作者： V. Goel A. Mukherjee Department of Computer Science University of Central Florida Orlando FL USA

Volume rendering by ray casting is a computationally expensive problem. For interactive volume visualization, rendering has to be done in real time (30 frames/sec). Since the typical 3-D dataset size is 256/sup 3/ the use of parallel processing is imperative. In this paper, we present an O(log n) EREW algorithm for volume rendering using O(n/sup 3/) processors which can be optimized to O(log/sup 3/ n) time using O(n/sup 3//log/sup 3/ n) processors. We have implemented our algorithm on MasPar MP1200. The implementation results show that a frame from 256/sup 3/ data size is generated in 11 seconds using 4096 processors. This time can be further reduced by using a large number of processors.< >

关键词： parallel algorithms Casting Rendering (computer graphics) Computer architecture parallel processing Computer science data visualization Prototypes Costs Interpolation

来源：评论

学校读者我要写书评

暂无评论

Research report. dataSpace: 3-D visualizations of large databases

Research report. DataSpace: 3-D visualizations of large data...

引用

ieee symposium on Information visualization (INFOVIS)

作者： V. Anupam S. Dar T. Leibfried E. Petajan AT and T Bell Laboratories Inc. Murray Hill NJ USA University of Houston Clear Lake TX USA

dataSpace is a system for interactive 3-D visualization and analysis of large databases. dataSpace utilizes the display space by placing panels of information, possibly generated by different visualization applications, in a 3-D graph layout, and providing continuous navigation facilities. Selective rearrangements and transparency can be used to reduce occlusion or to compare or merge a set of images (e.g. line graphs or scatter plots) that are aligned and stacked in depth. A prototype system supporting the basic 3-D graphic operations (layout, zoom, rotation, translation, transparency) has been implemented. We provide several illustrative examples of dataSpace displays taken from the current system. We present the 3-D display paradigm, describe the query, layout and rendering steps required to create a display, and discuss some performance issues.

关键词： visualization Visual databases Displays Layout data analysis Image databases Navigation Scattering Prototypes graphics

来源：评论

学校读者我要写书评

暂无评论

Communication overhead for space science applications on the Beowulf parallel workstation 95

Communication overhead for space science applications on the...

引用

International symposium on High Performance Distributed Computing

作者： T. Sterling D. Savarese D.J. Becker B. Fryxell K. Olson Center of Excellence in Space Dataand Information Sciences NASA Goddard Space Flight Center Greenbelt MD USA Department of Computer Science University of Maryland College Park MD USA Institute for Computational Scienceand Informatics George Mason University USA

ISBN: (纸本)9780818670886

The Beowulf parallel workstation combines 16 PC-compatible processing subsystems and disk drives using dual Ethernet networks to provide a single-user environment with 1 Gops peak performance, half a Gbyte of disk storage, and up to 8 times the disk I/O bandwidth of conventional workstations. The Beowulf architecture establishes a new operating point in price-performance for single-user environments requiring high disk capacity and bandwidth. The Beowulf research project is investigating the feasibility of exploiting mass market commodity computing elements in support of Earth and space science requirements for large data-set browsing and visualization, simulation of natural physical processes, and assimilation of remote sensing data. This paper reports the findings from a series of experiments for characterizing the Beowulf dual channel communication over-head. It is shown that dual networks can sustain 70% greater throughput than a single network alone but that bandwidth achieved is more highly sensitive to message size than to the number of messages at peak demand. While overhead is shown to be high for global synchronization, its overall impact on scalability of real world applications for computational fluid dynamics and N-body gravitational simulation is shown to be modest.

关键词： Bandwidth Workstations Computational modeling Disk drives Ethernet networks Computer architecture Physics computing Geoscience data visualization Remote sensing

来源：评论

学校读者我要写书评

暂无评论

A NEW ALGORITHM FOR INTERACTIVE graphics ON MULTICOMPUTERS

引用

ieee COMPUTER graphics AND APPLICATIONS 1994年第4期14卷 33-40页

作者： ELLSWORTH, DA University of North Carolina Chapel Hill USA

As nonshared-memory multiple instruction, multiple data (MIMD) systems become more common, it becomes important to develop parallel rendering algorithms for them. These systems, known as multicomputers, can produce data sets so large that it is difficult to visualize the data on conventional graphics systems, especially if the visualization proceeds in tandem with the calculation. parallel systems must run interactive graphics to allow convenient visualizations of their computations. While few parallel systems currently have a frame buffer that will support interactive rendering, such systems should be more common in the future. This article describes an algorithm suited for interactive polygon rendering, where the model's image on screen generally has frame-to-frame coherence. The algorithm uses this coherence to perform load-balancing calculations in parallel with the other calculations. The algorithm also uses an optimized version of personalized all-to-all communication, where all processors communicate with all other processors.

关键词： PROCESSOR coherence interactive graphic visualization Personalizing frame buffer algorithms parallel system Rendering parallel Lines multicomputer

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ISSUES IN data MODELING FOR SCIENTIFIC visualization

引用

ieee COMPUTER graphics AND APPLICATIONS 1994年第2期14卷 70-73页

作者： NIELSON, GM BRUNET, P GROSS, M HAGEN, H KLIMENKO, SV UNIV KAISERSLAUTERN W-6750 KAISERSLAUTERNGERMANY UNIV POLITECN CATALUNA BARCELONASPAIN COMP GRAPH CTR DARMSTADTGERMANY INST HIGH ENERGY PHYS SERPUKHOVRUSSIA

This article summarizes some topics of modeling as they impinge on the future development of scientific data visualization. The benefits from visualization techniques in analyzing data are well established, but to build on these pioneering efforts, one must recognize modeling as a distinct structural component in the larger context of visualization and problem-solving systems. Volume modeling is the entry way to this arena of future development, and model-based rendering describes how scientists will view the results. Important side developments such as multiresolution modeling and model-based segmentation will contribute structural capability to these systems. All of these components ultimately depend on the mathematical foundations of scattered data modeling and on model validation and standards to incorporate this modeling methodology into effective tools for scientific inquiry.< >

关键词： data visualization Rendering (computer graphics) Neoplasms Hurricanes Magnetic resonance imaging Computer graphics Thumb Delay parallel processing Hardware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：