Paper Info
Title
How to schedule unlimited memory pinning of untrusted processes or provisional ideas about service-neutrality
Abstract
About This PaperYou 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.
Year
DOI
Venue
1999
10.1109/HOTOS.1999.798393
Workshop on Hot Topics in Operating Systems
Keywords
Field
DocType
operating systems (computers),quality of service,scheduling,security of data,virtual storage,qos properties,dynamic pinning,service-neutral operations,service-neutrality,unlimited memory pinning,untrusted process scheduling,untrusted user processes,virtual pages,kernel,virtual memory,real time systems,concrete,database systems,demand paging,pinned memory,os
Kernel (linear algebra),Virtual memory,Scheduling (computing),Computer science,Quality of service,Suspect,Demand paging,Distributed computing,Neutrality,CUDA Pinned memory
Conference
ISBN
Citations 
PageRank 
0-7695-0237-7
5
0.88
References 
Authors
0
5
Name
Order
Citations
PageRank
Jochen Liedtke165385.61
volkmar uhlig250.88
K. Elphinstone3119065.76
T Jaeger42635255.67
Yoonho Park535035.57