3a) How many bytes of virtual memory are necessary to hold the entire array? By default , each entry in a array requires a Byte. Total virtual memory required = 256 256*8 B = 21*2 = 215 B = 2° KB = 32 KB 3b) How many pages are necessary to hold the entire array? Number of pages to hold the array = Virtual memory size / Page size. Putting the values in the above formula , the pages = 32 KB / 8 KB = 4 pages. %3D
3a) How many bytes of virtual memory are necessary to hold the entire array? By default , each entry in a array requires a Byte. Total virtual memory required = 256 256*8 B = 21*2 = 215 B = 2° KB = 32 KB 3b) How many pages are necessary to hold the entire array? Number of pages to hold the array = Virtual memory size / Page size. Putting the values in the above formula , the pages = 32 KB / 8 KB = 4 pages. %3D
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
I’m stuck on the last 2 problems but I have already done the frist three parts
I've been having a hard time with these question will you be able to help me
Transcribed Image Text:3c) Assuming an int requires 4 bytes, which elements of the array will start in physical memory?
• Considering the int required 4 B to store the value.
he element of the array which start in the physical location = Physical memory / Size of int.
Putting the values in the above formula , the element of the array which start in the physical
location = 1 MB / 4 B= 262144.
3d) Just considering virtual memory access time, how long will it take for function1() to execute?
3e) Just considering virtual memory access time, how long will it take for function2() to execute?
Remember to account for both read and write activity.
![3. Virtual memory
Study the two functions given below. Both use the same array declared as: static int data[256*256*8];
void function1()
{
int i;
int j;
for (i = 0; i< 32; i++)
for (j = 0; j< 256; j++)
data) = i;
}
void function2(0
{
int i;
int j;
for (i = 0; i< 32; i++)
for (j = 0; j< 256; j++)
dataj*2048] = i;
Assume the following behaviors in a virtual memory system. Reading or writing physical memory requires
50 nanoseconds. Reading or writing disk writing 10 milliseconds. Page size is 8 kilobytes. Presume that
the program has 1 megabyte of physical memory available. You may consider everything except the array
access itself to take no time. You should also assume that the first 1 megabyte of the array is in physical
memory initially. You may ignore any memory used by the program or stack to execute these functions.
Using this information, answer the following questions. In each case, show the work you use to calculate
the answer. Give your answer in a reasonable unit.
3a) How many bytes of virtual memory are necessary to hold the entire array?
By default , each entry in a array requires a Byte.
• Total virtual memory required = 256*256*8 B = 212*2 = 215 B = 25 KB = 32 KB
3b) How many pages are necessary to hold the entire array?
Number of pages to hold the array = Virtual memory size / Page size.
• Putting the values in the above formula , the pages = 32 KB / 8 KB = 4 pages.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff57a49e4-5800-46fe-bd88-6c0f4e286976%2F3ff51b3d-0958-4bef-bacf-49f56736b2b0%2Fxmnpizm_processed.jpeg&w=3840&q=75)
Transcribed Image Text:3. Virtual memory
Study the two functions given below. Both use the same array declared as: static int data[256*256*8];
void function1()
{
int i;
int j;
for (i = 0; i< 32; i++)
for (j = 0; j< 256; j++)
data) = i;
}
void function2(0
{
int i;
int j;
for (i = 0; i< 32; i++)
for (j = 0; j< 256; j++)
dataj*2048] = i;
Assume the following behaviors in a virtual memory system. Reading or writing physical memory requires
50 nanoseconds. Reading or writing disk writing 10 milliseconds. Page size is 8 kilobytes. Presume that
the program has 1 megabyte of physical memory available. You may consider everything except the array
access itself to take no time. You should also assume that the first 1 megabyte of the array is in physical
memory initially. You may ignore any memory used by the program or stack to execute these functions.
Using this information, answer the following questions. In each case, show the work you use to calculate
the answer. Give your answer in a reasonable unit.
3a) How many bytes of virtual memory are necessary to hold the entire array?
By default , each entry in a array requires a Byte.
• Total virtual memory required = 256*256*8 B = 212*2 = 215 B = 25 KB = 32 KB
3b) How many pages are necessary to hold the entire array?
Number of pages to hold the array = Virtual memory size / Page size.
• Putting the values in the above formula , the pages = 32 KB / 8 KB = 4 pages.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY