Universal schemes for parallel communication

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1981, Pages 263-277

  Valiant, L G ^a   Brebner, G J ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GENERAL PURPOSE COMPUTERS;

ARBITRARY PROBLEMS; COMBINATORIAL PROBLEM; INHERENT PARALLELISM; PARALLEL COMMUNICATION; PARALLEL COMPUTATION; PERMUTATION NETWORK; RANDOMIZED ROUTING; RUN-TIME EFFICIENCY;

PARALLEL PROCESSING SYSTEMS;

EID: 85025263656     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800076.802479     Document Type: Conference Paper

References (17)

1. D. Angluin and L. G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. of Comp. and Syst. Sci. (1979) 155-193.
2. K. Batcher. Sorting networks and their applications. AFIP5 Spring Joint Comp. Conf. 32 (1968) 307-314.
3. V. E. Benes. Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, New York (1965).
4. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. of Hath. Stat. 23 (1952) 493-507.
5. Z. Galil and W. J. Paul. A practical general purpose parallel computer, (this volume).
6. W. Hoeffding. On the distribution of the number of successes in independent trials. Ann. of Math. Stat. 27 (1956) 713-721.
7. G. Lev, N. Pippenger and L. G. Valiant. A fast parallel algorithm for routing in permutation networks. IEEE Trans. on Computers (1981).
8. D. Nassimi and S. Sahni Parallel algorithms to set-up the Benes permutation networks. Manuscript, University of Minnesota.
9. F. P. Preparata and J. Vuillemin. The cubeconnected cycles. IEEE Symp. on Foundations of Comp. Sci, 20 (1979) 140-147.
10. M. O. Rabin. Probabilistic algorithms. In "Algorithms and Complexity", J. F. Traub (ed.) Academic Press, New York, 1976.
11. J. T. Schwartz. Untracomputers. ACM TOPLAS (1980) 484-521.
12. H. J. Siegel. Interconnection networks for SIMD machines, Computer, June 1979, 57-65.
13. R. Solovay and V. Strassen. A fast Monte-Carlo test for primality. SIAM J. on Computing 6 (1977) 84-85.
14. H. Stone. Parallel processing with the perfect shuffle. IEEE Transactions on Computers, C-20:2, (1971) 153-161.
15. C. D. Thomson and H. T. Kung. Sorting on a meshconnected parallel computer. CACM 20:4 (1977) 263-271.
16. L. G. Valiant. A scheme for fast parallel communication. Report CSR-72-80, Computer Science Department, Edinburgh University, (1980).
17. L. G. Valiant. Experiments with a parallel communication scheme. In Proc. of 18th Allerton Conference on Communication Control and Computing, University of Illinois, Oct. 8-10, (1980).