article

Competitive algorithms for distributed data management

Authors:

Yair Bartal,

Amos Fiat,

Yuval RabaniAuthors Info & Claims

Journal of Computer and System Sciences, Volume 51, Issue 3

Pages 341 - 358

https://doi.org/10.1006/jcss.1995.1073

Published: 01 December 1995 Publication History

Abstract

No abstract available.

Cited By

View all

Matsubayashi A(2021)Non-Greedy Online Steiner Trees on Outerplanar GraphsAlgorithmica10.1007/s00453-020-00768-683:2(613-640)Online publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1007/s00453-020-00768-6
Li YIoannidis S(2020)Universally Stable Cache NetworksIEEE INFOCOM 2020 - IEEE Conference on Computer Communications10.1109/INFOCOM41043.2020.9155416(546-555)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1109/INFOCOM41043.2020.9155416
Matsubayashi A(2020)A Lower Bound for Page MigrationAlgorithmica10.1007/s00453-020-00696-582:9(2535-2563)Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1007/s00453-020-00696-5
Show More Cited By

Index Terms

Competitive algorithms for distributed data management

Recommendations

The distributed k-server problem-a competitive distributed translator for k-server algorithms
SFCS '92: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

The authors consider the k-server problem in a distributed setting. Given a network of n processors, and k identical mobile servers, requests for service appear at the processors and a server must reach the request point. Besides modeling problems in ...
Distributed Garbage Collection Algorithms for Timestamped Data

There is an important class of interactive multimedia applications that deals with stream data from distributed sources. Indexing the data temporally facilitates ordering individual streams as well as correlating items from different streams. The ...
Competitive algorithms for distributed data management (extended abstract)
STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing

We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal with the file allocation problem ([C], [DF], [ML]), where copies of a file may be stored in the local storage of some subset of processors, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Journal of Computer and System Sciences

Journal of Computer and System Sciences Volume 51, Issue 3

Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)

Dec. 1995

194 pages

ISSN:0022-0000

Editors:
E. K. Blum
Univ. of Southern California, Los Angeles
,
Wolfgang Maass
Graz, Austria

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 December 1995

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Matsubayashi A(2021)Non-Greedy Online Steiner Trees on Outerplanar GraphsAlgorithmica10.1007/s00453-020-00768-683:2(613-640)Online publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1007/s00453-020-00768-6
Li YIoannidis S(2020)Universally Stable Cache NetworksIEEE INFOCOM 2020 - IEEE Conference on Computer Communications10.1109/INFOCOM41043.2020.9155416(546-555)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1109/INFOCOM41043.2020.9155416
Matsubayashi A(2020)A Lower Bound for Page MigrationAlgorithmica10.1007/s00453-020-00696-582:9(2535-2563)Online publication date: 1-Sep-2020
https://dl.acm.org/doi/10.1007/s00453-020-00696-5
Bienkowski MByrka JMucha M(2019)Dynamic Beats FixedACM Transactions on Algorithms10.1145/334029615:4(1-21)Online publication date: 25-Jul-2019
https://dl.acm.org/doi/10.1145/3340296
Wang QWang HZheng B(2019)An efficient distributed storage strategy for blockchainProceedings of the ACM Turing Celebration Conference - China10.1145/3321408.3322840(1-5)Online publication date: 17-May-2019
https://dl.acm.org/doi/10.1145/3321408.3322840
Mahdian MMoharrer AIoannidis SYeh E(2019)Kelly Cache NetworksIEEE INFOCOM 2019 - IEEE Conference on Computer Communications10.1109/INFOCOM.2019.8737377(217-225)Online publication date: 29-Apr-2019
https://dl.acm.org/doi/10.1109/INFOCOM.2019.8737377
Ioannidis SYeh EYeh EIoannidis S(2018)Adaptive Caching Networks With Optimality GuaranteesIEEE/ACM Transactions on Networking10.1109/TNET.2018.279358126:2(737-750)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1109/TNET.2018.2793581
Ioannidis SYeh ESchmidt TSeedorf J(2017)Jointly optimal routing and caching for arbitrary network topologiesProceedings of the 4th ACM Conference on Information-Centric Networking10.1145/3125719.3125730(77-87)Online publication date: 26-Sep-2017
https://dl.acm.org/doi/10.1145/3125719.3125730
Ioannidis SYeh E(2016)Adaptive Caching Networks with Optimality GuaranteesACM SIGMETRICS Performance Evaluation Review10.1145/2964791.290146744:1(113-124)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/2964791.2901467
Ioannidis SYeh EAlouf SJean-Marie AHegde NProutière A(2016)Adaptive Caching Networks with Optimality GuaranteesProceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science10.1145/2896377.2901467(113-124)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/2896377.2901467
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

The distributed k-server problem-a competitive distributed translator for k-server algorithms

Distributed Garbage Collection Algorithms for Timestamped Data

Competitive algorithms for distributed data management (extended abstract)

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