article

A communication-time tradeoff

Authors:

Christos H. Papadimitriou,

Jeffrey D. UllmanAuthors Info & Claims

SIAM Journal on Computing, Volume 16, Issue 4

Pages 639 - 646

https://doi.org/10.1137/0216044

Published: 01 August 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Fitzi MKiayias APanagiotakos GRussell A(2022)Ofelimos: Combinatorial Optimization via Proof-of-Useful-WorkAdvances in Cryptology – CRYPTO 202210.1007/978-3-031-15979-4_12(339-369)Online publication date: 15-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-15979-4_12
Ballard GDemmel JGrigori LJacquelin MKnight NScheideler CFineman J(2018)A 3D Parallel Algorithm for QR DecompositionProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210415(55-65)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210415
Bilardi GScquizzato MSilvestri F(2018)A Lower Bound Technique for Communication in BSPACM Transactions on Parallel Computing10.1145/31817764:3(1-27)Online publication date: 20-Feb-2018
https://dl.acm.org/doi/10.1145/3181776
Show More Cited By

Index Terms

A communication-time tradeoff
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Parallel computing models

Recommendations

Rate-lifetime tradeoff for reliable communication in wireless sensor networks

The network lifetime and application performance are two fundamental, yet conflicting, design objectives in wireless sensor networks. There is an intrinsic tradeoff between network lifetime maximization and application performance maximization, the ...
Optimal tradeoff composite correlation filters
Bandit problems and the exploration/exploitation tradeoff

We explore the two-armed bandit with Gaussian payoffs as a theoretical model for optimization. The problem is formulated from a Bayesian perspective, and the optimal strategy for both one and two pulls is provided. We present regions of parameter space ...

Comments

Information & Contributors

Information

Published In

SIAM Journal on Computing Volume 16, Issue 4

Aug. 1987

180 pages

ISSN:0097-5397

Editor:
S. Rao Kosaraju

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 August 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fitzi MKiayias APanagiotakos GRussell A(2022)Ofelimos: Combinatorial Optimization via Proof-of-Useful-WorkAdvances in Cryptology – CRYPTO 202210.1007/978-3-031-15979-4_12(339-369)Online publication date: 15-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-15979-4_12
Ballard GDemmel JGrigori LJacquelin MKnight NScheideler CFineman J(2018)A 3D Parallel Algorithm for QR DecompositionProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210415(55-65)Online publication date: 11-Jul-2018
https://dl.acm.org/doi/10.1145/3210377.3210415
Bilardi GScquizzato MSilvestri F(2018)A Lower Bound Technique for Communication in BSPACM Transactions on Parallel Computing10.1145/31817764:3(1-27)Online publication date: 20-Feb-2018
https://dl.acm.org/doi/10.1145/3181776
Solomonik ECarson EKnight NDemmel J(2017)Trade-Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra ComputationsACM Transactions on Parallel Computing10.1145/28971883:1(1-47)Online publication date: 17-Jan-2017
https://dl.acm.org/doi/10.1145/2897188
Solomonik ECarson EKnight NDemmel JBlelloch GSanders P(2014)Tradeoffs between synchronization, communication, and computation in parallel linear algebra computationsProceedings of the 26th ACM symposium on Parallelism in algorithms and architectures10.1145/2612669.2612671(307-318)Online publication date: 23-Jun-2014
https://dl.acm.org/doi/10.1145/2612669.2612671
Bilardi GScquizzato MSilvestri F(2012)A lower bound technique for communication on BSP with application to the FFTProceedings of the 18th international conference on Parallel Processing10.1007/978-3-642-32820-6_67(676-687)Online publication date: 27-Aug-2012
https://dl.acm.org/doi/10.1007/978-3-642-32820-6_67
Kwok YAhmad I(1999)Static scheduling algorithms for allocating directed task graphs to multiprocessorsACM Computing Surveys10.1145/344588.34461831:4(406-471)Online publication date: 1-Dec-1999
https://dl.acm.org/doi/10.1145/344588.344618
Blelloch GGibbons PMatias Y(1999)Provably efficient scheduling for languages with fine-grained parallelismJournal of the ACM10.1145/301970.30197446:2(281-321)Online publication date: 1-Mar-1999
https://dl.acm.org/doi/10.1145/301970.301974
Hambrusch STu H(1997)Edge Weight Reduction Problems in Directed Acyclic GraphsJournal of Algorithms10.1006/jagm.1997.085624:1(66-93)Online publication date: 1-Jul-1997
https://dl.acm.org/doi/10.1006/jagm.1997.0856
Kalpakis KYesha Y(1996)Scheduling tree dags on parallel architecturesAlgorithmica10.1007/BF0196154515:4(373-396)Online publication date: 1-Apr-1996
https://dl.acm.org/doi/10.1007/BF01961545
Show More Cited By

View Options

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.

Abstract

Cited By

Index Terms

Recommendations

Rate-lifetime tradeoff for reliable communication in wireless sensor networks

Optimal tradeoff composite correlation filters

Bandit problems and the exploration/exploitation tradeoff

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations