No abstract available.
What have we learnt from using real parallel machines to solve real problems?
We briefly review some key scientific and parallel processing issues in a selection of some 84 existing applications of parallel machines. We include the MIMD hypercube transputer array, BBN Butterfly, and the SIMD ICL DAP, Goodyear MPP and Connection ...
Hypercube data analysis in astronomy: optical interferometry and millisecond pulsar searches
Astronomical data sets are beginning to live up to their name, in both their sizes and the complexity of the analysis required. Here we discuss two astronomical data analysis problems which we have begun to implement on a hypercube concurrent processor ...
Statistical gravitational lensing on the Mark III hypercube
We describe a parallel algorithm for the nonlinear optics problem of gravitational lensing. The method is a “ray-tracing” method which studies the statistical properties of the image population associated with a gravitational lens. A parallel computer ...
An O(NlogN) hypercube N-body integrator
The gravitational N-body algorithm of Barnes and Hut [1] has been successfully implemented on a hypercube concurrent processor. The novel approach of their sequential algorithm has demonstrated itself to be well suited to hypercube architectures. The ...
Piriform (Olfactory) cortex model on the hypercube
We present a concurrent hypercube implementation of a neurophysiological model for the piriform (olfactory) cortex.
The project was undertaken as the first step towards constructing a general neural network simulator on the hypercube, suitable both for ...
Collective steropsis on the hypercube
A cooperative algorithm for extracting disparity information from stereo image pairs has been implemented on the NCUBE hypercube computer.
Software is written in C-langauge, using communication routines of the “Crystalline Operating System” CrOSIII ...
Parallel vision techniques on the hypercube computer
Parallel algorithms for programming low-level vision mechanisms on the JPL-Caltech hypercube are reported. These concern principally edge and region finding. 256x256 8bit images were used.
We discuss the problem of programming a hypercube computer, and ...
Pattern recognition by neural network model on hypercubes
The objective of this work is to study the performance characteristics of the back-propagation model for pattern recognition. Specifically, the test case of recognition of Chinese characters is studied on an ELXSI-6400 and MARK III hypercube. ...
A concurrent on-board vision system for a mobile robot
Robot vision algorithms have been implemented on an 8-node NCUBE-AT hypercube system onboard a mobile robot (HERMIES) developed at Oak Ridge National Laboratory. Images are digitized using a framegrabber mounted in a VME rack. Image processing and ...
Region growing on a hypercube multiprocessor
The region growing paradigm for image segmentation groups neighboring pixels into regions depending upon a predetermined homogeneity criteria. A parallel method for region growing on an MIMD multiprocessor system is presented. Since the region growing ...
Polymer simulation on the hypercube
The Monte Carlo simulation of a model polymer is implemented on the Mark III Hypercube computer under the CROS operating system. The polymer model and the simulation method are discussed. The key features of the implementation are given. The results ...
Chemical reaction dynamics: integration of coupled sets of ordinary differential equations on the Caltech hypercube
Use of the Caltech/JPL hypercube multicomputer to solve problems in chemical dynamics is the subject of this paper. The specific application is quantum mechanical atom diatomic molecule reactive scattering. One methodology for solving this dynamics ...
Waveform relaxation for concurrent dynamic simulation of distillation columns
The need for cost-effective, high-speed computing is essential in many aspects of chemical engineering practice, notably for the simulation of large-scale dynamic systems. The arrival of powerful, highly concurrent message-passing multicomputers ...
Implementing the beam and warming method on the hypercube
Numerical simulation of a wide range of physical phenomena typically involves enormous amounts of computation and, for scores of practical problems, these simulations cannot be carried out even on today's fastest supercomputers. The economic and ...
Finite difference time domain solution of electromagnetic scattering on the hypercube
Electromagnetic fields interacting with a dielectric or conducting structure produce scattered electromagnetic fields. To model the fields produced by complicated, volumetric structures, the finite difference time domain (FDTD) method employs an ...
A universal concurrent algorithm for plasma particle-in-cell simulation codes
We have developed a new algorithm for implementation of plasma particle-in-cell (PIC) simulation codes on concurrent processors. This algorithm, termed the universal concurrent PIC algorithm (UC-PIC), has been utilized in a one-dimensional electrostatic ...
Logic fault simulation on a vector hypercube multiprocessor
Fault simulation is the process of simulating the response of a logic circuit to input patterns in the presence of all possible single faults and is an essential part of test generation for VLSI circuits. Parallelization of the deductive and parallel ...
The Flux-corrected transport algorithm on the NCUBE hypercube
This work describes the implementation of a finite-difference algorithm, incorporating the flux-corrected transport technique, on the NCUBE hypercube. The algorithm is used to study two-dimensional, convectively-dominated fluid flows, and as a sample ...
Solution of the 3-D Euler equations for the flow about a fighter aircraft configuration using a hypercube parallel processor
The Computational Fluid Dynamics (CFD) code FL057, which solves the 3-D Euler Equations using an explicit, finite volume, Runge-Kutta algorithm, was implemented on an Intel IPSC-MX parallel processor. Spatial decomposition was effected on the solution ...
An interactive system for seismic velocity analysis
Seismic data processing is a time-consuming operation. Two main reasons for this are the large amounts of data, which have to be put in and taken out of the computer regularly, and the need for intervention by an expert at many intermediate stages. A ...
Hypercube performance for 2-D seismic finite-difference modeling
Wave-equation seismic modeling in two space dimensions is computationally intensive, often requiring hours of supercomputer CPU time to run typical geological models with 500 × 500 grids and 100 sources. This paper analyzes the performance of ACOUS2D, ...
Acoustic wavefield propagation using paraxial extrapolators
Modeling by paraxial extrapolators is applicable to wave propagation problems in which most of the energy is traveling within a restricted angular cone about a principle axis of the problem. Frequency domain finite-difference solutions are readily ...
Seismic migration algorithms on parallel computers
Seismic signal processing is computationally intensive and sequential algorithms in use do not exploit the concurrency inherent in data migration techniques. In this paper we study seismic migration algorithms with a view to present a general framework ...
Evaluation of a vector hypercube for seismic modelling
Seismic modelling to produce realistic seismic traces is a computationally intensive problem. A 2D synthetic wave propagation code using explicit finite differences with absorbing boundary conditions has been implemented on an Intel Hypercube with 32 ...
A hypercube Ray-tracer
We describe a hypercube ray-tracing program for rendering computer graphics. For small models, which fit in the memory of a single processor, the ray-tracer uses a scattered decomposition of pixels to balance the load, and achieves a very high ...
Implementation of Ray tracing on the hypercube
This preliminary report presents one implementation of a ray tracing system. The ray tracing system was divided and distributed onto the hypercube based on the data to be processed. The implementation which includes a dynamic load balancing scheme will ...
Dynamic computational geometry on parallel computers
This paper surveys our parallel algorithms for determining geometric properties of systems of moving objects. The properties investigated include nearest (farthest) neighbor, closest (farthest) pair, collision, convex hull, diameter, and containment. ...
Computational geometry on hypercube computers
This paper gives hypercube algorithms for some simple problems involving geometric properties of sets of points. The properties considered emphasize aspects of convexity and domination. Efficient algorithms are given for both fine-grain and medium-grain ...
Implementation and performance analysis of parallel assignment algorithms on a hypercube computer
The process of effectively coordinating and controlling resources during a military engagement is known as battle management/command, control, and communications (BM/C3). One key task of BM/C3 is allocating weapons to destroy targets. The focus of this ...
Cited By
- Eastwood M and Jayne C (2018). Evaluation of hyperbox neural network learning for classification, Neurocomputing, 133, (249-257), Online publication date: 1-Jun-2014.
- Schliephake M and Laure E Towards Improving the Communication Performance of CRESTA's Co-Design Application NEK5000 Proceedings of the 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, (669-674)
-
Zuckerman S, Pérache M and Jalby W (2008). Fine Tuning Matrix Multiplications on Multicore High Performance Computing - HiPC 2008, 10.1007/978-3-540-89894-8_7, (30-41),
- Ou C and Ranka S (1997). Parallel Incremental Graph Partitioning, IEEE Transactions on Parallel and Distributed Systems, 8:8, (884-896), Online publication date: 1-Aug-1997.
-
(1994). Bibliography Parallel Computing Works!, 10.1016/B978-0-08-051351-5.50027-0, (877-970),
-
D'apuzzo M and De Rosa M (1994). A parallel block row-action method for solving large sparse linear systems on distributed memory multiprocessors, Concurrency: Practice and Experience, 10.1002/cpe.4330060105, 6:1, (69-84), Online publication date: 1-Feb-1994.
- Nicol D (2019). Rectilinear Partitioning of Irregular Data Parallel Computations, Journal of Parallel and Distributed Computing, 23:2, (119-134), Online publication date: 1-Nov-1994.
- Ponnusamy R, Mansour N, Choudhary A and Fox G (2018). Graph contraction for mapping data on parallel computers, Scientific Programming, 3:1, (73-82), Online publication date: 1-May-1994.
-
Furmanski W, Faigle C, Haupt T, Niemiec J, Podgorny M and Simoni D (2006). MOVIE model for open‐systems‐based high‐performance distributed computing, Concurrency: Practice and Experience, 10.1002/cpe.4330050406, 5:4, (287-308), Online publication date: 1-Jun-1993.
-
Faigle C, Furmanski W, Haupt T, Niemiec J, Podgorny M and Simoni D MOVIE model for open systems based high performance distributed computing First International Symposium on High-Performance Distributed Computing. (HPDC-1), 10.1109/HPDC.1992.246488, 0-8186-2970-3, (37-56)
-
Peercy M and Banerjee P Design and analysis of software reconfiguration strategies for hypercube multicomputers under multiple faults [1992] Digest of Papers. FTCS-22: The Twenty-Second International Symposium on Fault-Tolerant Computing, 10.1109/FTCS.1992.243590, 0-8186-2875-8, (448-455)
-
Ahmed I, Ghafoor A and Fox G Allocation of computations with dynamic structures on hypercube based distributed systems First International Symposium on High-Performance Distributed Computing. (HPDC-1), 10.1109/HPDC.1992.246470, 0-8186-2970-3, (228-237)
-
Das R, Ponnusamy R, Saltz J and Mavriplis D (1992). Distributed Memory Compiler Methods for Irregular Problems – Data Copy Reuse and Runtime Partitioning1 1This work is supported by NASA contract NAS1-18605 while the authors were in residence at ICASE, NASA Langley Research Center. In addition, support for author Saltz was provided by NSF from NSF grant ASC-8819374. The authors assume all responsibility for the contents of the paper. Languages, Compilers and Run-Time Environments for Distributed Memory Machines, 10.1016/B978-0-444-88712-2.50014-7, (185-219),
- Di Serafino D, Murli A and Perla F (2018). A fast Poisson solver for distributed memory multiprocessors, Concurrency: Practice and Experience, 4:7, (499-508), Online publication date: 1-Oct-1992.
-
Shadid J and Tuminaro R (1992). Sparse iterative algorithm software for large-scale MIMD machines: An initial discussion and implementation, Concurrency: Practice and Experience, 10.1002/cpe.4330040605, 4:6, (481-497), Online publication date: 1-Sep-1992.
-
GARDINER J and LAUB A (1991). Parallel algorithms for algebraic Riccati equations, International Journal of Control, 10.1080/00207179108934214, 54:6, (1317-1333), Online publication date: 1-Dec-1991.
-
Fox G (2006). Physical computation, Concurrency: Practice and Experience, 10.1002/cpe.4330030609, 3:6, (627-653), Online publication date: 1-Dec-1991.
-
Fox G (2006). Achievements and prospects for parallel computing, Concurrency: Practice and Experience, 10.1002/cpe.4330030615, 3:6, (725-739), Online publication date: 1-Dec-1991.
-
Banerjee P Strategies for reconfiguring hypercubes under faults [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium, 10.1109/FTCS.1990.89368, 0-8186-2051-X, (210-217)
-
Fox G, Funnanski W, Ho A, Koller J, Simic P and Wong I Neural Networks and Dynamic Complex Systems [1989] Record of The 22nd Annual Simulation Symposium, 10.1109/SIMSYM.1989.748307, 0-8186-1946-5, (129-143)
- Gustafson J, Benner R, Sears M and Sullivan T A radar simulation program for a 1024-processor hypercube Proceedings of the 1989 ACM/IEEE conference on Supercomputing, (96-105)
-
Fox G (2006). Parallel computing comes of age: Supercomputer level parallel computations at Caltech, Concurrency: Practice and Experience, 10.1002/cpe.4330010107, 1:1, (63-103), Online publication date: 1-Sep-1989.
-
Fox G Issues in software development for concurrent computers Proceedings COMPSAC 88: The Twelfth Annual International Computer Software & Applications Conference, 10.1109/CMPSAC.1988.17190, 0-8186-0873-0, (302-305)
-
Fox G (1988). Theory and Practice of Concurrent Systems Fifth Generation Computer Systems 1988, 10.1007/978-1-4471-3156-4_15, (157-160),
Index Terms
- Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2