Carr, R., Virtual Memory Management, Ann Arbor, MI: UMI Research Press, 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....server. Since a server process may be tied up with a persistent connection even after the request is served, the CPU(s) can be under utilized. One way to alleviate this problem is to increase the number of server processes. However, too many processes can cause thrashing in virtual memory systems [16] thus degrading server performance considerably. In practice, an operating system specific limit is imposed on the number of concurrent server processes. This limit is often the bottleneck in servers implementing HTTP 1.1. Hence, while new connections suffer large queuing delays, requests arriving ....

Carr, R., Virtual Memory Management, Ann Arbor, MI: UMI Research Press, 1984.

....and estimation of worst case resource requirements can result in an extremely expensive and underutilized system. As a cost effective approach to achieve performance guarantees in unpredictable environments, several adaptive scheduling algorithms have been recently developed (e.g. 5] 8] 9][24][44] 46] 55] While early research on real time scheduling was concerned with guaranteeing complete avoidance of undesirable effects such as overload and deadline misses, adaptive real time systems are designed to handle such effects dynamically. There remain many open research questions in ....

....This type of feedback control is based on intuitive solutions rather than systematic control derivation to achieve performance guarantees. In recent years, QoS adaptation architectures and algorithms have been developed to support applications such as communication subsystems [8] multimedia [19][24], distributed visual tracking [46] and operating systems [55] 61] 63] 69] 78] Some of these techniques [55] 61] 63] include optimization algorithms to optimize the value in QoS adaptation. However, their optimization algorithms assume that the resource requirement of every QoS level is a priori ....

[Article contains additional citation context not shown here]

Carr, R., Virtual Memory Management, Ann Arbor, MI: UMI Research Press, 1984.

....Examples of these policies include FBR [RD90] GLRU [FLW78] SEQ [GC97] and our own EELRU [SKW99] Although these policies differ from LRU, their general behavior is similar to it, as the majority of references are to pages that all of these policies keep in an LRU queue. Policies like clock [Car84] and segmented queue (segq, also known as two level replacement or hybrid FIFO LRU ) BF83] represent the category LRU approximations. These two policies are the most used replacement policies in real systems. They make their eviction selections based on recency, although their heuristics to ....

Richard W. Carr. Virtual Memory Management. UMI Research Press, Ann Arbor, Mich., 1984.

No context found.

Carr, R., Virtual Memory Management, Ann Arbor, MI: UMI Research Press, 1984.

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