Article

Free access

Highly available distributed services and fault-tolerant distributed garbage collection

Authors:

Barbara Liskov,

Rivka LadinAuthors Info & Claims

PODC '86: Proceedings of the fifth annual ACM symposium on Principles of distributed computing

Pages 29 - 39

https://doi.org/10.1145/10590.10593

Published: 01 November 1986 Publication History

PDF eReader

References

[1]

Ali, K. A. M. Object Oriented Storage Management and Garbage Coflection in Distributed Processing Systems. PhD thesis, Royal Institute of Technology, Stockolm, December, 1984.

Google Scholar

[2]

Baker, H. G. List Processing in Real Time on a Serial Computer. CACM" 2(4):280-294, April, 1978,

Digital Library

Google Scholar

[3]

Bishop, P.B. Computer Systems with a Very Large Address Space and Garbage Collection. Technical Report MIT/LCS/TR.178, MIT Laboratory for Computer Science, May, 1977,

Google Scholar

[4]

Chandy, K. M., and Lamport, L. Distributed Snapshots: Determining Global States of distributed Systems. ACM Trans. on Computer Systems 3(1 ):63-75, February, 1985.

Digital Library

Google Scholar

[5]

Fischer, M. J., and Michael, A. Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network. In Proc. of the Symposium on Principles of Database Systems. ACM, March, 1982.

Digital Library

Google Scholar

[6]

Gifford, D.K. Weighted Voting for Replicated Data. In Proc. of the Seventh Symposium on Operating Systems Principles, pages 150-162. ACM, December, 1979,

Digital Library

Google Scholar

[7]

Birrell, A. D., et al. Grapevine: An Exercise in Distributed Computing. CACM 25(4):280-274, April, 1982.

Digital Library

Google Scholar

[8]

Hudak, P., Keller, R.M. Garbage Collection and Task Deletion in Distributed Applicative Processing Systems. In Proceeding of the ACM Symposium on Lisp and Functional languages, pages 168-178. August, 1982.

Digital Library

Google Scholar

[9]

Hughes, J. A Distributed Garbage Collection Algorithm. In Functional Languages and Computer Architectures Confrence at Nancy, France, pages 256-271. 1985.

Digital Library

Google Scholar

[10]

Lamport, L. Time, Clocks, and the Ordering of Events in a Distributed System. CACM 21(7):558-565, July, 1978.

Digital Library

Google Scholar

[11]

Lampson, B. W., and Sturgis, H: E. Crash Recovery in a Distributed Data Storage System. Technical Report, Xerox Research Center, 1979. Palo Alto, Ca.

Google Scholar

[12]

Liskov, B., and Weihl, W. Specifications of Distributed Programs. Journal of Distributed Computing, to appear.

Google Scholar

[13]

Lundelius, J. Synchronizing Clocks in a Distributed System. Technical Report MIT/LCS/TR 335, M.I,T, Laboratory for Computer Science, 1984. Cambridge, Ma.

Digital Library

Google Scholar

[14]

Marzullo, K. Loosely-Coupled Distributed Services: A distributed Time Service. PhD thesis, Stanford University, 1983,

Google Scholar

[15]

Nori, A. K. A Storage Reclamation Scheme for Applicative Multiprocessor Systems. Master's thesis, University of Utah, December, 1979.

Google Scholar

[16]

Liskov, B. Overview of the Argus Language and System, Programming Methodology Group Memo 40, M.I.T. Laboratory for Computer Science, Cambridge, Ma, 1984.

Google Scholar

[17]

Liskov, B., et al. Preliminary Argus Reference Manual. Programming Methodology Group Memo 39, M.I,T. Laboratory for Computer Science, Cambridge, Ma, October, 1983.

Digital Library

Google Scholar

[18]

Schlichting, R. D., and Schneider, F. B. Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems. ACM Trans. on Computing Systems 1(3), 1983.

Digital Library

Google Scholar

[19]

Skeen, D., and Wright, D. D. Increasing Availability in Partitioned Database Systems. Technical Report 83-581, Cornell University, Dept. of Computer Science, 1984.

Digital Library

Google Scholar

[20]

Walker, E.W. Orphan Detection in the Argus System. Technical Report MIT/LCS/TR 326, M.I.T. Laboratory for Computer Science, June, 1984. Cambridge, Ma.

Digital Library

Google Scholar

[21]

Weihl, W. Distributed Version Management for Read-only Actions. Programming Methodology Group Memo 47, M.I.T Laboratory for Computer Science, Cambridge, Ma, 1986. Submitted for publication.

Google Scholar

Cited By

View all

Zhou XGuan JXing LQian ZYin HStavrou ACremers CShi E(2022)Perils and Mitigation of Security Risks of Cooperation in Mobile-as-a-Gateway IoTProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security10.1145/3548606.3560590(3285-3299)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3548606.3560590
Del Monte BZeuch SRabl TMarkl VIves ZBonifati AEl Abbadi A(2022)Rethinking Stateful Stream Processing with RDMAProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517826(1078-1092)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517826
Kim BYoon Y(2021)Cloud Storage Service Architecture Providing the Eventually Consistent Totally Ordered Commit History of Distributed Key-Value Stores for Data Consistency VerificationElectronics10.3390/electronics1021270210:21(2702)Online publication date: 5-Nov-2021
https://doi.org/10.3390/electronics10212702
Show More Cited By

Index Terms

Recommendations

Age-based garbage collection

Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Age-based garbage collection
OOPSLA '99: Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Concurrent and Distributed Garbage Collection of Active Objects

This paper shows how to perform concurrent and distributed automatic garbage collection of objects possessing their own thread of control. The relevance of garbage collection and active objects to distributed applications is briefly discussed and the ...

Comments

Information & Contributors

Information

Published In

PODC '86: Proceedings of the fifth annual ACM symposium on Principles of distributed computing

November 1986

293 pages

ISBN:0897911989

DOI:10.1145/10590

Chairman:
Joseph Halpern

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

PODC86

Sponsor:

SIGOPS

PODC86: The Fifth Annual ACM Symposium on Principles of Distributed Computing

August 11 - 13, 1986

Alberta, Calgary, Canada

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

53
Total Citations
View Citations
824
Total Downloads

Downloads (Last 12 months)156
Downloads (Last 6 weeks)19

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhou XGuan JXing LQian ZYin HStavrou ACremers CShi E(2022)Perils and Mitigation of Security Risks of Cooperation in Mobile-as-a-Gateway IoTProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security10.1145/3548606.3560590(3285-3299)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3548606.3560590
Del Monte BZeuch SRabl TMarkl VIves ZBonifati AEl Abbadi A(2022)Rethinking Stateful Stream Processing with RDMAProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517826(1078-1092)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517826
Kim BYoon Y(2021)Cloud Storage Service Architecture Providing the Eventually Consistent Totally Ordered Commit History of Distributed Key-Value Stores for Data Consistency VerificationElectronics10.3390/electronics1021270210:21(2702)Online publication date: 5-Nov-2021
https://doi.org/10.3390/electronics10212702
Lee ELohstroh M(2021)Time for All Programs, Not Just Real-Time ProgramsLeveraging Applications of Formal Methods, Verification and Validation10.1007/978-3-030-89159-6_15(213-232)Online publication date: 12-Oct-2021
https://doi.org/10.1007/978-3-030-89159-6_15
(2019)ReferencesConcurrency10.1145/3335772.3335940(319-333)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3335772.3335940
Veiga LBruno RFerreira PLea RGopalakrishnan STilevich EMurphy ABlackstock M(2015)Asynchronous Complete Garbage Collection for Graph Data StoresProceedings of the 16th Annual Middleware Conference10.1145/2814576.2814813(112-124)Online publication date: 24-Nov-2015
https://dl.acm.org/doi/10.1145/2814576.2814813
Raynal MRaynal M(2013)Logical Time in Asynchronous Distributed SystemsDistributed Algorithms for Message-Passing Systems10.1007/978-3-642-38123-2_7(149-188)Online publication date: 2013
https://doi.org/10.1007/978-3-642-38123-2_7
Schneider FZhou L(2010)Implementing trustworthy services using replicated state machinesReplication10.5555/2172338.2172346(151-167)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/2172338.2172346
Schneider FZhou L(2005)Implementing Trustworthy Services Using Replicated State MachinesIEEE Security and Privacy10.1109/MSP.2005.1253:5(34-43)Online publication date: 1-Sep-2005
https://dl.acm.org/doi/10.1109/MSP.2005.125
Veiga LFerreira P(2005)Asynchronous Complete Distributed Garbage CollectionProceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 0110.1109/IPDPS.2005.113Online publication date: 4-Apr-2005
https://dl.acm.org/doi/10.1109/IPDPS.2005.113
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Age-based garbage collection

Age-based garbage collection

Concurrent and Distributed Garbage Collection of Active Objects

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Age-based garbage collection

Age-based garbage collection

Concurrent and Distributed Garbage Collection of Active Objects

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations