SavedAdd your journal

Journals / Istanbul University Journal of Electrical and Electronics Engineering / 2005 / Cilt: 5 - Sayı: 2

Dynamic memory allocator algorithms simulation and performance analysis

A. Halim ZAIM
Ahmet SERTBAŞ
Fethullah KARABİBER
Pages
1435–1441
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In the simulations, internal, external and total fragmentation, and process times are used as performance criteria.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this work, Dynamic memory allocation that is critical issue in the design of computer systems is examined.
📊
Key Findings & Data:During first part of this project, improved software techniques separated into three different categories such as Bit map, Linked list techniques, Buddy systems are analyzed.
💡
Conclusion & Impact:In the simulations, internal, external and total fragmentation, and process times are used as performance criteria.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this work, Dynamic memory allocation that is critical issue in the design of computer systems is examined. During first part of this project, improved software techniques separated into three different categories such as Bit map, Linked list techniques, Buddy systems are analyzed. For this purpose, algorithms are simulated by using C++ programming language. In the simulations, internal, external and total fragmentation, and process times are used as performance criteria.

🔖

Cite This Article

ZAIM, A. H., SERTBAŞ, A., KARABİBER, F. (2022). Dynamic memory allocator algorithms simulation and performance analysis. Istanbul University Journal of Electrical and Electronics Engineering, Cilt: 5 - Sayı: 2, 1435–1441. https://ajindex.com/articles/543853

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (2)

  1. Zorn B., July 1993, The measured cost of conservative garbage collection, Software- Practıce And Experıence, Vol. 23, No. 7, 733-756 [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,
  2. Buddy systems, Communications Of The ACM, Vol. 20, 421-431