The ILLIAC IV Computer
From MaRDI portal
Cited in
(21)- Reconstructing sequential behavior from parallel behavior projections
- Methods and means of parallel processing of information
- Some primitives for the portable programming of array and vector processors
- A new approach to parallel computing
- Numerical calculation and computer design
- Multiplicative circulant networks. Topological properties and communication algorithms
- Permuting data with the Omega network
- Mixed fault diameter of Cartesian graph bundles
- Dynamic programming and parallel computers
- SOFTWARE TOOLS FOR MULTIPROCESSOR SIMULATION AND PROGRAMMING
- New fast parallel algorithm for the connected component problem and its VLSI implementation
- Adaptive quadrature algorithms for the ILLIAC IV
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
- AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗
- Dynamic computational geometry on meshes and hypercubes
- On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
- “Make no little plans”: Impactful research to solve the next generation of transportation problems
- Versatile topology for two-dimensional cellular automata
- The 2-rainbow domination number of Cartesian bundles over cycles
- A parallel search algorithm for directed acyclic graphs
- A scalable architecture for lattice-gas simulations
This page was built for publication: The ILLIAC IV Computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5553090)