Results 1 
5 of
5
Dynamic storage allocation: A survey and critical review
, 1995
"... Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble one. In this survey, we describe a variety of memory allocator designs and point out issues relevant to their de ..."
Abstract

Cited by 214 (6 self)
 Add to MetaCart
Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble one. In this survey, we describe a variety of memory allocator designs and point out issues relevant to their design and evaluation. We then chronologically survey most of the literature on allocators between 1961 and 1995. (Scores of papers are discussed, in varying detail, and over 150 references are given.) We argue that allocator designs have been unduly restricted by an emphasis on mechanism, rather than policy, while the latter is more important; higherlevel strategic issues are still more important, but have not been given much attention. Most theoretical analyses and empirical allocator evaluations to date have relied on very strong assumptions of randomness and independence, but real program behavior exhibits important regularities that must be exploited if allocators are to perform well in practice.
Buddy Systems
 Communications of the ACM
, 1974
"... Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddysystem, the ..."
Abstract

Cited by 38 (0 self)
 Add to MetaCart
Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddysystem, the Fibonai buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external and total fragmentation.
ON A GENERALIZATION OF A RECURSIVE SEQUENCE Peter Kiss and Bela Zay*
, 1990
"... Let k and t be fixed positive integers and let Gk, a sequence of integers defined by (1) G ..."
Abstract
 Add to MetaCart
Let k and t be fixed positive integers and let Gk, a sequence of integers defined by (1) G
Operating R.S. Gaines Systems Editor Buddy
"... Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddy system, the Fib ..."
Abstract
 Add to MetaCart
Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation. Each buddy system corresponds to a set of recurrence relations which relate the block sizes provided to each other. Analyses of the internal fragmentation of the binary buddy system, the Fibonacci buddy system, and the weighted buddy system are given. Comparative simulation results are also presented for internal, external, and total fragmentation. Key Words and Phrases: dynamic storage allocation, buddy system, fragmentation, Fibonacci buddy
Figure 1. A Schematic Diagram of a SelfReplicating Process 1985] 359LINEAR RECURRENCE RELATIONS WITH BINOMIAL COEFFICIENTS
, 1984
"... A linear recurrence relation of the n th order is defined as 2i + „ = tadTi+„j> i 0, 1, 2,.... (1) J = 1 where al9 a2,..., an are given coefficients. When all the coefficients are set equal to 1, the relation generates ^Fibonacci sequences [l]s the Fibonacci sequence for n = 2, the Tribonacci ..."
Abstract
 Add to MetaCart
A linear recurrence relation of the n th order is defined as 2i + „ = tadTi+„j> i 0, 1, 2,.... (1) J = 1 where al9 a2,..., an are given coefficients. When all the coefficients are set equal to 1, the relation generates ^Fibonacci sequences [l]s the Fibonacci sequence for n = 2, the Tribonacci sequence for n = 3 [2], and so on. Another case arises when the coefficients in relation (1) are set equal to binomial coefficients, i.e.9 ^ + i+f (2) * S w ir For n = 2, relation (2) is reduced to the Fibonacci sequence and the recurring sequences generated by the recurrence relations with binomial coefficients (2) can be considered as another generalization of the Fibonacci sequence. These "binomial " sequences interest the author because of their relation to the dynamic development of selfreplicating biochemical systems [3]. Consider selfreplication of the type shown in Figure ls i.e.9