Compression using efficient multicasting

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 153-162

  Adler, Micah ^a   Leighton, Tom ^b  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b AKAMAI TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INFORMATION; COMPRESSION TECHNIQUES; DISTRIBUTED COMPUTATIONS; LIMITED BANDWIDTH; MULTI PROCESSOR SYSTEMS; MULTICAST INFORMATION; RAMSEY THEORY; SHARED-MEMORY PARALLELS;

ALGORITHMS; BANDWIDTH COMPRESSION; COMPUTATION THEORY; FAST FOURIER TRANSFORMS; BANDWIDTH; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; MULTICASTING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER);

MULTICASTING; IMAGE COMPRESSION;

RAMSEY THEORY; SHARED MEMORY PARALLEL MODELS;

EID: 0033687764     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335324     Document Type: Conference Paper

References (29)

1. M. Adler. New coding techniques for improved bandwidth utilization. In Proc. 37th IEEE Syrup. on Foundations of Computer Science, pages 173-182, 1996.
2. M. Adler, J. Byers, and R. Karp. Parallel sorting with limited bandwidth. In Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 129-136, 1995.
3. M. Adler, P. Gibbons, Y. Matias, and V. Ramachandran. Modeling parallel bandwidth: Local vs. global restrictions. In Proceedings of 9th ACM Symposium on Parallel Algorithms and Architectures, 1997.
4. A. Agbaria, Y. Ben-Aher, and I. Newman. Communication-processor tradeoffs in limited resources pram. In Proc. 11th ACM Symp. on Parallel Algorithms and Architectures, 1999.
5. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, Massachusetts, 1974.
6. Y. Azar. Lower bounds for threshold and symmetric functions in parallel computation. SIAM J. of Computing, 21(2):329-338, 1992.
7. A. Bar-Noy, S. Guha, J. S. Naor, and B. Schieber. Multicasting in heterogeneous networks. In Proceedings of the 30th A CM Symposium on Theory of Computing, 1998.
8. P. Beame, F. Fich, and R. Sinha. Separating the power of CREW and EREW PRAMs with small communication width. Information and Computation, 138(1):89-99, October 1997. (Pubitemid 127451779)
9. F. Behrend. On sets of integers containing no three in arithmetic progression. Proc. Nat. Acad. Sci., 23:331-332, 1946.
10. E. Berlekamp. A construction for partitions avoiding long arithmetic progressions. Canad. Math. Bull., 11:409-414, 1968.
11. A. Chandra, M. Furst, and R. Lipton. Multi-party protocols. In STOC, 1983.
12. D. Culler, R. M. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. Communications of the ACM, 39(11):78-85, November 1996. (Pubitemid 126428083)
13. R. Dilworth. A decomposition theorem for partially ordered sets. Ann. Math., 51:161-165, 1950.
14. J. Dongarra Et Al. Document for a standard message-passing interface. In Message Passing Interface Forum, 1993.
15. F. Fich, M. Li, P. Ragde, and Y. Yesha. Lower bounds for parallel random access machines with read only memory. Information and Computation, 83(2):234-244, November 1989.
16. F. Fich, P. Ragde, and A. Wigderson. Relations between concurrent-write models of parallel computation. SIAM J. Comp., 17(3):606-627, June 1988.
17. A. Gerbessiotis and C. Siniolakis. Deterministic sorting and randomized median finding on the BSP model. In Proceedings 8th ACM Symposium on Parallel Algorithms and Architectures, 1996.
18. M. Goodrich. Communication-efficient parallel sorting. In Proceedings of the 28 th Annual ACM Symposium on Theory of Computing, pages 247-256, 1996.
19. R. Graham and V. Rodl. Numbers in Ramsey theory. In Surveys in Combinatorics, (edited by C. Whitehead), LMS Lecture Note Series 123, pages 111-153. Cambridge University Press, 1987.
20. R. Graham and B. Rothschild. A short proof of van der Waerden's theorem on arithmetic progressions. Proc. Amer. Math. Soc., 42:356-386, 1974.
21. R. Graham, B. Rothschild, and J. Spencer. Ramsey Theory. John Wiley & Sons, 1990.
22. S. Johnsson, M. Jacquemin, and R. Krawitz. Communication efficient multi-processor FFT. Journal of Computational Physics, 102:381-397, 1992.
23. M. Li and Y. Yesha. Separation and lower bounds for ROM and non-deterministic models of parallel computation. In Proc. of 18th ACM Symposium of Theory of Computing, 1986.
24. th Annual ACM Symposium on Theory of Computing, pages 372-381, 1994.
25. K. Roth. On certain sets of integers. J. London Math. Soc., 28:104-109, 1953.
26. E. Szemerédi. On sets of integers containing no k elements in arithmetic progression. Acta Arith., 27:199-245, 1975.
27. L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.
28. B. van der Waerden. Beweis einer baudetschen vermutung. Nieuw Arch. Wisk., 15:212-216, 1927.
29. U. Vishkin and A. Wigderson. Trade-offs between depth and width in parallel computation. SIAM Journal of Computing, 14(2):303-314, 1985. (Pubitemid 15512163)