PERFORMANCE OF DYNAMIC MEMORY ALLOCATION ALGORITHMS

A. S. Yurchenko, N. F. Tupitsin, A. P. Kozlov, Yu. М. Kemenyash

Abstract


With the help of modeling there have been investigated 15 algorithms dynamic allocation ofthe non-paged memory, which, in addition to well-known, include four new algorithms, as well as threealgorithms of memory compression

Keywords


Dynamic memory allocation; first-fit; best-fit; fragmentation; simulation

References


Dr. Taylor, (2003). Deepak Agrawal Memory Management. http://msoe.us/taylor/cs384/agrawald.pdf.

P. J. Denning, “Virtual memory”, Comput. Surv. 28(4), pp. 213–216. 1996.

P. J. Denning (2008, January). Virtual memory, Naval Postgraduate School, Monterey, California, http://denninginstitute.com/pjd/PUBS/ENC/vm08.pdf.

D. E. Knuth, The Art of Computer Programming, vol. 1-4A Boxed Set Hardcover. March 3, 2011.

K. K. Shen, and J. L. Peterson. “A weighted buddy method for dynamic storage allocation”. Comm. ACM, 17, no. 10, pp. 558–562. 1974.

Carter Bays. “A comparison of next-fit, first-fit and best-fit”. Comm. ACM, 20, no. 3, pp.191–192. 1977.

V. M. Sineglazov, A. S. Yurchenko, N. F.Tupitsin, and A. P. Kozlov, “The dynamic segment memory allocation algorithms”. Electronics and Control Systems, no. 2(44). Kyiv: NAU, pp. 114–120. 2015.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.