Dynamic initial allocation and local reallocation procedures for multiple stacks
暂无分享,去创建一个
Two new procedures for manipulating multiple stacks which share sequential memory locations are discussed. The first is the dynamic initial allocation procedure in which each stack is allocated as its first element arrives rather than having every stack preallocated at the very beginning of the entire process. The second is the local reallocation procedure; in this scheme, when a stack overflows, only its neighboring stacks, rather than the entire memory area, are reorganized provided that a certain condition is satisfied. The results of simulation appear to suggest that these new approaches improve the operational performance in many applications. With appropriate modifications, these concepts may also be applied to any other type of multiple linear lists (e.g., multiple queues) sharing sequential memory locations.
[1] Thomas A. Standish. Data Structure Techniques , 1980 .
[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[3] Daniel G. Bobrow,et al. A model and stack implementation of multiple environments , 1973, CACM.
[4] James F. Korsh,et al. A multiple-stack manipulation procedure , 1983, CACM.
[5] Jan V. Garwick,et al. Data storage in compilers , 1964 .