z-logo
Premium
Multiple stack performance near saturation
Author(s) -
Munakata Toshinori,
Yeh D. Yun
Publication year - 1987
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380170605
Subject(s) - stack (abstract data type) , saturation (graph theory) , computer science , mathematics , operating system , combinatorics
Detailed simulation experiments have been performed to study multiple stack performance, primarily using two methods recently developed by the authors called dynamic initial allocation and local reallocation procedures. Some results are: determining first occurrences of overflows in terms of storage saturation; observing performance behaviours, particularly for near full storage saturation; and performance evaluation on the weight of two storage redistribution schemes, one being based on the most recent stack growth , the other on the current stack size. Also discussed is the issue of whether additional space should be sought when storage is near saturation, and if so, how it is to be obtained. The critical stack saturation percentage is proposed as the point where additional storage space should be sought. It is the one at which the expected total cost is the minimum.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here