On the worst case performance of buddy systems (Q1060010)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the worst case performance of buddy systems
scientific article

    Statements

    On the worst case performance of buddy systems (English)
    0 references
    0 references
    0 references
    1985
    0 references
    The worst-case performance of both binary and Fibonacci buddy systems is analyzed. For both unrestricted and allocation-only request sequences, exact bounds on both the external and total fragmentation are derived.
    0 references
    memory management
    0 references
    storage allocation
    0 references
    worst-case performance
    0 references
    Fibonacci buddy systems
    0 references

    Identifiers