The memory-management tag has no wiki summary.
-2
votes
1answer
43 views
Calculating wasted space [closed]
How would wasted space be calculated?
Six equally sized data blocks, each containing 209 bytes, are to be recorded on to hard disk. Each sector on the hard disk has 512 bytes storage capacity. With ...
0
votes
1answer
58 views
How to compute the effective access time in Virtual Memory system with demand paging?
Given the following exercise from Operating System Concepts Essentials 1st Edition, Chapter 8 Virtual Memory:
An operating system supports a paged virtual memory, using a central
processor with ...
1
vote
2answers
59 views
Given the logical address, how to extract the page number?
I am studying Computer Systems. I have th following question and its answer:
Given the logical address 0xAEF9 (in hexadecimal) with a page size of
256 bytes, what is the page number?
...
1
vote
1answer
43 views
What is the difference between a 'page' or memory and a 'frame' of memory?
WP has a adequate discussion of paging, which I think I understand.. However I am confused by the articles repeated use of the term Page Frame.
I thought frames and pages were different things. ...
-1
votes
0answers
35 views
What is meant by program reallocation? [closed]
What is "program reallocation" in memory management and why might it occur?
0
votes
1answer
29 views
How Does Dynamic Heap Storage Have Something to Do with Heap?
There are three typical ways to allocate memory for programs: static, stack and dynamic heap. However, when I look at the implementation of dynamic heap memory allocation from wikipedia , what I found ...
0
votes
1answer
340 views
How to work out physical address corresponding to logical address?
I am looking to calculate the physical address corresponding to a logical address in a paging memory management scheme. I just want to make sure I am getting the calculation right, as I fear I could ...
0
votes
0answers
22 views
Struct Memory Management [closed]
I'm currently working on an implementation to solve a wooden puzzle in which blocks of varying sizes can be slid around to create a "winning" configuration. I'm using breadth first search as each ...
2
votes
2answers
67 views
Handing untrusted string input in print function and avoid buffer overflow
I stumbled upon the MSDN Best Practices for Code Review. Here is the link: http://msdn.microsoft.com/en-us/library/bb871031.aspx
Under the section of "Untrusted Inputs", i found following which I ...
2
votes
1answer
73 views
Processes and Segmentation
The following problem was on my final and in Gate 2006, but I don't understand how to solve it:
Different methods of memory management have different overheads:
...
1
vote
2answers
275 views
How does increasing the page size affect the number of page faults?
If we let the physical memory size remain constant,
What effect does the size of the page have on the number of frames?
What effect does the number of frames have on the number of page faults?
...
3
votes
1answer
127 views
Program compilation and execution flow
I was studying operating system concepts from Silberschatz, Galvin and Gagne's book (sixth edition) and I have some questions about the flow of execution of a program. A figure explains the processing ...
5
votes
1answer
93 views
Are compilers able to detect alternating accesses to arrays and interleave them in memory?
Is it possible to design a compiler which optimizes a loop in which arrays are accessed in alternate fashion? For example like this:
...
8
votes
3answers
227 views
Applying algorithms on large data
Is there any book or tutorial that teaches us how to efficiently apply the common algorithms (sorting, searching, etc.) on large data (i.e. data that cannot be fully loaded into main memory) and how ...
1
vote
0answers
117 views
Queue that can sort by multiple priorities?
I have a high interest in priority-queues (E.g., see my answers on: Does there exist a priority queue with $O(1)$ extracts?), and was wondering if there is a priority-queue or similar data-structure ...
7
votes
1answer
947 views
Swap space management during pure demand paging
The following is a doubt that I came across while doing a OS home assignment - however, it seems more concept-based than a straightforward coding question, so IMHO I don't think the homework tag is ...
2
votes
2answers
161 views
Equality testing of arrays and integers in a procedural language
In terms of references and their implementation on the heap and the stack, how is
equality testing for arrays different from that for integers?
This is to do with Java programming, if you have a ...
