RUI: "Splay Trees" as Operating System Ready Queues

本研究的目的是修改算法的“展树” 由Sleator和Tarjan开发的数据结构，以便使用splay 并发实时操作中就绪队列实现的树 系统. 特别地，用于“出队”和 将制定“排队”程序，以利用 满足紧耦合中的并发性需求 多处理器环境 修改后的数据结构将是 在开发操作系统中实现，以便 新开发的算法和那些之间的比较 链表

This research is designed to modify the algorithms for the "splay tree" data structure developed by Sleator and Tarjan so as to use the splay tree for ready queue implementations in concurrent real-time operating systems. In particular, alternate heuristics for the "dequeue" and "enqueue" procedures will be developed to take advantage of, and to meet the demands of, the concurrency in a tightly-coupled multiprocessor environment. The modified data structure will then be implemented in a developmental operating system in order to make comparisons between the newly developed algorithms and those for the linked list.