Thumbnail
Access Restriction
Subscribed

Author Munakata, Toshinori ♦ Yeh, D. Yun
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract 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.
Description Affiliation: Arizona State Univ., Tempe, AZ (Yeh, D. Yun) || Cleveland State Univ., OH (Munakata, Toshinori)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 29
Issue Number 2
Page Count 8
Starting Page 134
Ending Page 141


Open content in new tab

   Open content in new tab
Source: ACM Digital Library