Operating System Concepts

By Abraham Silberschatz, P. B. Galvin, G. Gagne. 2007

2,944 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/2a6d35551a79f1da37fb515dbf80fe4a9da04209

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks (2001, background): “However, note that here the gateway election does not have as rigorous constraints as those in the traditional leader-election problem [23].”
A unifying link abstraction for wireless sensor networks (2005, background): “The idea of batching for performance improvements is not new; processors cache memory and hard drives cache recently used pages [64].”
Size-based scheduling to improve web performance (2003, background): “Although it is well-known from queueing theory that SRPT scheduling minimizes queueing time, [36], applications have shied away from using this policy for fear that SRPT “starves” big requests [10, 38, 39, 37].”
Program synthesis by sketching (2008, methodology): “With this sketch and this correctness conditions, the synthesizer was able to produce a correct implementation of the protocol; a minor variant over the standard solution presented in textbooks [58].”
Streaming video over the Internet: approaches and directions (2001, unknown): “c) DC-SCAN employs a circular SCAN [56] service order”
Yet another MicroArchitectural Attack:: exploiting I-Cache (2007, methodology): “Thus, this design technique enables the simultaneous execution of more than one process on the same physical processor core by taking advantage of thread-level parallelism, as if there were more than one processor [35, 37].”
Analysis of SRPT scheduling: investigating unfairness (2001, background): “Unfairness results: It has often been cited that SRPT may lead to starvation of large jobs [1, 28, 29, 26].”
Less Is More: Trading a Little Bandwidth for Ultra-Low Latency in the Data Center (2012, methodology): “This is inspired by classic work on the UNIX multi-level feedback queue that attempts to classify interactive versus bulk jobs in the operating system [46].”
Speed is as powerful as clairvoyance (2000, methodology): “We show that if Round Robin is equipped with a (1 + E) speed processor, 0 E 1, then there are instances where the average response time for Round Robin is n(n1-E) times optimal.”