How to schedule unlimited memory pinning of untrusted processes or provisional ideas about service-neutrality

摘要

You can read it as a paper that treats a concrete problem motivated in the first section: how can we permit untrusted user processes to pin their virtual pages in memory most flexibly and as unlimited as possible? From this point of view, the paper presents a general solution that is theoretically and experimentally reasonably substantiated. However, you can also read the paper as an approach to solve the more general problem of how an existing system can be extended by new operations while preserving the original system's QoS properties. From this point of view, the paper is highly speculative. The presented principle of service-neutral operations can successfully solve the concrete problem of dynamic pinning. However we still have no sound evidence that it is useful for a much broader class of problems. Nevertheless, we strongly suspect it.