The Community for Technology Leaders
Green Image
<p>As some object-oriented computing systems support the object type buffer by hardware, it is reasonable to base their free storage management on a set of buffers, each containing free storage blocks of a specific length. Then memory space can normally be allocated and deallocated by simple buffer read and write operations. More complex routines have to be executed only when a buffer full or buffer empty exception is raised. Their task is to clear a buffer position or to insert a storage descriptor into the buffer, respectively. An algorithm that handles such exceptions by splitting and recombination of free blocks and relocation of objects is described. The algorithm is tuned by a set of parameters that specify the amount of descriptors the buffers may hold immediately after exception handling. As a consequence, each buffer receives a moderate number of descriptors, so that the probability of further exceptions is reduced. Moreover, the parameters control the tradeoff between relocation costs and resulting storage fragmentation. The performance of the algorithm is evaluated by an analytical and a simulation model, and methods to find optimal parameter values are described.</p>
buffer-based method; storage allocation; object-oriented system; free storage management; storage descriptor; exceptions; free blocks; exception handling; relocation costs; storage fragmentation; optimal parameter values; buffer storage; object-oriented programming; storage allocation; storage management.

C. Vogt, "A Buffer-Based Method for Storage Allocation in an Object-Oriented System," in IEEE Transactions on Computers, vol. 39, no. , pp. 375-383, 1990.
93 ms
(Ver 3.3 (11022016))