Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/571825.571844acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article

Exploiting precision vs. efficiency tradeoffs in symmetric replication environments

Published: 21 July 2002 Publication History

Abstract

No abstract available.

References

[1]
U. Çetintemel, P. J. Keleher, and M. J. Franklin. Support for Speculative Update Propagation and Mobility in Deno. In IEEE Intl. Conf. on Distributed Computing Systems (ICDCS), Phoenix, 2001.
[2]
H. Yu and A. Vahdat. Efficient Numerical Error Bounding for Replicated Network Services. In Proc. of the 26th VLDB Conf., Cairo, Egypt, 2000.

Cited By

View all
  • (2006)Online algorithms to minimize resource reallocations and network communicationProceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation10.1007/11830924_12(104-115)Online publication date: 28-Aug-2006

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '02: Proceedings of the twenty-first annual symposium on Principles of distributed computing
July 2002
307 pages
ISBN:1581134851
DOI:10.1145/571825
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: 21 July 2002

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

PODC02
Sponsor:
PODC02: Principles of Distributed Computing
July 21 - 24, 2002
California, Monterey

Acceptance Rates

PODC '02 Paper Acceptance Rate 43 of 149 submissions, 29%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2006)Online algorithms to minimize resource reallocations and network communicationProceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation10.1007/11830924_12(104-115)Online publication date: 28-Aug-2006

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media