Skip to search formSkip to main contentSkip to account menu

Free list

A free list is a data structure used in a scheme for dynamic memory allocation. It operates by connecting unallocated regions of memory together in a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Buddy memory allocationLinked listList of data structuresLocality of reference

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Dynamic Allocation for Embedded Heterogeneous Memory : An Empirical Study
Embedded systems are omnipresent and contribute to our lives in many ways by instantiating functionality in larger systems. To… 
2009
2009
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel… 
2007
2007
List decoding of the first-order binary Reed-Muller codes
A list decoding algorithm is designed for the first-order binary Reed-Muller codes of length n that reconstructs all codewords… 
2006
2006
Ethnobotany of rural people from the boundaries of Carlos Botelho State Park, São Paulo State, Brazil
Neste estudo, nos descrevemos e analisamos o uso de recursos vegetais em uma regiao proxima a uma area de conservacao. Os dados… 
2005
2005
Generating Huffman sequences
2004
2004
The ethnophysiology of the Tzeltal Maya of Highland Chiapas
2000
2000
Damelo! An Explicitly Co-locating Web Cache File System
How to best relate cached web objects is a complex and on-going problem and always depends on the workload. By locating objects… 
1997
1997
Slotted priorities: supporting real-time computing within general-purpose operating systems
Slotted Priorities: Supporting Real-Time Computing Within General-Purpose Operating Systems Recent advances in network… 
1994
1994
Processor management policies for multiprocessors
Processor management in parallel systems is a crucial issue for improving the performance of these machines in a multiuser… 
1992
1992
The buried binding and dead binding problems of Lisp 1.5: sources of incomparability in garbage collector measurements
Lisp has become the language of choice for many applications such as artificial intelligence programs or symbol manipulation. The… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)