Memory pages, Operating System

Applications allocate memory in terms of the number of bytes that they need, but this level of granularity is too ?ne-grained for the operating system to manage the system memory in this way. Instead, the OS manages the memory in groups of bytes called pages. Pages are typically of 4kb or 8kb. Suppose we decide to use 4kb pages; in a 32-bit machine, it is possible to address at most 232 different addresses; if we divide that maximum amount of memory by the size of the page, we see that there can be at most 232 / 212 = 220 4kb pages.

Posted Date: 3/12/2013 5:34:21 AM | Location : United States

Related Discussions:- Memory pages, Assignment Help, Ask Question on Memory pages, Get Answer, Expert's Help, Memory pages Discussions

Write discussion on Memory pages
Your posts are moderated
Related Questions
Explain the Thread Local Storage (TLS)    Windows NT provides unique functions for per-thread data management. Thread local storage (TLS) is a concept defined in NT so develope

draw a state diagram showing the transissions of a process from creation to termination

Q. Illustrate the function of Loader? A loader is a routine which loads an object program and prepares it for execution. There are many loading schemes: relocating, absolute an

explain how response time are reduced by allowing time sharing on top of multiprogramming

What are the different thread levels? There are two broad type of thread implementation: User-Level Threads -- Thread Libraries. Kernel-level Threads -- System Calls.

Q. What kinds of networking does Windows XP support? How does Windows XP execute transport protocols? Describe two networking protocols. Answer: Support is offer for bo

why we say " OS is a resource allocator" and “OS is a control program"?

Two Level Directory This kind of structure overcomes the problems of assigning unique names to the files. Thus there need not be any confusion among users. In this kind of s

example of first fit best fit and worst fit

4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p