Optimizations of generational garbage collections based on continuous damage process

In the computer science community, garbage collection is a dynamic storage management technology to ensure the reliability of computer systems. In this paper, we consider two garbage collection policies to meet the goal of time consumption for a generational garbage collector when increase in objects might be unclear at discrete times for the high frequency of computer processes. That is, (a) tenuring collection is triggered at the [Formula: see text]th minor collection preventively or at a threshold amount [Formula: see text] of surviving objects correctively, and (b) major collection is made at discrete times [Formula: see text] for a given [Formula: see text] or at the [Formula: see text]th collection including minor and tenuring collections. Using the damage process and renewal theory, the expected cost rates are obtained, and their optimal policies for tenuring and major collection are discussed analytically and computed numerically.