M. Milenkovic, Operating Systems: Concepts and Design, McGraw-Hill, New York, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Applications of Static Analysis to Concurrency Control and.. - Graham (1994) (Correct)
....to flush without any semantic information about their future usefulness. Since the cache manager cannot dynamically examine the executing code to determine which attribute(s) will be needed in the future, it resorts to using some heuristic cache replacement algorithm (such as FIFO, LFU, or LRU [Mil92] to make the decision. Whenever an attribute, which will subsequently be accessed again, is selected for replacement unnecessary I O overhead may be incurred. CHAPTER 6. RECOVERY USING STATIC INFORMATION 197 It is impractical to attempt to determine, at replacement time, which attribute should ....
....If, despite the use of static information, replacement is still required, conventional schemes (such as LRU) may still be applied. In this situation, choosing the least recently used attribute for replacement is reasonable and maintaining LRU ordering information is easily and efficiently done [Mil92] The early flushing of cached attributes results only in changes to the behaviour of the cache manager and does not affect the reference algorithms presented earlier. Extensions The idea of determining which attributes are no longer needed in the cache need not be applied solely to dirty ....
[Article contains additional citation context not shown here]
M. Milenkovic. Operating Systems Concepts and Design. McGraw Hill, second edition, 1992.
Speed is as Powerful as Clairvoyance - Kalyanasundaram, Pruhs (1995) (73 citations) (Correct)
....scheduling, that is, a job can always be restarted from the point of last execution. We assume that such context switches require no time. The problem of minimizing the average response time of the jobs is a well known and widely studied problem in operating system scheduling (see for example [7, 14]) We assume that the nonclairvoyant scheduler does not learn x i at time r i , and more generally, can not deduce x i until it has run J i to completion. The completion time c i of a job J i is the time at which J i has been allocated enough time to finish execution. Similarly, the response time ....
....j jUB j Gamma jU B Gamma UA j, we get (1 1 ffl )jU A j jUB j. The following theorem then follows by lemma 3.1. Theorem 3.1 The ffl weak competitive ratio of Balance with respect to average response time is at most 1 1 ffl . We now show that the commonly used algorithm Round Robin [7, 14] does not have a constant ffl weak competitive ratio for small ffl. Round Robin splits the processing time evenly among all unfinished jobs. Lemma 3.7 For the problem of minimizing the average response time, the ffl weak competitive ratio of Round Robin is Omega Gamma n 1 Gammaffl ) for 0 ....
M. Milenkovic, Operating Systems: Concepts and Designs, McGraw-Hill, 1992.
A Vector C and Fortran Compiler for the FPS T-Series.. - Stevenson, Ammons, al. (1992) (Correct)
No context found.
M. Milenkovic, Operating Systems: Concepts and Design, McGraw-Hill, New York, 1987.
Shared Memory Multimicroprocessor Operating System With An.. - Gregorio (1994) (Correct)
No context found.
- M. MILENKOVIC. "Operating Systems: Concepts and Design". New York, McGraw-Hill, 1987.
ECTS A.A. 98-99 Course name: Operating System - Sistemi Operativi Year (Correct)
No context found.
MILENKOVIC M., Operating Systems: Concepts and Design, McGraw-Hill, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC