. P. Abc-+-83-]-m, P. J. Atkinson, K. J. Bailey, P. W. Chisholm, R. Cockshott et al., An approach to persistent programming, The Computer Journal, vol.26, issue.4, pp.360-365, 1983.

[. Detlefs, A. Dosser, B. Zorn, C. , and C. Programs, /pub/cs/ techreports/zorn/CU-CS-665-93.ps Garbage collection and DSM consistency Larchant: Persistence by reachability in distributed shared memory through garbage collection, Proc. of the First Symposium on Operating Systems Design and Implementation (OSDI) Proc. 16th Int. Conf. on Dist. Comp. Syst. (ICDCS), pp.229-241, 1993.

P. Guedes, D. Hagimont, S. Krakowiak, . Perdis98, C. Qmw et al., INRIA RR 3525 The ObjectStore database system Buddy systems Extraction et utilisation des informations de type pour le support des objets répartis Fast Fits: New methods for dynamic storage allocation, PDIUPDS_rr3525.html. [Kno65] Kenneth C. Knowlton. A fast storage allocator . Communications of the ACM Proceedings of the Ninth Symposium on Operating Systems Principles, pp.98-1392623, 1965.

R. Paul, M. S. Wilson, and . Johnstone, The memory fragmentation problem: Solved?, Proc. Int. Symposium on Memory Management (ISMM'98), pp.26-36, 1998.

R. Paul, M. S. Wilson, M. Johnstone, D. Neely, and . Boles, Dynamic storage allocation: A survey and critical review/pub/garbage/allocscr.ps. [ZG92a] Benjamin Zorn and Dirk Grunwald. Empirical measurements of six allocation-intensive C programs techreports/zorn/CU-CS-604-92 Evaluating models of memory allocation, Proc. Int, 1992.