On the worst case performance of buddy systems (Q1060010)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3905841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the worst case performance of buddy systems |
scientific article; zbMATH DE number 3905841 |
Statements
On the worst case performance of buddy systems (English)
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
0.9003041982650757
0 references
0.8927948474884033
0 references
0.7943066954612732
0 references
0.7303430438041687
0 references
