当前位置: X-MOL 学术Proc. Inst. Mech. Eng. Part O J. Risk Reliab. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimizations of discrete garbage collections in computer reliability systems
Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability ( IF 2.1 ) Pub Date : 2021-06-02 , DOI: 10.1177/1748006x211023250
Hongshuang Feng 1 , Xufeng Zhao 1
Affiliation  

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.



中文翻译:

计算机可靠性系统中离散垃圾收集的优化

在计算机科学界,垃圾收集是一种动态的存储管理技术,以保证计算机系统的可靠性。在本文中,我们考虑了两种离散的垃圾收集策略来满足分代垃圾收集器的时间消耗目标。也就是说,垃圾收集发生在非同质泊松过程中,(a)在第N个次要收集时预防性地或在阈值数量时触发终身收集δ 正确地保留对象的数量,以先发生者为准,并且 (b) 当幸存对象的数量超过阈值水平时,在第一次收集时触发终身收集 δ对于给定的T,主要收集在离散时间kT触发。使用损坏过程和更新理论,获得了预期成本率,并分析讨论了它们的保有权和主要收藏的最佳策略并进行了数值计算。

更新日期:2021-06-02
down
wechat
bug