Journal ArticleDOI
Efficient implementation of the first-fit strategy for dynamic storage allocation
TLDR
An algorithm that efficiently implements the first-fit strategy for dynamic storage allocation, which is faster than many commonly used algorithms, especially when many small blocks are allocated, and has good worst-case behavior.Abstract:
We describe an algorithm that efficiently implements the first-fit strategy for dynamic storage allocation. The algorithm imposes a storage overhead of only one word per allocated block (plus a few percent of the total space used for dynamic storage), and the time required to allocate or free a block is O(log W), where W is the maximum number of words allocated dynamically. The algorithm is faster than many commonly used algorithms, especially when many small blocks are allocated, and has good worst-case behavior. It is relatively easy to implement and could be used internally by an operating system or to provide run-time support for high-level languages such as Pascal and Ada. A Pascal implementation is given in the Appendix.read more
Citations
More filters
Book ChapterDOI
Dynamic Storage Allocation: A Survey and Critical Review
TL;DR: This survey describes a variety of memory allocator designs and point out issues relevant to their design and evaluation, and chronologically survey most of the literature on allocators between 1961 and 1995.
Journal ArticleDOI
Optimized IoT service placement in the fog
TL;DR: This work model the service placement problem for IoT applications over fog resources as an optimization problem, which explicitly considers the heterogeneity of applications and resources in terms of Quality of Service attributes, and proposes a genetic algorithm as a problem resolution heuristic.
Book
The Garbage Collection Handbook: The Art of Automatic Memory Management
TL;DR: The Garbage Collection Handbook: The Art of Automatic Memory Management brings together a wealth of knowledge gathered by automatic memory management researchers and developers over the past fifty years and compares the most important approaches and state-of-the-art techniques in a single, accessible framework as discussed by the authors.
Patent
Computer method and system for allocating and freeing memory utilizing segmenting and free block lists
TL;DR: In this paper, a heap manager manages the heap in response to requests from the requesting program and maintains a free list for each segment, which is a list of the free blocks contained in a segment.
Dissertation
Scheduling Garbage Collection in Embedded Systems
TL;DR: A scheduling strategy is presented that employs the properties of control systems to ensure that no garbage collection work is performed during the execution of critical processes, and the hard real-time part of the system is thus never disturbed by garbage collector work.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
A fast storage allocator
TL;DR: TEST MACRO EtNEXT,XX CONSIDER SQUARE C (RELATIVE to LEAD).
Journal ArticleDOI
A unifying look at data structures
TL;DR: A demonstration is given of the way in which a simple geometrical construction yields new and efficient algorithms for various searching and list manipulation problems.
Journal ArticleDOI
Buddy systems
TL;DR: Two algorithms are presented for implementing any of a class of buddy systems for dynamic storage allocation which corresponds to a set of recurrence relations which relate the block sizes provided to each other.
Journal ArticleDOI
The PORT Mathematical Subroutine Library
TL;DR: The development at Bell Laboratorms of PORT, a hbrary of portable Fortran programs for numemcal computation, is discussed and the library is built around an automatm error-handling facility and a dynamm storage allocatmn scheme, both of which are implemented portably.