Time and Space Optimal Data Parallel Volume Rendering Using Permutation Warping

نویسندگان

  • Craig M. Wittenbrink
  • Arun K. Somani
چکیده

in the department of electrical engineering and the department of computer science and engineering. He earned his MSEE and Ph.D degrees in electri-period he designed and developed an anti-submarine warfare system for Indian Navy. Professor Somani's research interests are in the area of fault tolerant computing, computer interconnection networks, computer architecture, parallel computer systems algorithms. Currently he is involved in the following projects: i) high integrity system design specifically addressing the issues related to cache memory faults and performance analysis tools for such systems; ii) resource management , fault tolerance, and interworking of LAN/MAN/WAN in ATM networks; and iii) Optical WDM networks design and role of wavelength converters in such networks. He was the chief architect of the Meshkin architecture for fault tolerant computing and Proteus multiprocessor architecture designed and built at the University of Washington to study the effectiveness of coarse-grain processing mechanism. He is also developing an analysis tool, Himap, to facilitate hierarchical modeling and analysis of systems using fault trees, markov chains, and stochastic petri nets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data Dependent Optimizations for Permutation Volume Rendering

We have developed a highly e cient, high delity approach for parallel volume rendering that is called permutation warping. Permutation warping may use any one pass lter kernel, an example of which is trilinear reconstruction, an advantage over the shear warp approach. This work discusses experiments in improving permutation warping using data dependent optimizations to make it more competitive ...

متن کامل

Data Dependent Optimizations for Permutation Volume

We have developed a highly e cient, high delity approach for parallel volume rendering that is called permutation warping. Permutation warping may use any one pass lter kernel, an example of which is trilinear reconstruction, an advantage over the shear warp approach. This work discusses experiments in improving permutation warping using data dependent optimizations to make it more competitive ...

متن کامل

Extensions to Permutation Warping for Parallel Volume Rendering

Biomedical volume visualization requires high quality and high performance, but the existing high performance solutions such as the Shear Warp algorithm, 3D texture mapping, and special purpose hardware have problems. Permutation warping achieves high delity for biomedical datasets of regular rectilinear volumes, using a one-to-one communication scheme for optimal O(1) communication on massivel...

متن کامل

Designing Optimal Parallel Volume Rendering Algorithms

Designing Optimal Parallel Volume Rendering Algorithms by Craig Michael Wittenbrink Chairperson of the Supervisory Committee: Professor Arun K. Somani Department of Electrical Engineering and Department of Computer Science and Engineering Volume rendering is a method for visualizing volumes of sampled data such as CT, MRI, and finite element simulations. Visualization of medical and simulation ...

متن کامل

A Parallel Pipelined Renderer for the Time-Varying Volume Data

This paper presents a strategy for efficiently rendering time-varying volume data sets on a distributedmemory parallel computer. Time-varying volume data take large storage space and visualizing them requires reading large files continuously or periodically throughout the course of the visualization process. Instead of using all the processors to collectively render one volume at a time, a pipe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 1997