Micah Adler  Home/Search
Context Related
| toronto.edu/~micah/pubs/coding.ps umass.edu/~micah/pubs/coding.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: toronto.edu/~micah/pubs/pubs (more) Homepages: M.Adler |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we introduce a new coding technique for transmitting the XOR of carefully selected patterns of bits to be communicated which greatly reduces bandwidth requirements in some settings. This technique has broader applications. For example, we demonstrate that the coding technique has a surprising application to a simple I/O (Input / Output) complexity problem related to finding the transpose of a matrix. Our main results are developed in the PRAM(m) model, a limited bandwidth PRAM model ... (Update)
Context of citations to this paper: More
.... algorithms when, for example, bit operations are allowed on the characters, akin to the recent result on a type of matrix transposition [1]. The practical algorithms in Section 4 already exploit some of these techniques. Another natural question to ask is how to sort strings...
...time l b. The PRAM(m) model was introduced in [VW85] and has been studied subsequently in [LY86] FRW88] FLRY89] Aza92] MNV94] [Adl96] and [BFS97] The case where n AE p was first examined in [MNV94] where Mansour, Nisan and Vishkin prove a lower bound of Omega...
Cited by: More
On Showing Lower Bounds for External-Memory Computational.. - Arge, Miltersen (Correct)
Compression Using Efficient Multicasting - Adler, Leighton (2000) (Correct)
Communication-Processor Tradeoffs in Limited Resources PRAM - Agbaria, Ben-Asher, Newman (Correct)
Active bibliography (related documents): More All
1.7: Parallel Sorting With Limited Bandwidth - Adler, Byers, Karp (1995) (Correct)
0.7: Parallel Sorting with Limited Bandwidth - Adler, Byers, Karp (1999) (Correct)
0.1: Communication-Efficient Parallel Sorting - Goodrich (1996) (Correct)
Similar documents based on text: More All
0.2: An n! Lower Bound On Formula Size - Micah Adler Computer (Correct)
0.1: Protocols for Asymmetric Communication Channels - Adler, Maggs (1998) (Correct)
0.1: Tight Size Bounds for Packet Headers in Narrow Meshes - Adler, Fich, Goldberg.. (2000) (Correct)
Related documents from co-citation: More All
6: Trade-offs between communication throughput and parallel time - Mansour, Nisan et al. - 1994
6: A bridging model for parallel computation (context) - Valiant - 1990
5: Parallel sorting with limited bandwidth - Adler, Byers et al. - 1995
BibTeX entry: (Update)
M. Adler. New coding techniques for improved bandwidth utilization. In Proc. 37th IEEE Symp. on Foundations of Computer Science, pages 173--182, October 1996. http://citeseer.ist.psu.edu/adler98new.html More
@inproceedings{ adler96new,
author = "Micah Adler",
title = "New Coding Techniques for Improved Bandwidth Utilization",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "173-182",
year = "1996",
url = "citeseer.ist.psu.edu/adler98new.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan - 1995
735 A Bridging Model for Parallel Computation (context) - Valiant - 1990
531 LogP: Towards a Realistic Model of Parallel Computation - Culler, Karp et al. - 1993
268 Parallel Algorithms for Shared-Memory Machines (context) - Karp, Ramachandran - 1990
234 General Purpose Parallel Architectures (context) - Valiant - 1990
227 Parallel Merge Sort (context) - Cole - 1988
159 Tight Bounds on the Complexity of Parallel Sorting (context) - Leighton - 1985
113 Output Complexity of Sorting and Related Problems (context) - Aggarwal, Vitter - 1988
104 Algorithms for Parallel Memory I: Two-Level Memories - Vitter, Shriver - 1994
49 Probabilistic Parallel Algorithms For Sorting and Selection (context) - Reischuk - 1985
38 A Complexity Theory for VLSI (context) - Thompson - 1980
35 Permuting Information in Idealized Two-Level Storage (context) - Floyd - 1972
29 A Time-Space Tradeoff for Sorting on a General Sequential Mo.. (context) - Borodin, Cook - 1982
25 Efficient Out-Of-Core Algorithms for Linear Relaxation Using.. - Leiserson, Rao et al. - 1993
23 Trade-offs Between Communication Throughput and Parallel Tim.. - Mansour, Nisan et al. - 1994
18 Trade-Offs between Depth and Width in Parallel Computation (context) - Vishkin, Wigderson - 1985
14 Cubesort: A Parallel Algorithm for Sorting N Data Items with.. (context) - Cypher, Sanz - 1992
4 Theoretical Computer Science 71: pp (context) - Aggarwal, Chandra et al. - 1990
4 Combinatorica 3: pp (context) - Ajtai, Koml'os et al. - 1983
2 on Parallel Algorithms and Architectures: pp (context) - Adler, Byers et al. - 1995
2 Communication-Efficient Parallel Sorting Proceedings of the .. (context) - Goodrich - 1996
1 SIAM Journal of Computing: 14: pp (context) - Snir, Searching - 1985
1 ithms Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (context) - Chiang, Goodrich et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.toronto.edu/~micah/pubs/pubs.html): More
Scheduling Time-Constrained Communication in Linear.. - Adler, Rosenberg.. (1998) (Correct)
Efficient Communication Strategies for Ad-Hoc Wireless Networks - Adler, Scheideler (1998) (Correct)
Parallel Sorting With Limited Bandwidth - Adler, Byers, Karp (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC