Skip Navigation

The Computer Journal 1984 27(4):328-333; doi:10.1093/comjnl/27.4.328
© 1984 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Pflug, G. Ch.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Dynamic Memory Allocation–a Markovian Analysis

G. Ch. Pflug *

University of Giessen, Giessen, Germany

A new, approximate Markovian approach for the analysis of the behaviour of dynamic memory allocation algorithms is presented in this paper. The most famous result in this area, Knuth's 50% rule, is given a new sense. The distribution of the number of free blocks is calculated explicitly for low storage utilization. Thus, simulation results published by earlier authors can be explained by the analysis. However, the method is an approximate one. The exact form of the stationary distribution of the storage configuration is still unknown and its determination seems–owing to the complexity of the system–to be a very hard problem.

Received April 1983.

* University of Giessen, Giessen, FRG


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.