Virtual Memory Research Papers - Academia.edu (original) (raw)

viiList of Tables xivList of Figures xviChapter 1 Introduction 11.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.1.1 Why Study Virtual Memory? . . . . . . . . . . . .

Animation in multimedia is said to be beneficial to learning especially when the learning material demands visual movements. The emergence of 3- Dimensional animated visuals has extended the presentation mode in multimedia learning. It is... more

Animation in multimedia is said to be beneficial to learning especially when the learning material demands visual movements. The emergence of 3- Dimensional animated visuals has extended the presentation mode in multimedia learning. It is said that animated visuals in a 3-D representation not only possess motivational value that promotes positive attitudes toward instruction but also facilitate learning when the subject matter requires dynamic motion and 3-D visual cue. The field of computer science, especially in operating systems concepts uses an array of abstract concepts such as virtual memory, paging, fragmentations etc to describe and explain the underlying processes. Various studies together with our own observations strongly indicate that students often find these concepts difficult to learn, as they cannot easily be demonstrated. This study investigates the effects of animation on student understanding when studying a complex domain in computer science, that is, the subject...

The Minimum-weight Spanning Tree Problem (MSTP) is one of the most well known problems of combinatorial optimization. It deals with finding the spanning tree of an undirected, connected graph, such that the sum of the weights of the... more

The Minimum-weight Spanning Tree Problem (MSTP) is one of the most well known problems of combinatorial optimization. It deals with finding the spanning tree of an undirected, connected graph, such that the sum of the weights of the selected edges is minimum. MSTP has direct applications in the design of computer and communication networks, power lines, telephone networks, wiring connections, links in a transportation network, piping, etc. It also occurs as a sub problem in the solution of other problems like approximation algorithms for the travelling salesman problem, the matching problem and the capacitated MST problem. MSTP has wide range of applications in various fields of science and technology, and hence the importance of analyzing and improving the performance of the various algorithms used to find the Minimum Spanning Tree is of great significance. This paper compares the efficiency of modern MST algorithms like Least Cost MST with the classical algorithms such as Prim’s, Kruskal’s and Borukva’s algorithms.

This report briefly describes virtual storage, its structure, operation, and uses. Today's software is developed with virtual memory and its user-friendliness is strong and dynamic. The form of virtual memory is developed primarily based... more

This report briefly describes virtual storage, its structure, operation, and uses. Today's software is developed with virtual memory and its user-friendliness is strong and dynamic. The form of virtual memory is developed primarily based on a concept of demand pagination mechanism. The developed software requires a memory unit for performance concerning the application. When we prefer to run an additional method at an equal time as the work apparatus take responsibility for making sure that there is sufficient memory for each process. This report provides complete recordings about digital memory, its uses, when we want it and how it is used. All packets are stored in the eternal memory. When an application is made, it is initially loaded into the essential memory, i.e., RAM (random access memory) which is expensive, and which is why computers limited the amount of RAM. Now day Virtual memory is used in all modern functions because it helps us prolong the most important memory unless we increase the expensive measurement of RAM. We extend the basic memory using secondary memory. Virtual memory offers two benefits. First, it extends the bodily reminisce with the assist of secondary memory. Second, it offers us memory protection because each virtual plating is translated at a body address. Index Terms-Virtual memory, virtual memory implementation, memory protection, demand paging, swaps in and swap out demand page.

The Choices operating system architecture [3, 4, 15] uses class hierarchies and object-oriented programming to facilitate the construction of customized operating systems for shared memory and networked multiprocessors. The software is... more

The Choices operating system architecture [3, 4, 15] uses class hierarchies and object-oriented programming to facilitate the construction of customized operating systems for shared memory and networked multiprocessors. The software is being used in the Tapestry Parallel Computing Laboratory at the University of Illinois to study the performance of algorithms, mechanisms, and policies for parallel systems. This paper describes the architectural design and class hierarchy of the Choices memory and secondary storage management system. The mechanisms and policies of a virtual memory system implement a memory hierarchy that exploits the trade-offs between response times and storage capacities. In Choices , the notion of a memory hierarchy is represented by layers in which abstract classes define interfaces between and internal to the layers. Concrete subclasses implement new algorithms or data structures or specializations of existing ones. This paper describes the motivation for an obj...

Translation lookaside buffer (TLB) caches virtual to physical address translation information and is used in systems ranging from embedded devices to high-end servers. Since TLB is accessed very frequently and a TLB miss is extremely... more

Translation lookaside buffer (TLB) caches virtual to physical address translation information and is used in systems ranging from embedded devices to high-end servers. Since TLB is accessed very frequently and a TLB miss is extremely costly, prudent management of TLB is important for improving performance and energy efficiency of processors. In this paper, we present a survey of techniques for architecting and managing TLBs. We characterize the techniques across several dimensions to highlight their similarities and distinctions. We believe that this paper will be useful for chip designers, computer architects and system engineers.

Volatile memory dump and its analysis is an essential part of digital forensics. Among a number of various software and hardware approaches for memory dumping there are authors who point out that some of these approaches are not resilient... more

Volatile memory dump and its analysis is an essential part of digital forensics. Among a number of various software and hardware approaches for memory dumping there are authors who point out that some of these approaches are not resilient to various anti-forensic techniques, and others that require a reboot or are highly platform dependent. New resilient tools have certain disadvantages such as low speed or vulnerability to rootkits which directly manipulate kernel structures e.g. page tables. A new memory forensic system – Malware Analysis System for Hidden Knotty Anomalies (MASHKA) is described in this paper. It is resilient to popular anti-forensic techniques. The system can be used for doing a wide range of memory forensics tasks. This paper describes how to apply the system for research and detection of kernel mode rootkits and also presents analysis of the most popular anti-rootkit tools.

Tarantula is an aggressive floating point machine targeted at technical, scientific and bioinformatics workloads, originally planned as a follow-on candidate to the EV8 processor [6, 5]. Tarantula adds to the EV8 core a vector unit... more

Tarantula is an aggressive floating point machine targeted at technical, scientific and bioinformatics workloads, originally planned as a follow-on candidate to the EV8 processor [6, 5]. Tarantula adds to the EV8 core a vector unit capable of 32 double-precision flops per cycle. The vector unit fetches data directly from a 16 MByte second level cache with a peak bandwidth of sixty four 64-bit values per cycle. The whole chip is backed by a memory controller capable of delivering over 64 GBytes/s of raw band- width. Tarantula extends the Alpha ISA with new vector instructions that operate on new architectural state. Salient features of the architecture and implementation are: (1) it fully integrates into a virtual-memory cache-coherent system without changes to its coherency protocol, (2) provides high bandwidth for non-unit stride memory accesses, (3) supports gather/scatter instructions efficiently, (4) fully integrates with the EV8 core with a narrow, streamlined interface, rather...

A tandem queueing system with blocking due to finite waiting room is considered. Maximum throughput is studied by an approximation for several cases. The service time can depend on the number of customers; intermediate arrivals can also... more

A tandem queueing system with blocking due to finite waiting room is considered. Maximum throughput is studied by an approximation for several cases. The service time can depend on the number of customers; intermediate arrivals can also be allowed. Some special models with two stations in sequence and blocking are examined. These models are used for the performance evaluation of