The ILLIAC IV Computer
From MaRDI portal
Publication:5553090
DOI10.1109/TC.1968.229158zbMath0167.16403OpenAlexW2013259664WikidataQ56156756 ScholiaQ56156756MaRDI QIDQ5553090
David Kuck, Richard A. Stokes, D. L. Slotnick, Maso Kato, Richard M. Brown, George H. Barnes
Publication date: 1968
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1968.229158
Related Items (19)
AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗ ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ “Make no little plans”: Impactful research to solve the next generation of transportation problems ⋮ A scalable architecture for lattice-gas simulations ⋮ Methods and means of parallel processing of information ⋮ Some primitives for the portable programming of array and vector processors ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ On Jacobi and Jacobi-Like Algorithms for a Parallel Computer ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ Permuting data with the Omega network ⋮ Adaptive quadrature algorithms for the ILLIAC IV ⋮ A new approach to parallel computing ⋮ SOFTWARE TOOLS FOR MULTIPROCESSOR SIMULATION AND PROGRAMMING ⋮ New fast parallel algorithm for the connected component problem and its VLSI implementation ⋮ Numerical calculation and computer design ⋮ Dynamic programming and parallel computers ⋮ A parallel search algorithm for directed acyclic graphs ⋮ Reconstructing sequential behavior from parallel behavior projections
This page was built for publication: The ILLIAC IV Computer
