The minimization of page faults in a demand paging environment where program behavior is described by the least recently used (LRU) stack model is investigated. Past work on this topic considered a specific type of s...
详细信息
The minimization of page faults in a demand paging environment where program behavior is described by the least recently used (LRU) stack model is investigated. Past work on this topic considered a specific type of stack probability distribution. Since practical situations exist that do not satisfy this assumption, the analysis is extended to arbitrary distributions. The minimization is stated as an optimization problem under constraints; a method to obtain a class of optimal solution is presented; and a fixed-space replacement algorithm to implement these solutions is proposed. The parameters of this replacement algorithm can be adjusted to adapt to specific stack probability distributions and to the number of allocated pages in memory. A necessary and sufficient condition for the optimality of the LRU algorithm is also determined.
The techniques of paged virtual memory, commonly employed only in large operating systems, can be provided at the software level by a small collection of primitive procedures. This paper defines the primitives and the...
详细信息
The techniques of paged virtual memory, commonly employed only in large operating systems, can be provided at the software level by a small collection of primitive procedures. This paper defines the primitives and their implementation. The techniques of applying software virtual memory are also discussed, and these techniques are useful for compilers, database systems, and other applications in which large amounts of random access memory are required. Other benefits of using software virtual memory are transportability, modularity in program design, implementation on mini and microcomputers, and improved speed performance over alternative approaches.
One of the primary motivations for implementing virtual memory is its ability to automatically manage a hierarchy of storage systems with different characteristics. The composite system behaves as if it were a single-...
详细信息
This research paper provides a novel simulation of some basic memory management techniques using the C programming language. The paper evaluates the above techniques as four distinct modules namely process scheduling ...
详细信息
ISBN:
(纸本)9789380544199
This research paper provides a novel simulation of some basic memory management techniques using the C programming language. The paper evaluates the above techniques as four distinct modules namely process scheduling algorithms, deadlock handling, paging implementation, page replacement algorithms and client-server implementation. The first module process scheduling implements and compares four algorithms namely- FCFS, SJF, Priority based and Round Robin. The second module deadlock handling includes algorithm for deadlock detection and avoidance. The third module paging implements basic paging technique followed by MVT and MFT. The fourth module being page replacement algorithms includes implementation and comparison of two algorithms- LRU and Optimal pagereplacement technique. Lastly we delve to the client server implementation of process scheduling which in future can he implemented as a platform independent job scheduling software for an enterprise.
Reducing latency for accessing web objects is a major challenge in Proxy Server and various techniques such as web caching and Web pre-fetching is used for it. In this paper we have integrated the approach of web cach...
详细信息
ISBN:
(纸本)9780769548722;9781467331494
Reducing latency for accessing web objects is a major challenge in Proxy Server and various techniques such as web caching and Web pre-fetching is used for it. In this paper we have integrated the approach of web caching and pre-fetching using sequential data mining techniques to enhance the proxy server's performance. The web access logs collected at squid proxy servers, can be used derive interesting information regarding user's web navigation pattern which can be utilized in improving the performance of proxy server by integrating the approach of web caching and pre-fetching using sequential data mining techniques. The work presented here uses Pre-order linked position coded Web Access pattern (PLWAP) Algorithm for finding frequent accessed web objects of each user by analyzing the browsing history from the access log files and then compares the results over page replacement algorithms such as, Least Recently Used (LRU) and Least Frequently Used (LFU), first without using concept of pre-fetching and then by using pre-fetching. The experimental results show that for each data set the pre-fetching improves the performance of proxy server.
Using the Independent Reference assumption to model program behavior, the performance of different buffer organizations (Fully Associative, Direct Mapping, Set Associative. and Sector) are analyzed (1) The expressions...
详细信息
暂无评论