Finite size scaling approach to dynamic storage allocation problem

Details Finite size scaling approach to dynamic storage allocation problem Finite size scaling approach to dynamic storage allocation problem

2003-07-02

arxiv.org/abs/cond-mat/0307058v1

Physica A: Statistical Mechanics and its Applications, Volume 327, Issues 3-4, 15 September 2003, Pages 563-569

Physics

Condensed Matter

Statistical Mechanics

9 pages, 4 figures, will apear in Physica A

Scientific paper

10.1016/S0378-4371(03)00509-0

It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of finite size scaling. The method is illustrated in the three simple cases of the it first-fit, next-fit and it best-fit algorithms, and the system works at full capacity. The analysis is done from two different points of view - running speed and employed memory. In both cases, and for all algorithms, it is shown that a simple scaling function exists and the relevant exponents are calculated. The method can be applied on similar problems as well.

Affiliated with

Also associated with

No associations

Rating

Finite size scaling approach to dynamic storage allocation problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite size scaling approach to dynamic storage allocation problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite size scaling approach to dynamic storage allocation problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-630652