Advertisement

Experience with the PerDiS Large-Scale Data-Sharing Middleware

  • Marc Shapiro
  • Paulo Ferreira
  • Nicolas Richer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2135)

Abstract

PerDiS is a distributed persistent middleware platform, intended to ease the distributed sharing of long-term data. Its users belong to geographically-distant and non-trusting entreprises. It targets CAD applications for the building industry: data sets are large and pointer-rich; simultaneous reads and updates are supported; there is no central database; migrating legacy applications is accessible to unskilled programmers. A number of real applications have been either ported or written specifically for PerDiS.

The following design decisions were essential to the scalability and to the useability of PerDiS. Isolation (transactions) decouples users from one another. The system design provides different granularities. The programming abstraction is a fine-grain, persistent, isolated shared memory, with objects, invocations and URLs. The system mechanisms are coarsegrained, loosely-coupled and optimistic. Fine-grain application entities are encapsulated into coarse-grain system entities, respectively clusters, domains, transactions, and projects.

Keywords

Shared Memory Garbage Collection Object Graph System Transaction Read Module 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Saleh E. Abdullahi and Graem A. Ringwood. Garbage collecting the Internet: a survey of distributed garbage collection. ACM Computing Surveys, 30(3):330–373, September 1998.Google Scholar
  2. 2.
    Virginie Amar. Intégration des standards STEP et CORBA pour le processus d’ingénierie dans l’entreprise virtuelle. PhD thesis, Université de Nice Sophia-Antipolis, September 1998.Google Scholar
  3. 3.
    M. P. Atkinson, P. J. Bailey, K. J. Chisholm, P. W. Cockshott, and R. Morrison. An approach to persistent programming. The Computer Journal, 26(4):360–365, 1983.zbMATHGoogle Scholar
  4. 4.
    D. I. Bevan. Distributed garbage collection using reference counting. In Parallel Arch. and Lang. Europe, pages 117–187, Eindhoven, The Netherlands, June 1987. Spring-Verlag Lecture Notes in Computer Science 259.Google Scholar
  5. 5.
    Xavier Blondel. Report on the scalability of garbage collection. Deliverable TC.1.3-B, PerDiS project, November 1999. http://www.perdis.esprit.ec.org/deliverables/docs/wpC/tc13b/.
  6. 6.
    Xavier Blondel. Gestion des méta-données de la mémoire dans un environnement réparti persistant transactionnel à grande echelle: l’exemple de PerDiS. PhD thesis, Conservatoire National des Arts et Métiers, To appear, September 2000.Google Scholar
  7. 7.
    George Coulouris, Jean Dollimore, and Marcus Roberts. Role and task-based access control in the PerDiS groupware platform. In W. on Role-Based Access Control, Washington DC (USA), October 1998. http://www.dcs.qmw.ac.uk/research/distrib/ perdis/papers/Coulouris-RBAC9/%8-final.ps.gz.
  8. 8.
    Digital Equipment Corporation, Hewlett-Packard Company, HyperDesk Corporation, NCR Coporation, Object Design, Inc., and SunSoft, Inc. The Common Object Request Broker: Architecture and specification. Technical Report 91-12-1, Object Management Group, Framingham MA (USA), December 1991.Google Scholar
  9. 9.
    Paulo Ferreira and Marc Shapiro. Modelling a distributed cached store for garbage collection. In 12th Euro. Conf. on Object-Oriented Prog. (ECOOP), Brussels (Belgium), July 1998. http://www-sor.inria.fr/publi/MDCSGC_ecoop98.html.
  10. 10.
    J. Eliot B. Moss. Working with persistent objects: To swizzle or not to swizzle. IEEE Transactions on Software Engineering, 18(8):657–673, August 1992.Google Scholar
  11. 11.
    Alexandru Salcianu. Extraction et utilisation des informations de type pour le support des objets répartis. Mémoire de dea, École Normale Supérieure de Lyon, July 1999. http://www-sor.inria.fr/publi/EUITSORdea-salcianu-1999-07.html.
  12. 12.
    F. Sandakly, O. Fambon, M. Roberts, X. Blondel, and N. Tô. Final report on assessment of the platform and proposed improvements. Deliverable TA.3-A, PerDiS project, March 2000. http://www.perdis.esprit.ec.org/deliverables/docs/wpA/ta3a/.
  13. 13.
    Fadi Sandakly, Marcus Roberts, and Thomas Lehmann. Report on experience programming over IPF. Deliverable TA.2.2-D, PerDiS Project, March 2000. http://www.perdis.esprit.ec.org/deliverables/docs/wpA/ta22d/.
  14. 14.
    Marc Shapiro, Fabrice Le Fessant, and Paulo Ferreira. Recent advances in distributed garbage collection. In S. Krakowiak and S. K. Shrivastava, editors, Recent Advances in Distributed Systems, volume 1752 of Lecture Notes in Computer Science, chapter 5, pages 104–126. Springer-Verlag, February 2000. http://www-sor.inria.fr/publi/RAIDGC_lncs1752.html.CrossRefGoogle Scholar
  15. 15.
    Marc Shapiro, Antony Rowstron, and Anne-Marie Kermarrec. Application-independent reconciliation for nomadic applications. In Proc. SIGOPS European Workshop: “Beyond the PC: New Challenges for the Operating System”, Kolding (Denmark), September 2000. ACM SIGOPS. http://www-sor.inria.fr/~shapiro/papers/ew2000-logmerge.html.
  16. 16.
    P. Watson and I. Watson. An efficient garbage collection scheme for parallel computer architectures. In PARLE’87—Parallel Architectures and Languages Europe, number 259 in Lecture Notes in Computer Science, Eindhoven (the Netherlands), June 1987. Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Marc Shapiro
    • 1
    • 2
  • Paulo Ferreira
    • 3
  • Nicolas Richer
    • 2
  1. 1.Microsoft Research LtdCambridgeU K
  2. 2.INRIA projet SOR, Domaine de VoluceauChesnay CedexFrance
  3. 3.INESCLisboa CedexPortugal

Personalised recommendations