ABOUT WORKING SET FOR DYNAMIC MEMORY ALLOCATION

Authors

  • A. S. Yurchenko National Aviation University
  • A. P. Kozlov National Aviation University

DOI:

https://doi.org/10.18372/1990-5548.47.10297

Keywords:

Dynamic paging memory allocation, working set, model for program behavior, fragmentation, memory simulation

Abstract

A New approach to dynamic allocation of memory paging is described. The approach is distinguishedfor a choice of the dynamic allocation of memory paging algorithm parameters during a computationprocess for achieving maximum loading of the central processor

Author Biographies

A. S. Yurchenko, National Aviation University

Candidate of Engineering. Assistant professor. Aviation Computer-Integrated Complexes Department

A. P. Kozlov, National Aviation University

Candidate of Engineering. Assosiate Professor. Aviation Computer-Integrated Complexes Department

References

Donald Knuth, Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. ISBN 0-201-89683-4. Section 2.5: Dynamic Storage Allocation, pp. 435–456.

P. J. Denning, “Working sets part and present.” IEEE Trans. Software Eng., 1980, 6, no. 1, pp. 64 – 84.

A. J. Smith, “A modified working at paging algorithm.” IEEE Trans. Comput., 1976, 25, no. 9, pp. 907–914.

W. W. Chu, and H. Opderbeck, “Performance of the page fault frequency replacement algorithm in multiprogramming

environment.” In: IFIP Congress–74. Stockholm, 1974, pp. 235–241.

W. W. Chu, and H. Opderbeck, “The page fault frequency replacement algorithm.” In: Proc. AFIPS 1972. Fall joint computer conf., 1972, no. 41. pp. 597–609.

W. W. Chu, and H. Opderbeck, “Performance of replacement algorithm with different page sizes.” Computer, 1974, 7, no.11, pp. 14–21.

G. S. Graham, and P. J. Denning, “On relative controllability of memory policies.” In: Computer performance: Proc. of the inert. symp. on comput. performance modeling, measurement and evaluation. New York, 1977, pp. 411–428.

A New approach to minimize page fault. 2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012), http://www.ipcsit.com/vol27/20-ICICN2012-N048.pdf

Hidden costs of memory allocation. https://randomascii.wordpress.com/2014/12/10/hidde n-costs-of-memory-allocation/

Memory profiling for application performance. https://blogs.windows.com/buildingapps/2012/01/31/memory-profiling-for-application-performance/.

Downloads

Issue

Vol. 1 No. 47 (2016)

Section

MATHEMATICAL MODELING OF PROCESSES AND SYSTEMS

License

Authors who publish with this journal agree to the following terms:

Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).