General Purpose Parallel Architectures

[1]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[2]  Uzi Vishkin,et al.  A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer , 2011, Theor. Comput. Sci..

[3]  Eli Upfal,et al.  An O(log N) deterministic packet-routing scheme , 1992, JACM.

[4]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Christos Kaklamanis,et al.  Tight bounds for oblivious routing in the hypercube , 1990, SPAA '90.

[6]  C. Greg Plaxton,et al.  Deterministic sorting in nearly logarithmic time on the hypercube and related computers , 1990, STOC '90.

[7]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[8]  Guy E. Blelloch,et al.  Scans as Primitive Parallel Operations , 1989, ICPP.

[9]  Bruce M. Maggs,et al.  Expanders might be practical: fast algorithms for routing around faults on multibutterflies , 1989, 30th Annual Symposium on Foundations of Computer Science.

[10]  Alan Siegel,et al.  On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..

[12]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[13]  Fillia Makedon,et al.  A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues , 1989, SPAA.

[14]  L. Valiant.  Optimally universal parallel computers , 1988, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[15]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[16]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[17]  David Eppstein,et al.  Parallel Algorithmic Techniques for Combinatorial Computation , 1988, ICALP.

[18]  Ivan Hal Sudborough,et al.  Comparing Interconnection Networks , 1988, MFCS.

[19]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[20]  Abhiram G. Ranade,et al.  How to emulate shared memory (Preliminary Version) , 1987, FOCS.

[21]  Yukon Chang,et al.  Continuous routing and batch routing on the hypercube , 1986, PODC '86.

[22]  Eli Upfal,et al.  The Token Distribution Problem (Preliminary Version) , 1986, FOCS.

[23]  Kurt Mehlhorn,et al.  Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones , 1986, SIAM J. Comput..

[24]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[25]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

[26]  Charles L. Seitz,et al.  The cosmic cube , 1985, CACM.

[27]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[28]  Eli Upfal,et al.  A probabilistic relation between desirable and feasible, models of parallel computation , 1984, STOC '84.

[29]  Eli Upfal,et al.  How to share memory in a distributed system , 1984, JACM.

[30]  Nicholas Pippenger,et al.  Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.

[31]  Franco P. Preparata,et al.  VLSI Algorithms and Architectures , 1984, MFCS.

[32]  E. Upfal.  Efficient Schemes for Parallel Communication , 1984, JACM.

[33]  Sven Skyum,et al.  Families of Fixed Degree Graphs for Processor Interconnection , 1984, IEEE Transactions on Computers.

[34]  Leslie G. Valiant,et al.  Optimality of a Two-Phase Strategy for Routing in Interconnection Networks , 1983, IEEE Transactions on Computers.

[35]  Z. Galil,et al.  An Efficient General-Purpose Parallel Computer , 1983, JACM.

[36]  Georg Schnitger,et al.  Three applications of Kolmogorov-complexity , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[37]  Romas Aleliunas,et al.  Randomized parallel communication (Preliminary Version) , 1982, PODC '82.

[38]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[39]  Sartaj Sahni,et al.  Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.

[40]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[41]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[42]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[43]  M. Fischer,et al.  Parallel Prefix Computation , 1980, J. ACM.

[44]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[45]  H. J. Siegel.  Interconnection Networks for SIMD Machines , 1979, Computer.

[46]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[47]  H. T. Kung,et al.  Systolic Arrays for (VLSI). , 1978 .

[48]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[49]  Theodore R. Bashkow,et al.  A large scale, homogeneous, fully distributed parallel machine, I , 1977, ISCA '77.

[50]  Leslie G. Valiant,et al.  Graph-Theoretic Properties in computational Complexity , 1976, J. Comput. Syst. Sci..

[51]  Stephen A. Cook,et al.  Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[52]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[53]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[54]  Abhiram G. Ranade,et al.  Fluent parallel computation , 1989 .

[55]  Eli Upfal,et al.  A time-randomness tradeoff for oblivious routing , 1988, STOC '88.

[56]  Leslie G. Valiant,et al.  A logarithmic time sort for linear size networks , 1982, STOC.

[57]  Ronald I. Greenberg,et al.  Randomized Routing on Fat-Trees (Preliminary Version) , 1985, FOCS.

[58]  Frank Thomson Leighton,et al.  Parallel Computation Using Meshes of Trees , 1983, WG.

[59]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[60]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.