Abstract
We report on our experience in trying to achieve the best performance from memory management in a highly demanding computer algebra algorithm. We explored the idea of tuning the collector to the algorithm and of synchronising the collector and the mutator. We describe how such tuning and synchronization can be achieved using a customizable collector. We present the results of benchmarks comparing such solution with the use of other collectors.
The research described here has been funded in part by the ESPRIT Basic Research Action, project PoSSo.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Attardi, G., Flagella, T.: A customisable memory management framework. Proceedings of USENIX C+ + Conference 1994, Cambridge, Massachusetts (1994)
Attardi, G., Flagella, T.: Customising object allocation. in M. Tokoro and R. Pareschi (eds.) Object-Oriented Programming, Proceedings of the 8th ECOOP, Lecture Notes in Computer Science 821. Berlin:Springer-Verlag, (1994) 320–343
Bartlett, J.F.: Compacting garbage collection with ambiguous roots. Tech. Rep. 88/2, DEC Western Research Laboratory, Palo Alto, California (1988)
Bartlett, J.F.: Mostly-copying collection picks up generations and C++. Tech. Rep. TN-12, DEC Western Research Laboratory, Palo Alto, California (1989)
Boehm, H.J., Weiser, M.: Garbage collection in an uncooperative environment. Software Practice and Experience 18(9) (1988) 807–820
Buchberger, B.: Gröbner bases: an algorithmic method in polynomial ideal theory. Recent trends in multidimensional systems theory, N. K. Bose (Ed.), D. Reidel Publ. Comp. (1985) 184–232
Buchberger, B. and Jebelean, T: Parallel rational arithmetic for Computer Algebra Systems: Motivating experiments. 3rd Scientific Workshop of the Austrian Center for Parallel Computation, Report ACPC/TR 93-3 (1993)
Detlefs, D.L.: Concurrent garbage collection for C++. CMU-CS-90-119, School of Computer Science, Carnegie Mellon University (1990)
Edelson, D.R.: A mark-and-sweep collector for C++. Proc. of ACM Conference on Principle of Programming Languages (1992)
Ellis, J.R., Detlefs, D.L.: Safe, efficient garbage collection for C++. Xerox PARC report CSL-93-4 (1993)
Faugère, J.C: Résolution des systèmes d'équations algébriques. PhD thesis, Université Paris 6 (1994)
Ichbiah, J.D. et al.: Rationale for the design of the ADA programming language. ACM SIGPLAN Notices 14(6) (1979)
Katsura, S., et al.: Cell Biophysics 11 (1987) 309–319
Rouillier, F.: Personal communication (1994)
Samples, A.D.: GC-cooperative C++. Lecture Notes in Computer Science 637. Berlin:Springer-Verlag, 315–329. (1992)
Weinreb, D., Moon, D. and Stallman, R.M.: Lisp Machine Manual. Massachusetts Institute of Technology, Cambridge, Massachusetts, (1983)
Wentworth, E.P.: Pitfalls of conservative garbage collection. Software Practice and Experience 20(7) (1990) 719–727
Wilson, P.R.: Uniprocessor garbage collection techniques. Memory Management, Y. Bekkers and J. Cohen (Eds.), Lecture Notes in Computer Science 637, Springer-Verlag, (1992) 1–42
Zorn, B.: The measured cost of conservative garbage collection. Technical Report CU-CS-573-92, Department of Computer Science, University of Colorado at Boulder, Boulder, Colorado (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag
About this paper
Cite this paper
Attardi, G., Flagella, T., Iglio, P. (1995). Performance tuning in a customizable collector. In: Baler, H.G. (eds) Memory Management. IWMM 1995. Lecture Notes in Computer Science, vol 986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60368-9_24
Download citation
DOI: https://doi.org/10.1007/3-540-60368-9_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60368-9
Online ISBN: 978-3-540-45511-0
eBook Packages: Springer Book Archive