Quote: for first-fit memory allocation allocation is faster than deallocation; use common list structure for faster deallocation

Quotation Skeleton

[For First-fit and related algorithms] allocation times are much shorter than deallocation … are searched during deallocation. It seems reasonable, then, … need to be searched for both allocation and … Fig 1. The Common List data structure [two lists in address order: allocated+free nodes and free nodes, both lists double-linked] … [p. 222] for deallocation the free nodes of the … the portion of the allocated list that contains … is searched. … [p. 225] Table 3 Average deallocation time comparison [using memory trace files. Guavac 11x faster, gzip 0x, gawk -.03 to 0.3 faster, adol 0-0.4x faster]   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: memory management by free list (19 items)