Cited By
View all- Adler MHarvey NJain KKleinberg RLehman A(2006)On the capacity of information networksProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm10.5555/1109557.1109585(241-250)Online publication date: 22-Jan-2006
Compression using efficient multicasting
Authors: 
Micah Adler, Tom LeightonAuthors Info & Claims
Micah Adler, Tom LeightonAuthors Info & ClaimsPages 153 - 162
References
[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 A CM Syrup. 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 A CM 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 A CM 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.
[9]
F. Behrend. On sets of integers containing no three in arithmetic progression. Proc. Nat. Acad. Sci., 23:331-332, 1946.
[10]
E. BerIekamp. 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. yon Eicken. LogP: Towards a realistic model of parallel computation. Communications of the ACM, 39(11):78-85, November 1996.
[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 ~he BSP model. In Proceedings 8th A CM Symposium on Parallel Algorithms and Architectures, 1996.
[18]
M. Goodrich. Communication-efficient parallel sorting. In Proceedings of the 28th Annual A CM 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 2z 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 A CM Symposium of Theory of Computing, 1986.
[24]
Y. Mansour, N. Nisan, and U. Vishkin. Trade-offs between communication throughput and parallel time. In Proc. of the 26th Annual A CM 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.
Index Terms
- Compression using efficient multicasting
Recommendations
Lossless Compression Using Efficient Encoding of Bitmasks
ISVLSI '09: Proceedings of the 2009 IEEE Computer Society Annual Symposium on VLSILossless compression is widely used to improve both memory requirement and communication bandwidth in embedded systems. Dictionary based compression techniques are very popular because of their good compression efficiency and fast decompression ...
Efficient lookahead routing and header compression for multicasting in networks-on-chip
ANCS '10: Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications SystemsAs technology advanced, Chip Multi-processor (CMP) architectures have emerged as a viable solution for designing processors. Networks-on-Chip (NOCs) provide a scalable communication method for CMP architectures as the number of cores is increasing. ...
Very efficient variable-length codes for the lossless compression of VQ indices
In this paper, we propose a novel compression method that can efficiently compress a vector quantization (VQ) index table. Before compressing the VQ index table, the method sorts all of the codewords in the VQ codebook by principal component analysis (...
Comments
Information & Contributors
Information
Published In
Copyright © 2000 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 May 2000
Check for updates
Qualifiers
- Article
Conference
STOC00
Sponsor:
Acceptance Rates
STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 334Total Downloads
- Downloads (Last 12 months)29
- Downloads (Last 6 weeks)7
Reflects downloads up to 04 Oct 2024
Other Metrics
Citations
Cited By
View all- Adler MHarvey NJain KKleinberg RLehman A(2006)On the capacity of information networksProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm10.5555/1109557.1109585(241-250)Online publication date: 22-Jan-2006
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in