By Topic

Supercomputing '93:Proceedings of the 1993 ACM/IEEE Conference on Supercomputing

15-19 Nov. 1993

Filter Results

Displaying Results 1 - 25 of 105
  • Fast data parallel polygon rendering

    Publication Year: 1993, Page(s):709 - 718
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (831 KB)

    The authors describe 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 scientific visualization applications. The renderer can handle arbitrarily complex polygons which need not be meshed. Issues i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient feed-forward volume rendering techniques for vector and parallel processors

    Publication Year: 1993, Page(s):699 - 708
    Cited by:  Papers (6)  |  Patents (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (706 KB)

    Rendering volumes represented as a 3D grid of voxels requires an overwhelming amount of processing power. In this paper we investigate efficient techniques for rendering semi-transparent volumes on vector and parallel processors. Parallelism inherent in a regular grid is obtained by decomposing the volume into geometric primitives called beams, slices and slabs of voxels. By using the adjacent pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel memory access mechanism for arbitrary-view-projection volume rendering

    Publication Year: 1993, Page(s):690 - 698
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (568 KB)

    Direct rendering of volume data is both conceptually simpler and more capable of producing visually superior results than other rendering methods. Special hardware architecture for direct volume rendering enables interactive exploration of volume data from arbitrary projection angles, which would otherwise take significantly longer due to its enormous computation and memory requirements. This pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compute intensity and the FFT

    Publication Year: 1993, Page(s):676 - 684
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (550 KB)

    This paper describes how high compute intensity programming techniques combined with algorithms in the literature can result in efficient single- and multi-dimensional FFTs on large numbers of processors on the CRAY APP. The CRAY APP is a shared-memory parallel computer based on the Intel i860 microprocessor. It incorporates up to 84 i860s in an architecture which allows for very efficient gang sc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A visualization environment for supercomputing-based applications in computational mechanics

    Publication Year: 1993, Page(s):550 - 559
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (600 KB)

    The authors characterize a visualization environment that has been designed and prototyped for a large community of scientists and engineers, with an emphasis in supercomputing-based computational mechanics. The proposed environment makes use of a visualization server concept to provide effective, interactive visualization to the user's desktop. Benefits of using the visualization server approach ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message passing in the 1990's: performance, safety, correctness

    Publication Year: 1993, Page(s):767 - 768
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (216 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data-parallel algorithm for three-dimensional Delaunay triangulation and its implementation

    Publication Year: 1993, Page(s):112 - 121
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (639 KB)

    A parallel algorithm for constructing the Delaunay triangulation of a set of vertices in three-dimensional space is presented. The algorithm achieves a high degree of parallelism by starting the construction from every vertex and expanding over all open faces thereafter. In the expansion of open faces, the search is made faster by using a bucketing technique. The algorithm is designed under a data... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A practical external sort for shared disk MPPs

    Publication Year: 1993, Page(s):666 - 675
    Cited by:  Papers (4)  |  Patents (12)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (666 KB)

    An external sort has been implemented and analyzed for a shared disk MPP computer system. In this implementation, we have considered many real world constraints. Decision support functionality in database systems, for instance, often requires that external sorting be done in place on disk, support variable length records, and be restartable from any point of interruption with no loss of data. Thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bispectrum signal processing on HNC's SIMD numerical array processor (SNAP)

    Publication Year: 1993, Page(s):535 - 537
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (680 KB)

    The bispectrum is a processing technique that can be used for improving the detection of signals in noise. It is an order N2 operation performed over a two dimensional frequency plane and, because of computational demands, has not been used much in practice. HNC has developed a commercially available SIMD numerical array processor (SNAP) and implemented Tracor's computationally demandin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • *T: Integrated building blocks for parallel computing

    Publication Year: 1993, Page(s):624 - 635
    Cited by:  Papers (7)  |  Patents (26)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (886 KB)

    The authors present two hardware components for high performance parallel computing: a superscalar RISC microprocessor with an integrated 400 Mb/s user-level network interface (the 88110MP), and a companion 8 × 8 low-latency packet router chip (ARTIC). The design point combines very low message overhead and high delivered communications bandwidth with a commercially competitive sequential pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytical performance prediction on multicomputers

    Publication Year: 1993, Page(s):886 - 894
    Cited by:  Papers (19)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (585 KB)

    Multicomputers have the potential to deliver Gigaflop performance on many scientific applications. Initial implementations of parallel programs on these machines, however, are often inefficient and require significant optimization before they can harness the potential power of the machine. Performance prediction tools can provide valuable information on which optimizations will result in increased... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PVM: Experiences, current status and future direction

    Publication Year: 1993, Page(s):765 - 766
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (240 KB)

    The computing requirements of many current and future applications, ranging from scientific computational problems in the material and physical sciences, to simulation, engineering design, and circuit analysis, are best served by concurrent processing. While hardware multiprocessors can frequently address the computational requirements of these high-performance applications, there are a number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Latency and bandwidth considerations in parallel robotics image processing

    Publication Year: 1993, Page(s):230 - 239
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (616 KB)

    Parallel image processing for robotics applications differs in a fundamental way from parallel scientific computing applications: the problem size is fixed, and latency requirements are tight. This brings Amdhal's law in effect with full force, so that message-passing latency and bandwidth severely restrict performance. The authors examine an application from this domain, stereo image processing, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient implementation of a 3-dimensional ADI method on the iPSC/860

    Publication Year: 1993, Page(s):102 - 111
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (628 KB)

    A comparison is made between several domain decomposition strategies for the solution of three-dimensional partial differential equations on a MIMD distributed memory parallel computer. The grids used are structured, and the numerical algorithm is alternating direction implicit (ADI). Important implementation issues regarding load balancing, storage requirements, network latency, and overlap of co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal fully adaptive wormhole routing for meshes

    Publication Year: 1993, Page(s):782 - 791
    Cited by:  Papers (15)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (635 KB)

    A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of these virtual channels is presented. The routing algorithm imposes less than half as many routing restrictions as any previous fully adaptive routing algorithms. It is also proved that, ignoring symmetry, this routing algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient transposition algorithms for large matrices

    Publication Year: 1993, Page(s):656 - 665
    Cited by:  Papers (13)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (549 KB)

    The authors present transposition algorithms for matrices that do not fit in main memory. Transposition is interpreted as a permutation of the vector obtained by mapping a matrix to linear memory. Algorithms are derived from factorizations of this permutation, using a class of permutations related to the tensor product. Using this formulation of transposition, the authors first obtain several know... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Runtime compilation techniques for data partitioning and communication schedule reuse

    Publication Year: 1993, Page(s):361 - 370
    Cited by:  Papers (16)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (658 KB)

    The authors describe ways in which an HPF compiler can deal with irregular computations effectively. The first mechanism invokes a user specified mapping procedure via a set of compiler directives. The directives allow the user to use program arrays to describe graph connectivity, spatial location of array elements and computational load. The second is a simple conservative method that in many cas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving the Boltzmann equation at 61 gigaflops on a 1024-node CM-5

    Publication Year: 1993, Page(s):528 - 534
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (473 KB)

    The use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave structure, a boundary layer, and general 3-D flow fields is documented. The Bhatnagar-Gross-Krook (BGK) model for the collision term combined with a finite difference scheme was used to model the flow. This collision term requires accurate knowledg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scientific visualization of chemical systems

    Publication Year: 1993, Page(s):296 - 301
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (458 KB)

    Within the past few years, computer graphics has played a decisive role in transforming the field of molecular modeling into an international industry. While computer scientists are conversant in the language of their own discipline, they are often unfamiliar with the terminology and unique graphical constructs of physical scientists. Similarly, physical scientists are often unfamiliar with the la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Terrain visualization on the MAGIC gigabit testbed

    Publication Year: 1993, Page(s): 620
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (177 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitioning the global space for distributed memory systems

    Publication Year: 1993, Page(s):327 - 336
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (579 KB)

    Partitioning the iteration space can significantly affect the execution time of a loop. The authors propose an improvement over previous partitioning methods for single loops with uniform data dependencies. For distributed memory systems, partitioning each loop separately does not guarantee an efficient execution of the code because of across loop data dependence. As a result, a global iteration s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MPI: A message passing interface

    Publication Year: 1993, Page(s):878 - 883
    Cited by:  Papers (32)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (471 KB)

    This paper presents an overview of MPI, a proposed standard message passing interface for MIMD distributed memory concurrent computers. The design of MPI has been a collective effort involving researchers in the United States and Europe from many organizations and institutions. MPI includes point-to-point and collective communication routines, as well as support for process groups, communication c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heterogeneous computing on heterogeneous systems: Software and application issues

    Publication Year: 1993, Page(s):763 - 764
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (258 KB)

    Most applications like image understanding, multidisciplinary analysis and design, and command and control require integrating algorithms from diverse areas such as image processing, numerical analysis, graph theory, artificial intelligence and databases. These problems are difficult to solve on one parallel machine because they consist of several parts, each of which requires differing types and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An empirical comparison of the Kendall Square Research KSR-1 and Stanford DASH multiprocessors

    Publication Year: 1993, Page(s):214 - 225
    Cited by:  Papers (8)  |  Patents (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (823 KB)

    Two interesting variants of large-scale shared-address-space parallel architectures are cache-coherent non-uniform-memory-access machines (CC-NUMA) and cache-only memory architectures (COMA). Both have distributed main memory and use directory-based cache coherence. While both architectures migrate and replicate data at the cache level automatically under hardware control, COMA machines do this at... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advanced compiler optimizations for sparse computations

    Publication Year: 1993, Page(s):430 - 439
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (660 KB)

    Regular data dependence checking on sparse codes usually results in very conservative estimates of actual dependences that will occur at run-time. Clearly, this is caused by the usage of compact data structures that are necessary to exploit sparsity in order to reduce storage requirements and computational time. However, if the compiler is presented with dense code and automatically converts it in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.