By Topic

Supercomputing '88:Proceedings of the 1988 ACM/IEEE Conference on Supercomputing, Vol. I

14-18 Nov. 1988

Filter Results

Displaying Results 1 - 25 of 58
  • Proceedings. Supercomputing '88 (IEEE Cat. No.88CH2617-9)

    Publication Year: 1988
    Request permission for commercial reuse | PDF file iconPDF (204 KB)
    Freely Available from IEEE
  • Faust: an environment for programming parallel scientific applications

    Publication Year: 1988, Page(s):3 - 10
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (501 KB)

    The goals and architecture of the Faust environment are presented. The components of the Faust user-interface library are described. The Faust program abstraction supports three levels of detail: the process graph, the subroutine interconnection graph, and the program source code. Each level is described in detail.<> View full abstract»

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

    Publication Year: 1988, Page(s):51 - 52
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (196 KB)

    The author is currently building a prototype compiler to determine the appropriateness of the Horizon instruction set as a target for a compiler and to test several of Horizon's special hardware features. He reports some early results that have affected the instruction set. He then focuses on two aspects of the instruction set architecture: the moderately wide instruction word and the lookahead ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance prediction for the Horizon supercomputer

    Publication Year: 1988, Page(s):48 - 50
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    Horizon is a shared-memory multiple-instruction-stream-multiple-data-stream architecture currently under study. The performance of one Horizon processing element (PE) is quantified by user operations per instruction, the instructions per tick, and the basic clock rate. Assuming there is sufficient parallelism within a problem, the performance of one PE is multiplied by the number of PEs contained ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a 3D toroidal network for a shared memory architecture

    Publication Year: 1988, Page(s):42 - 47
    Cited by:  Papers (10)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Horizon is a shared-memory multiple-instruction-stream-multiple-data-stream architecture currently under development. A synchronized network model suitable for this architecture is described. The model is defined in terms of a topology and routing policy. A three-dimensional toroidal topology is investigated for its multiple redundant paths, memory locality, and simplicity in both routing and cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scheme for data compression in supercomputers

    Publication Year: 1988, Page(s):272 - 278
    Cited by:  Patents (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    A compression algorithm that is tailored to utilize the enormous speed and memory size of supercomputers is presented. It utilizes an enhanced arithmetic coding scheme. Efficient VLSI designs for the enhanced scheme are given. The designs are suitable for inclusion in disk and communication controllers of supercomputers and would provide a practical way to increase thresholds of data transfer rate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Joint Research Council's supercomputing unit

    Publication Year: 1988, Page(s):450 - 455
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    A brief description is given of the Joint Research Councils' Supercomputer Unit, a Cray X-MP/48 installation for the use of academic researchers in the UK. Both hardware and system software are examined. Operational experience and scientific use of the machine are discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Squeezing more CPU performance out of a Cray-2 by vector block scheduling

    Publication Year: 1988, Page(s):237 - 245
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    Compile-time scheduling of vector activities on the Cray 2 is studied using a simplified model of the vector instruction stream. An approach based on experience with an array-processor microde scheduling by the authors is shown to be practical. It calls for a pass of loop scheduling followed by a pass of resource allocation. Actual benchmarks of the resulting code are shown, exhibiting speedups as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scientific visualization workbench

    Publication Year: 1988, Page(s):148 - 155
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1076 KB)

    A system for visualization of data from supercomputer simulations has been developed. The scientific visualization workbench, as it is called, is based on an industry standard workstation (a Sun 3/160C), the NeWS window system, and a video/graphics add-in card, which is supported by NeWS. Also involved is a frame buffer attached to a 48-Mb/s Cray channel and a video link from the frame buffer to t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A processor architecture for Horizon

    Publication Year: 1988, Page(s):35 - 41
    Cited by:  Papers (35)  |  Patents (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Horizon is a scalable shared-memory multiple-instruction-stream-multiple-data-stream computer, currently under study, composed of a few hundred identical scalar processors and a comparable number of memories, sparsely embedded in a three-dimensional nearest-neighbor network. Each processor has a horizontal instruction set that can perform up to three floating-point operations per cycle without res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FACOM 6443 magneto-optic disk sub-system

    Publication Year: 1988, Page(s):266 - 271
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    A rewritable optical disk drive is described. The drive has a large storage capacity of 8.9 Gb/spindle with a few seconds of access time. It can store data economically in a small floor space, and it can be used as a supplement or partial alternative to magnetic disk drives or tape library units. The authors discuss the drive technologies, support software, and application of this subsystem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling techniques for first-order linear recurrences on a vector computer

    Publication Year: 1988, Page(s):174 - 181
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    The authors discuss high-performance methods for solving first-order linear recurrences on a vector computer, investigate automatic transformations, and develop the compiling techniques for first-order linear recurrence problems. The results show that the improved vector code generated by the vectorizing compiler run at the rate of 150 MFLOPS (million floating operations per second), in the case o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Development of job-job step scheduler for NAL numerical simulator

    Publication Year: 1988, Page(s):200 - 206
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    The authors present the concepts and functions of the job-job step scheduler that is the kernel of the software packages developed for the management of the NAL numerical simulator (NS). This scheduler is partially responsible for the high operating ratio of supercomputers in NS, and there is some guarantee of job turnaround View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supercomputer integration program at Boeing

    Publication Year: 1988, Page(s):442 - 449
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    The authors define supercomputers as specialized machines, describe their impact on software and applications, and introduce two major supercomputing issues, namely, visualization and communication. They then discuss supercomputer integration programs, and their current experience related to the Alabama Supercomputer Network View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vector and parallel processing of the nuclear reactor transient analysis code RELAP5

    Publication Year: 1988, Page(s):230 - 236
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    An experiment on vector processing and multitasking of the nuclear reactor transient analysis code RELAPS has been carried out. Vector processing and multitasking were achieved by using the independency of the spatial meshes. The vectorization ratio is 83%. The performance ratio in the vector mode to that in the scalar mode is about three on the FACOM VP-100. For multitasking the spatial meshes ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Strassen-Newton algorithm for high-speed parallelizable matrix inversion

    Publication Year: 1988, Page(s):419 - 424
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    Techniques are described for computing matrix inverses by algorithms that are highly suited to massively parallel computation. The techniques are based on an algorithm suggested by V. Strassen (1969). Variations of this scheme use matrix Newton iterations and other methods to improve the numerical stability while at the same time preserving a very high level of parallelism. One-processor Cray-2 im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of a supercomputer frame buffer system

    Publication Year: 1988, Page(s):140 - 147
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    A 512-by-512-pixel by 8-bits-per-pixel frame buffer has been designed, constructed, and installed on a 48-Mb/s I/O channel of a Cray X-MP 4/16 supercomputer. This project was undertaken to test whether such a system would be useful and, if so, how it would be used. Supporting software provides the ability to convert vector graphics description files into raster format, to show raster movies intera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Vectorizing compilers: a test suite and results

    Publication Year: 1988, Page(s):98 - 105
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    A collection of 100 Fortran loops used to test the effectiveness of an automatic vectorizing compiler is described. The results of compiling these loops using commercially available, vectorizing Fortran compilers on a variety of supercomputers, minisupercomputers, and mainframes are presented. The testing methodology and loop scoring are explored View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Horizon supercomputing system: architecture and software

    Publication Year: 1988, Page(s):28 - 34
    Cited by:  Papers (17)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    An overview is given of Horizon, a shared-memory multiple-instruction-stream-multiple-data-stream computer architecture currently under study. Its performance target is a sustained rate of 100 GFLOPS (billions of floating-point operators per second), using a few hundred identical scalar processors. The Horizon architecture is described and its performance is estimated. The processor instruction se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The fast Fourier transform and sparse matrix computations: a study of two applications on the Horizon supercomputer

    Publication Year: 1988, Page(s):55 - 58
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    As part of the Horizon project, a set of application programs is being written and their performance is being evaluated. Two of these applications, the fast Fourier transform and sparse matrix computations, are described. For both problems, efficient implementations are developed that take advantage of Horizon's unique features, including fined-grained synchronization, multiple instruction streams... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal scheduling policies for mixed scalar-vector multiprocessor supercomputers

    Publication Year: 1988, Page(s):258 - 264
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    A queuing network model is developed for multiprocessing supercomputer systems implemented on two heterogeneous processors, a scaler unit and a vector unit, which work concurrently on a single process. The model is analyzed theoretically for a representative case of model job mixes. It is found that the utilization of one of the two central service stations in the model can only be maximized at th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling issues for supercomputers

    Publication Year: 1988, Page(s):164 - 173
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Two issues for supercomputer compilers are considered. Exact and inexact tests for computing data dependences and focus on the linearization scheme are first discussed. A program transformation call loop spreading is then presented that can be used to execute in parallel adjacent loops with interloop dependences View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Linda for supercomputing on a local area network

    Publication Year: 1988, Page(s):192 - 199
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    A distributed parallel processing system based on the Linda programming constructs has been implemented on a local area network. The system allows a single application program to utilize many machines on the network simultaneously. Several applications have been implemented on the network at Sandia National Laboratories and have achieved performances considerably faster than that of a Cray-1S. Sev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transformational approach to the derivation of hardware algorithms from recurrence equations

    Publication Year: 1988, Page(s):433 - 440
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    An approach to the derivation of hardware algorithms from recurrence equations is proposed that is based on program transformation. A representation for hardware algorithms, called relational representation, is introduced, in which one relational program corresponding to a given recurrence equation (namely a specification) is transformed to another relational program corresponding to a hardware al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The birth of the second generation: the Hitachi S-820/80

    Publication Year: 1988, Page(s):296 - 303
    Cited by:  Papers (3)  |  Patents (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    The authors present a performance evaluation and comparison of the Hitachi S-820/80 supercomputer on a set of standard Fortran benchmark codes that range from simple kernels to fluid dynamics applications. They find that the S-820 is a great deal faster in vector mode than any other supercomputer they have measured, with almost twice the performance on highly vectorized codes than the fastest mach... View full abstract»

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