Descriptor: "DYNAMIC storage allocation (Computer science)" / Language: english / Topic: algorithms and dynamic storage allocation - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"DYNAMIC storage allocation (Computer science)"' showing total 4 results

Start Over Descriptor "DYNAMIC storage allocation (Computer science)" Topic algorithms Topic dynamic storage allocation Language english

Author: Nielsen, Norman R.
Subjects: *DYNAMIC storage allocation (Computer science), *ALGORITHMS, *SIMULATION methods & models, *MEMORY maps (Computer science), *SIMSCRIPT (Computer program language), *COMPUTER simulation, *MATHEMATICAL optimization, *COMPUTER algorithms, *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]
Published: 1977
Full Text: View/download PDF

Author: Hirschberg, Daniel S. and Weissman, C.
Subjects: *DYNAMIC storage allocation (Computer science), *COMPUTER algorithms, *ALGORITHMS, *COMPUTER programming, *FIBONACCI sequence
Abstract: A new dynamic memory allocation algorithm, the Fibonacci system, is introduced. This algorithm is similar to, but seems to have certain advantages over, the "buddy" system. A generalization is mentioned which includes both of these systems as special cases. [ABSTRACT FROM AUTHOR]
Published: 1973
Full Text: View/download PDF

Author: Buchsbaum, Adam L., Karloff, Howard, Kenyon, Claire, Reingold, Nick, and Thorup, Mikkel
Subjects: *DYNAMIC storage allocation (Computer science), *ALGORITHMS, *POLYNOMIALS, *ALGEBRA, *COMPUTER programming, *DIGITAL communications
Abstract: Dynamic storage allocation is the problem of packing given axis-aligned rectangles into a horizontal strip of minimum height by sliding the rectangles vertically but not horizontally. Where L = LOAD is the maximum sum of heights of rectangles that intersect any vertical line and OPT is the minimum height of the enclosing strip, it is obvious that OPT ≥ LOAD; previous work showed that OPT < 3 LOAD. We continue the study of the relationship between OPT and LOAD, proving that OPT = L + O((hmax/L)1/7)L, where hmax is the maximum job height. Conversely, we prove that for any ϵ > 0, there exists a c > 0 such that for all sufficiently large integers hmax, there is a dynamic storage allocation instance with maximum job height hmax, maximum load at most L, and OPT ≥ L + c(hmax/L)1/2+ϵL, for infinitely many integers L. En route, we construct several new polynomial-time approximation algorithms for dynamic storage allocation, including a (2 + ϵ)-approximation algorithm for the general case and polynomial-time approximation schemes for several nafliral special cases. [ABSTRACT FROM AUTHOR]
Published: 2004
Full Text: View/download PDF

Author: Cranston, Ben and Thomas, Rick
Subjects: *DYNAMIC storage allocation (Computer science), *FIBONACCI sequence, *COMPUTER algorithms, *BUFFER storage (Computer science), *COMPUTER programming, *COMPILERS (Computer programs), *NUMBER theory, *COMPUTER software, *ALGORITHMS
Abstract: A simplified recombination scheme for the Fibonacci buddy system which requires neither tables nor repetitive calculations and uses only two additional bits per buffer is presented. [ABSTRACT FROM AUTHOR]
Published: 1975
Full Text: View/download PDF

Books, media, physical & digital resources

Searchworks