Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Complete distributed garbage collection: an experience with Rotor

Complete distributed garbage collection: an experience with Rotor

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Software — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

IEE
Published

Support for distributed co-operative work implies object sharing. The memory management of these distributed (and possibly persistent) objects is a very difficult task. When done manually, it leads to memory leaks (useless objects that were not deleted) and dangling references (references to objects erroneously deleted), causing applications to fail. These errors have a strong negative impact on a programmer's productivity and program robustness. The authors address this problem by developing a complete distributed garbage collection algorithm. This solution is based on: (i) a reference-listing algorithm; and (ii) a centralised algorithm that complements the previous one by detecting distributed cycles of garbage. The detection and reclamation of distributed garbage cycles does not need any kind of global synchronisation. To achieve this goal they introduce the notion of a GC-consistent cut for distributed systems. They have implemented their algorithms in Rotor. Such an extension of the Rotor capabilities (which already includes a local garbage collector and use of leases for distributed garbage collection) is very important for supporting co-operative work among different users. The performance results obtained are very encouraging.

Inspec keywords: storage management; persistent objects; software performance evaluation; object-oriented programming; distributed programming; groupware

Other keywords: GC-consistent cut; object sharing; distributed co-operative work; dangling references; leases; centralised algorithm; Rotor; memory leaks; persistent objects; memory management; distributed garbage cycles; reference-listing algorithm; performance results; complete distributed garbage collection

Subjects: Parallel programming; Groupware; Object-oriented programming; File organisation

References

    1. 1)
      • Shapiro, M., Dickman, P., Plainfossé, D.: `Robust, dist. references and acyclic garbage collection', Proc. Symp. on Principles of Distributed Computing, Aug. 1992, Vancouver, Canada, p. 135–146.
    2. 2)
      • Skubiszewski, M., Valduriez, P.: `Concurrent garbage collection in O2', Proc. 23rd Int. Conf. on Very Large Databases (VLDB), 25–29 August 1997, Athens, p. 356–365.
    3. 3)
      • Louboutin, S.R.Y., Cahill, V.: `Comprehensive distributed garbage collection by tracking causal dependencies of relevant mutator events', Proc. Int. Conf. on Distributed Computing Systems (ICDCS), 1997, Baltimore, MA, p. 516–525.
    4. 4)
      • Shapiro, M., Plainfossé, D., and Gruber, O.: ‘A garbage detection protocol for a realistic distributed object-support system’. Tech. rep., INRIA, Nov. 1990, INRIA 1320.
    5. 5)
      • Fessant, F.L.: `Detecting distributed cycles of garbage in large-scale systems', Proc. 20th Symp. on Principles of Distributed Computing (PODC), 26–29 August 2001, Newort, RI, p. 200–209.
    6. 6)
      • Liskov, B., Ladin, R.: `Highly-available distributed services and fault-tolerant distributed garbage collection', Proc. 5th Symp. on Principles of Distributed Computing, Aug. 1986, Vancouver, Canada, p. 29–39.
    7. 7)
      • J. Hughes . A distributed garbage collection algorithm. Lect. Notes Comput. Sci. , 256 - 272
    8. 8)
      • S.E. Abdullahi , G.A. Ringwood . Garbage collecting the internet: a survey of distributed garbage collection. ACM Comput. Surv. (CSUR) , 3 , 330 - 373
    9. 9)
    10. 10)
      • M. Shapiro , F.L. Fessant , P. Ferreira . Recent advances in distributed garbage collection. Lect. Notes Comput. Sci.
    11. 11)
      • Richer, N., Shapiro, M.: `The memory behavior of the WWW, or the WWW considered as a persistent store', Proc. 9th Int. Workshop on Persistent Object Systems (POS), Lillehammer, Norway, 6–8 September, 2000, p. 161–176.
    12. 12)
      • M. Fisher , N. Lynch , M. Patterson . Impossibility of distributed consensus with one faulty process. J. ACM , 274 - 382
    13. 13)
      • Lang, B., Quenniac, C., Piquer, J.: `Garbage collecting the world', Conf. Record 19th Annual ACM Symposium on Principles of Programming Languages, Jan. 1992, Albuquerque, NM, p. 39–50.
    14. 14)
      • H. Rodrigues , R. Jones . Cyclic distributed garbage collection with group merger. Lect. Notes Comput. Sci. , 260 - 284
    15. 15)
      • D. Plainfossé , M. Shapiro . (1995) A survey of dist. garbage collection techniques, Proc. Int. Workshop on Memory Management.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-sen_20030993
Loading

Related content

content/journals/10.1049/ip-sen_20030993
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address