KaydedilenlerDerginizi ekleyin

Dergiler / 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
Sayfa
1435–1441
Yayın Tarihi
2022-10-18
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

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

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:In this work, Dynamic memory allocation that is critical issue in the design of computer systems is examined.
📊
Temel Bulgular & Veri: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.
💡
Sonuç & Katkı:In the simulations, internal, external and total fragmentation, and process times are used as performance criteria.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri

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.

🔖

Bu Makaleye Atıf Yap

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

📄 Tam Metin PDF Okuyucu

📄

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

Kaynakça (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