Free List
978-613-4-51281-7
6134512818
84
2010-12-02
34.00 €
eng
https://images.our-assets.com/cover/230x230/9786134512817.jpg
https://images.our-assets.com/fullcover/230x230/9786134512817.jpg
https://images.our-assets.com/cover/2000x/9786134512817.jpg
https://images.our-assets.com/fullcover/2000x/9786134512817.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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 linked list, using the first word of each unallocated region as a pointer to the next. It's most suitable for allocating from a memory pool, where all objects have the same size. Free lists make the allocation and deallocation operations very simple. To free a region, one would just add it to the free list. To allocate a region, one would simply remove a single region from the end of the free list and use it. If the regions are variable-sized, one may have to search for a region of large enough size, which can be expensive.
https://www.morebooks.de/books/gb/published_by/betascript-publishing/1/products
Informatics
https://www.morebooks.de/store/gb/book/free-list/isbn/978-613-4-51281-7