Feed-forward volume rendering algorithm for moderately parallel MIMD machines

Algorithms for direct volume rendering on parallel and vector processors are investigated. Volumes are transformed efficiently on parallel processors by dividing the data into slices and beams of voxels. Equal sized sets of slices along one axis are distributed to processors. Parallelism is achieved at two levels. Because each slice can be transformed independently of others, processors transform their assigned slices with no communication, thus providing maximum possible parallelism at the first level. Within each slice, consecutive beams are incrementally transformed using coherency in the transformation computation. Also, coherency across slices can be exploited to further enhance performance. This coherency yields the second level of parallelism through the use of the vector processing or pipelining. Other ongoing efforts include investigations into image reconstruction techniques, load balancing strategies, and improving performance

Commodity Computing Clusters at Goddard Space Flight Center

The purpose of commodity cluster computing is to utilize large numbers of readily available computing components for parallel computing to obtaining the greatest amount of useful computations for the least cost. The issue of the cost of a computational resource is key to computational science and data processing at GSFC as it is at most other places, the difference being that the need at GSFC far exceeds any expectation of meeting that need. Therefore, Goddard scientists need as much computing resources that are available for the provided funds. This is exemplified in the following brief history of low-cost high-performance computing at GSFC

NASA high performance computing and communications program

The National Aeronautics and Space Administration's HPCC program is part of a new Presidential initiative aimed at producing a 1000-fold increase in supercomputing speed and a 100-fold improvement in available communications capability by 1997. As more advanced technologies are developed under the HPCC program, they will be used to solve NASA's 'Grand Challenge' problems, which include improving the design and simulation of advanced aerospace vehicles, allowing people at remote locations to communicate more effectively and share information, increasing scientist's abilities to model the Earth's climate and forecast global environmental trends, and improving the development of advanced spacecraft. NASA's HPCC program is organized into three projects which are unique to the agency's mission: the Computational Aerosciences (CAS) project, the Earth and Space Sciences (ESS) project, and the Remote Exploration and Experimentation (REE) project. An additional project, the Basic Research and Human Resources (BRHR) project exists to promote long term research in computer science and engineering and to increase the pool of trained personnel in a variety of scientific disciplines. This document presents an overview of the objectives and organization of these projects as well as summaries of individual research and development programs within each project

A twisted disk equation that describes warped galaxy disks

Warped H1 gas layers in the outer regions of spiral galaxies usually display a noticeably twisted structure. This structure is thought to arise primarily as a result of differential precession in the H1 disk as it settles toward a 'preferred orientation' in an underlying dark halo potential well that is not spherically symmetric. In an attempt to better understand the structure and evolution of these twisted, warped disk structures, we have utilized the 'twist-equation' formalism. Specifically, we have generalized the twist equation to allow the treatment of non-Keplerian disks and from it have derived the steady-state structure of twisted disks that develop from free precession in a nonspherical, logarithmic halo potential. This generalized equation can also be used to examine the time-evolutionary behavior of warped galaxy disks

Accretion disks around black holes

The physics of accretion flow very close to a black hole is dominated by several general relativistic effects. It cannot be described by the standard Shakura Sunyaev model or by its relativistic version developed by Novikov and Thome. The most important of these effects is a dynamical mass loss from the inner edge of the disk (Roche lobe overflow). The relativistic Roche lobe overflow induces a strong advective cooling, which is sufficient to stabilize local, axially symmetric thermal and viscous modes. It also stabilizes the non-axially-symmetric global modes discovered by Papaloizou and Pringle. The Roche lobe overflow, however, destabilizes sufficiently self-gravitating accretion disks with respect to a catastrophic runaway of mass due to minute changes of the gravitational field induced by the changes in the mass and angular momentum of the central black hole. One of the two acoustic modes may become trapped near the inner edge of the disk. All these effects, absent in the standard model, have dramatic implications for time-dependent behavior of the accretion disks around black holes

An efficient three-dimensional Poisson solver for SIMD high-performance-computing architectures

We present an algorithm that solves the three-dimensional Poisson equation on a cylindrical grid. The technique uses a finite-difference scheme with operator splitting. This splitting maps the banded structure of the operator matrix into a two-dimensional set of tridiagonal matrices, which are then solved in parallel. Our algorithm couples FFT techniques with the well-known ADI (Alternating Direction Implicit) method for solving Elliptic PDE's, and the implementation is extremely well suited for a massively parallel environment like the SIMD architecture of the MasPar MP-1. Due to the highly recursive nature of our problem, we believe that our method is highly efficient, as it avoids excessive interprocessor communication

Fast data parallel polygon rendering

Journal ArticleThis paper describes a data parallel method for polygon rendering on a massively parallel machine. This method, based on a simple shading model, is targeted for applications which require very fast rendering for extremely large sets of polygons. Such sets are found in many scienti c visualization applications. The renderer can handle arbitrarily complex polygons which need not be meshed. Issues involving load balancing are addressed and a data parallel load balancing algorithm is presented. The rendering and load balancing algorithms are implemented on both the CM-200 and the CM-5. Experimental results are presented. This rendering toolkit enables a scientist to display 3D shaded polygons directly from a parallel machine avoiding the transmission of huge amounts of data to a post-processing rendering system

Workshop on Physics of Accretion Disks Around Compact and Young Stars

The papers that were presented at the Workshop on Physics of Accretion Disks Around Compact and Young Stars are contained in this volume. The workshop was held on 8-10 Apr. 1994 in Houston, Texas