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

Jochen Liedtke, Volkmar Uhlig, Kevin Elphinstone, Trent Jaeger, Yoonho Park

Research output: Contribution to conferencePaperpeer-review

4 Scopus citations

Abstract

You can read it as a paper that treats a concrete problem motivated in Section 1: 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.

Original languageEnglish (US)
Pages153-159
Number of pages7
StatePublished - 1999
EventProceedings of the 1999 7th Workshop on Hot Topics in Operating Systems (HotOS-VII) - Rio Rico, AZ, USA
Duration: Mar 29 1999Mar 30 1999

Conference

ConferenceProceedings of the 1999 7th Workshop on Hot Topics in Operating Systems (HotOS-VII)
CityRio Rico, AZ, USA
Period3/29/993/30/99

All Science Journal Classification (ASJC) codes

  • General Computer Science

Fingerprint

Dive into the research topics of 'How to schedule unlimited memory pinning of untrusted processes or provisional ideas about service-neutrality'. Together they form a unique fingerprint.

Cite this