File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Trade-offs between communication and space

TitleTrade-offs between communication and space
Authors
Issue Date1992
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jcss
Citation
Journal Of Computer And System Sciences, 1992, v. 45 n. 3, p. 296-315 How to Cite?
AbstractThis paper initiates the study of communication complexity when the processors have limited work space. The following trade-offs between the number C of communications steps and space S are proved: 1. 1. For multiplying two n × n matrices in the arithmetic model with two-way communication, CS = Θ(n 3). 2. 2. For convolution of two degree n polynomials in the arithmetic model with two-way communication, CS = Θ(n 2). 3. 3. For multiplying an n × n matrix by an n-vector in the Boolean model with one-way communication, CS = Θ(n 2). In contrast, the discrete Fourier transform and sorting can be accomplished in O(n) communication steps and O(log n) space simultaneously, and the search problems of Karchmer and Wigderson associated with any language in NC k can be solved in O(log k n) communication steps and O(log k n) space simultaneously.
Persistent Identifierhttp://hdl.handle.net/10722/152236
ISSN
2015 Impact Factor: 1.583
2015 SCImago Journal Rankings: 1.334
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLam, Ten_US
dc.date.accessioned2012-06-26T06:36:40Z-
dc.date.available2012-06-26T06:36:40Z-
dc.date.issued1992en_US
dc.identifier.citationJournal Of Computer And System Sciences, 1992, v. 45 n. 3, p. 296-315en_US
dc.identifier.issn0022-0000en_US
dc.identifier.urihttp://hdl.handle.net/10722/152236-
dc.description.abstractThis paper initiates the study of communication complexity when the processors have limited work space. The following trade-offs between the number C of communications steps and space S are proved: 1. 1. For multiplying two n × n matrices in the arithmetic model with two-way communication, CS = Θ(n 3). 2. 2. For convolution of two degree n polynomials in the arithmetic model with two-way communication, CS = Θ(n 2). 3. 3. For multiplying an n × n matrix by an n-vector in the Boolean model with one-way communication, CS = Θ(n 2). In contrast, the discrete Fourier transform and sorting can be accomplished in O(n) communication steps and O(log n) space simultaneously, and the search problems of Karchmer and Wigderson associated with any language in NC k can be solved in O(log k n) communication steps and O(log k n) space simultaneously.en_US
dc.languageengen_US
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jcssen_US
dc.relation.ispartofJournal of Computer and System Sciencesen_US
dc.titleTrade-offs between communication and spaceen_US
dc.typeArticleen_US
dc.identifier.emailLam, T:twlam@cs.hku.hken_US
dc.identifier.authorityLam, T=rp00135en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/0022-0000(92)90028-Hen_US
dc.identifier.scopuseid_2-s2.0-0027066563en_US
dc.identifier.volume45en_US
dc.identifier.issue3en_US
dc.identifier.spage296en_US
dc.identifier.epage315en_US
dc.identifier.isiWOS:A1992KA73600002-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLam, T=7202523165en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats