Giuseppe Attardi, Tito Flagella, and Pietro Iglio. Performance-Tuning in a Customizable Collector. In International Workshop on Memory Management (IWMM'95), volume 986 of Lecture Notes in Computer Sciences, pages 179198, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....address the specic memory requirements of their application. However, the garbage collection community has been working on the customization of the GC to each application for a long time, thus addressing the concerns of proponents of manual memory management. Many of these customized collectors [Bar90, Ede92, BS93, AFI95] still require some kind of intervention from the developer. In this paper, we present our experience with the implementation of a completely automatic system in which compiler support allows the generation of a customized GC without requiring any additional work from the application developer. ....

....no knowledge of register or stack area layouts, but it does assume that all pointers in heapallocated data can be found accurately thanks to the registration of all internal roots [Bar90] by the developer. Other experiments around garbage collector customization were carried out in [AF94] and [AFI95]. Their Customizable Memory Management (CMM) allows users to customize object management by specifying at each object allocation which policy to adopt for its storage, and by providing the optimal traversal routines for each type. The major interest of the latter kind of manual customization is ....

Giuseppe Attardi, Tito Flagella, and Pietro Iglio. Performance-Tuning in a Customizable Collector. In International Workshop on Memory Management (IWMM'95), volume 986 of Lecture Notes in Computer Sciences, pages 179198, 1995.

....Related Collectors There are two other mostly copying collectors that bear a strong resemblance to MCC. One, due to Bartlett, is used in a Scheme to C compiler and in its newest variant has migrated to C [7] The other is the Customizable Memory Manager (CMM) which is also a collector for C [3, 4]. Bartlett s algorithm does two traversals over the live graph. Conceptually, in the first pass the algorithm identifies all quasi pointers and all objects that cannot be moved. It promotes all pages containing such objects to to space by linking them into the to space list. In the second pass, ....

....Computes a Groebner basis. Table 1: Brief description of the benchmarks. were incorrectly made (because the object was referenced by a quasi pointer) during the second pass. CMM is a customizable collector that supports mostlycopying collector. BDW and CMM have been compared in the context of C [4]. Like Bartlett, CMM implements a two stage mostly copying algorithm. In the first stage all other heaps are examined for quasi pointers, or pointers into this heap. All pages containing objects referenced by quasi pointers are promoted into to space. The heap being collected does not contain any ....

G. Attardi, T. Flagella, and P. Iglio. Performance tuning in a customizable collector. In H. Baker, editor, Proceedings of International Workshop on Memory Management, Lecture Notes in Computer Science, Kinross, Scotland, Sept. 1995. Springer-Verlag.

....Related Collectors There are two other mostly copying collectors that bear a strong resemblance to MCC. One, due to Bartlett, is used in a Scheme to C compiler and in its newest variant has migrated to C [7] The other is the Customizable Memory Manager (CMM) which is also a collector for C [3, 4]. Bartlett s algorithm does two traversals over the live graph. Conceptually, in the first pass the algorithm identifies all quasi pointers and all objects that cannot be moved. It promotes all pages containing such objects to to space by linking them into the to space list. In the second pass, ....

....page. The algorithm that Bartlett actually uses aggressively copies elements during the first pass and unrolls copies that were incorrectly made during the second pass. CMM is a customizable collector that supports mostlycopying collector. BDW and CMM have been compared in the context of C [4]. Like Bartlett, CMM implements a two stage mostly copying algorithm. In the first stage all other heaps are examined for quasi pointers, or pointers into this heap. All pages containing objects referenced by Checksum Performs a checksum on a stream of 16 bit values. KnuthBendix Runs the ....

G. Attardi, T. Flagella, and P. Iglio. Performance tuning in a customizable collector. In H. Baker, editor, Proceedings of International Workshop on Memory Man8 agement, Lecture Notes in Computer Science, Dipartimento di Informatica, Universita di Pisa, Sept. 1995. Springer-Verlag.

....are stored on a given page) BiBoP obviates the need for a header word per object but it also makes it difficult to associate state with each object, and to allocate quickly. To the best of our knowledge since Bartlett s original work there has only been one other mostly copying collector: CMM [4, 5, 6] (for C ) CMM improves on Bartlett s algorithm in that it associates a bitmap with each page which allows it to mark individual objects, thus achieving less false retention. However, CMM did not make any fundamental changes and therefore still requires two passes over the live data. Some data ....

G. Attardi, T. Flagella, and P. Iglio. Performance tuning in a customizable collector. In H. Baker, editor, Proceedings of International Workshop on Memory Management, Lecture Notes in Computer Science, Dipartimento di Informatica, Universita di Pisa, Sept. 1995. Springer-Verlag.

....of the collector algorithm to limit the cases of recursion, statistics on its benefits, support for arrays of CmmObjects, support for virtual base classes and references in classes, the extension of the framework with the mark and sweep heap, detailed description on how to extend the framework. In [4] preliminary results of benchmarking with CMM were presented. 16 Conclusion The CMM offers garbage collection facilities which can be taylored to the need of an application. Programmers can use a generic collector, a specific collector or no collector at all, according to the need of each ....

G. Attardi, T. Flagella and P. Iglio, `Performance Tuning in a Customizable Collector', Memory Management, IWMM 95, Lecture Notes in Computer Science n. 986, Springer-Verlag, Berlin, 179--196 (1995).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC