{'fraction_non_alphanumeric': 0.016898608349900597, 'fraction_numerical': 0.0, 'mean_word_length': 5.5816993464052285, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimizations of discrete garbage collections in computer reliability systems

In computer science community, garbage collection is a dynamic storage management technology to ensure the reliability of computer systems. In this paper, we consider two discrete garbage collection policies to meet the goal of time consumption for a generational garbage collector. That is, garbage collections occur at a nonhomogeneous Poisson process, (a) tenuring collection is triggered at the Nth minor collection preventively or at a threshold amount δ of surviving objects correctively, whichever takes place first, and (b), tenuring collection is triggered at the first collection when the amount of surviving objects has exceeded a threshold level δ and major collection is triggered at discrete times kT for a given T. Using the damage process and renewal theory, the expected cost rates are obtained, and their optimal policies for tenuring and major collections are discussed analytically and computed numerically.