The Memory Behavior of the WWW, or The WWW Considered as a Persistent Store

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


This paper presents the performance evaluation of five memory allocation strategies for the PerDiS Persistent Distributed Object store in the context of allocating two different web sites in the store. The evaluation was conducted using (i) a web gathering tool, to log the web objects graph, and (ii) a PerDiS memory simulator that implements the different allocation strategies. Our results show that for all the strategies and parameters we have evaluated, reference and cycle locality are quiet poor. The best policy seems to be first sequential fits. Results are linear with the size of the garbage collection Unit (a bunch). There is no clear optimum, but 64K to 128K appear to be good choices.


Allocation Strategy Garbage Collection Memory Allocation Memory Behavior Garbage Collector 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ABC+83]_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
  2. [BDS91]
    Hans-J. Boehm, Alan J. Demers, and Scott Shenker. Mostly parallel garbage collection. In Proc. of the SIGPLAN’91 Conf. on Programming Language Design and Implementation, pages 157–164, Toronto (Canada), June 1991. ACM.Google Scholar
  3. [BFS98]
    Xavier Blondel, Paulo Ferreira, and Marc Shapiro. Implementing garbage collection in the perdis system. In Proceedings of the Eighth International Workshop on Persistent Object Systems, August 1998.
  4. [DDZ93]
    David Detlefs, Al Dosser, and Benjamin Zorn. Memory allocation costs in large C and C++ programs. Technical Report CU-CS-665-93, Dept. of Comp. Sc., Colorado University, Boulder, Colorado (USA), August 1993. Z.Google Scholar
  5. [FS94]
    Paulo Ferreira and Marc Shapiro. Garbage collection and DSM consistency. In Proc. of the First Symposium on Operating Systems Design and Implementation (OSDI), pages 229–241, Monterey CA (USA), November 1994. ACM.
  6. [FS96]
    Paulo Ferreira and Marc Shapiro. Larchant: Persistence by reachability in distributed shared memory through garbage collection. In Proc. 16th Int. Conf. on Dist. Comp. Syst. (ICDCS), Hong Kong, May 1996.
  7. [FSB+98]_Paulo Ferreira, Marc Shapiro, Xavier Blondel, Olivier Fambon, Joâo Garcia, Sytse Kloosterman, Nicolas Richer, Marcus Roberts, Fadi Sandakly, George Coulouris, Jean Dollimore, Paulo Guedes, Daniel Hagimont, and Sacha Krakowiak. PerDiS: design, implementation, and use of a PERsistent DIstributed Store. Technical Report QMW TR 752, CSTB ILC/98-1392, INRIA RR 3525, INESC RT/5/98, QMW, CSTB, INRIA and INESC, October 1998.
  8. [Kno65]
    Kenneth C. Knowlton. A fast storage allocator. Communications of the ACM, 8(10):623–625, October 1965.Google Scholar
  9. [LLOW91]
    Charles Lamb, Gordon Landis, Jack Orenstein, and Dan Weinreb. The ObjectStore database system. Communications of the ACM, 34(10):50–63, October 1991.Google Scholar
  10. [PN77]
    J. L. Peterson and T. A. Norman. Buddy systems. Communications of the ACM, 20(6):421–431, June 1977.Google Scholar
  11. [Sal99]
    Alexandru Salcianu. Extraction et utilisation des informations de type pour le support des objets répartis. Mémoire de dea, DEA d’Informatique de Lyon, INRIA, Rocquencourt (France), July 1999. http://www-sor. Scholar
  12. [Ste83]
    C. J. Stephenson. Fast Fits: New methods for dynamic storage allocation. In Proceedings of the Ninth Symposium on Operating Systems Principles, pages 30–32, Bretton Woods, New Hampshire, October 1983.Google Scholar
  13. [WJ98]
    Paul R. Wilson and Mark S. Johnstone. The memory fragmentation problem: Solved? In Proc. Int. Symposium on Memory Management (ISMM’98), pages 26–36, Vancouver, Canada, October 1998.
  14. [WJNB95]
    Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles. Dynamic storage allocation: A survey and critical review. In Proc. Int. Workshop on Memory Management, Kinross Scotland (UK), September 1995. Scholar
  15. [ZG92a]
    Benjamin Zorn and Dirk Grunwald. Empirical measurements of six allocation-intensive C programs. Technical Report CU-CS-604-92, Dept. of Comp. Sc., Colorado University, Boulder, Colorado (USA), July 1992. Scholar
  16. [ZG92b]
    Benjamin Zorn and Dirk Grunwald. Evaluating models of memory allocation. Technical Report CU-CS-603-92, Dept. of Comp. Sc., Colorado University, Boulder, Colorado (USA), July 1992. ftp://ftp.cs. colorado. edu/pub/cs/techreports/zorn/ Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Nicolas Richer
    • 1
  • Marc Shapiro
    • 1
  1. 1.INRIA - SOR groupLe Chesnay CedexFrance

Personalised recommendations