这两个都属于同一类算法，称为栈算法（stack algorithm），都绝不可能有Belady异常。栈算法可以证明为：对付帧数为n的内存页集合是对付帧数为n+1的内存页集合的子集。
基于12个网页-相关网页
generalized stack algorithm 广义堆栈算法
the stack algorithm stack算法
blocked stack algorithm 阻塞stack
stack bucket algorithm 栈桶式算法
stack replacement algorithm 栈替换算法
blocked stack 3 algorithm 阻塞stack
·2,447,543篇论文数据，部分数据来源于NoteExpress
In fact, if you were to trace this algorithm, you would realize that it builds a list of all the possible stack configurations and the transitions between them.
事实上，如果跟踪该算法的过程，就会认识到它构建一个所有可能的堆栈配置以及在这些配置间的转换的列表。
This call leads to essentially the same algorithm being executed, but on the call stack encapsulated in this AccessControlContext (belonging to the client).
这个调用实质上会执行同一个算法，但是是对于在这个 AccessControlContext 中封装的调用堆栈（属于客户机）执行。
It's easier to understand this portion of the algorithm if you remember that each state represent a certain stack configuration.
如果您记得每种状态表示一个堆栈配置，则理解算法的这一部分是较容易的。
应用推荐