DYNAMIC MEMORY ALLOCATOR ALGORITHMS SIMULATION AND PERFORMANCE ANALYSIS

Abstract

DYNAMIC MEMORY ALLOCATOR ALGORITHMS SIMULATION AND PERFORMANCE ANALYSIS

Keywords

• -

References

1. Zorn B., July 1993, The measured cost of conservative garbage collection, SoftwarePractıce And Experıence, Vol. 23, No. 7, 733756
2. Shen. K.K. and Peterson, J.L., Oct. 1974, A weighted buddy method for dynamic storage allocation. Communications Of The ACM 17, 10, 558-562
3. Barkle, R.E. ve Lee T.P., Dec 1989, A Lazy Buddy System Bounded by Two Coalescing Delays per Class, Proc. 12th Symp. Opertatıng System Prıncples, vol:23, no:5, 167-176
4. Hırschberg, D.S., Oct. 1973, A class of dynamic memory allocation algorithms. Communications Of The ACM 16, 10, 615-618
5. Tanenbaum A.S. ve Woodhull A. S., 1997, Operating Systems Design and Implementation, Prentice Hall, Portland, 0-13-638677-6
6. Wilson P. R., Johnstone M. S., Neely M. ve Boles D., September 1995, Dynamic Storage Allocation: A Survey and Critical Review, International Workshop on Memory Management, Kinross, Scotland, UK
7. Peterson J.L. ve Norman T.A., June 1977, Buddy systems, Communications Of The ACM, Vol. 20, 421-431