Dynamic Memory Allocation in Computer Simulation.
Saved in:
| Title: | Dynamic Memory Allocation in Computer Simulation. |
|---|---|
| Authors: | Nielsen, Norman R.1 |
| Source: | Communications of the ACM. Nov1977, Vol. 20 Issue 11, p864-873. 10p. |
| Subjects: | Dynamic storage allocation (Computer science), Algorithms, Simulation methods & models, Memory maps (Computer science), SIMSCRIPT (Computer program language), Computer simulation, Mathematical optimization, Storage fragmentation (Computer science) |
| Abstract: | This paper investigates the performance of 35 dynamic memory allocation algorithms when used to service simulation programs as represented by 18 test cases. Algorithm performance was measured in terms of processing time, memory usage, and external memory fragmentation. Algorithms maintaining separate free space lists for each size of memory block used tended to perform quite well compared with other algorithms. Simple algorithms operating on memory ordered lists (without any free list) performed surprisingly well. Algorithms employing power-of-two block sizes had favorable processing requirements hut generally unfavorable memory usage. Algorithms employing LIFO, FIFO, or memory ordered free lists generally performed poorly compared with others. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
