Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Here are some basic information of an old version of OS. First, the system only has 2 segments (segment 0 for code and a growing heap, segment 1 for a negatively-growing stack). The virtual address space size is only 128 bytes, and there is only 1K of physical memory. Therefore, code and heap together starts from 0 in the virtual address space and stack starts from 127 in the virtual address space. We now have one set of traces from an old program. In particular, the traces tell you which virtual address was accessed (in byte), and then whether or not the access was valid or not (i.e., a segmentation violation). If valid, the physical address is reported. Oddly enough, programs in this OS are allowed to keep running after memory-access violations, and thus we have a long trace that continues even after such a violation occurred. Here is the trace: VA: 108 Valid in SEG1: 1004 VA: 29 Valid in SEGO: 541 VA: 80 Segmentation violation (SEG1) VA: 30 Segmentation violation (SEGO) VA: 88 Valid in SEG1: 984 VA: 97 Valid in SEG1: 993 VA: 53 Segmentation violation (SEGO) VA: 33 Segmentation violation (SEGO) VA: 100 Valid in SEG1: 996 VA: 61 Segmentation violation (SEGO) VA: 12 Valid in SEGO: 524 VA: 5 Valid in SEGO: 517 VA: 47 Segmentation violation (SEGO) Now please use the trace to determine the base and bounds for each segment. The base and bounds can be an exact value or in a range (a format like 10<=register<20). (a) From the trace, what is the base register of segment 0? (b) From the trace, what is the bounds register of segment 0? (c) From the trace, what is the base register of segment 1? (d) From the trace, what is the bounds register of segment 1?

Here are some basic information of an old version of OS. First, the system only has 2 segments (segment 0 for code and a growing heap, segment 1 for a negatively-growing stack). The virtual address space size is only 128 bytes, and there is only 1K of physical memory. Therefore, code and heap together starts from 0 in the virtual address space and stack starts from 127 in the virtual address space. We now have one set of traces from an old program. In particular, the traces tell you which virtual address was accessed (in byte), and then whether or not the access was valid or not (i.e., a segmentation violation). If valid, the physical address is reported. Oddly enough, programs in this OS are allowed to keep running after memory-access violations, and thus we have a long trace that continues even after such a violation occurred. Here is the trace: VA: 108 Valid in SEG1: 1004 VA: 29 Valid in SEGO: 541 VA: 80 Segmentation violation (SEG1) VA: 30 Segmentation violation (SEGO) VA: 88 Valid in SEG1: 984 VA: 97 Valid in SEG1: 993 VA: 53 Segmentation violation (SEGO) VA: 33 Segmentation violation (SEGO) VA: 100 Valid in SEG1: 996 VA: 61 Segmentation violation (SEGO) VA: 12 Valid in SEGO: 524 VA: 5 Valid in SEGO: 517 VA: 47 Segmentation violation (SEGO) Now please use the trace to determine the base and bounds for each segment. The base and bounds can be an exact value or in a range (a format like 10<=register<20). (a) From the trace, what is the base register of segment 0? (b) From the trace, what is the bounds register of segment 0? (c) From the trace, what is the base register of segment 1? (d) From the trace, what is the bounds register of segment 1?

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
Please do fast
Here are some basic information of an old version of OS. First, the system only has 2 segments (segment O for code and a growing heap, segment 1 for a negatively-growing stack). The virtual address space size is only 128 bytes, and there is only 1K of physical memory. Therefore, code and heap together starts from 0 in the virtual address space and stack starts from 127 in the virtual address space. We now have one set of traces from an old program. In particular, the traces tell you which virtual address was accessed (in byte), and then whether or not the access was valid or not (i.e., a segmentation violation). If valid, the physical address is reported. Oddly enough, programs in this OS are allowed to keep running after memory-access violations, and thus we have a long trace that continues even after such a violation occurred. Here is the trace: VA: 108 Valid in SEG1: 1004 VA: 29 Valid in SEGO: 541 VA: 80 Segmentation violation (SEG1) VA: 30 Segmentation violation (SEGO) VA: 88 Valid in SEG1: 984 VA: 97 Valid in SEG1: 993 VA: 53 Segmentation violation (SEGO) VA: 33 Segmentation violation (SEGO) VA: 100 Valid in SEG1: 996 VA: 61 Segmentation violation (SEGO) VA: 12 Valid in SEGO: 524 VA: 5 Valid in SEGO: 517 VA: 47 Segmentation violation (SEGO) Now please use the trace to determine the base and bounds for each segment. The base and bounds can be an exact value or in a range (a format like 10<=register<20). (a) From the trace, what is the base register of segment 0? (b) From the trace, what is the bounds register of segment O? (c) From the trace, what is the base register of segment 1? (d) From the trace, what is the bounds register of segment 1?
Transcribed Image Text:Here are some basic information of an old version of OS. First, the system only has 2 segments (segment O for code and a growing heap, segment 1 for a negatively-growing stack). The virtual address space size is only 128 bytes, and there is only 1K of physical memory. Therefore, code and heap together starts from 0 in the virtual address space and stack starts from 127 in the virtual address space. We now have one set of traces from an old program. In particular, the traces tell you which virtual address was accessed (in byte), and then whether or not the access was valid or not (i.e., a segmentation violation). If valid, the physical address is reported. Oddly enough, programs in this OS are allowed to keep running after memory-access violations, and thus we have a long trace that continues even after such a violation occurred. Here is the trace: VA: 108 Valid in SEG1: 1004 VA: 29 Valid in SEGO: 541 VA: 80 Segmentation violation (SEG1) VA: 30 Segmentation violation (SEGO) VA: 88 Valid in SEG1: 984 VA: 97 Valid in SEG1: 993 VA: 53 Segmentation violation (SEGO) VA: 33 Segmentation violation (SEGO) VA: 100 Valid in SEG1: 996 VA: 61 Segmentation violation (SEGO) VA: 12 Valid in SEGO: 524 VA: 5 Valid in SEGO: 517 VA: 47 Segmentation violation (SEGO) Now please use the trace to determine the base and bounds for each segment. The base and bounds can be an exact value or in a range (a format like 10<=register<20). (a) From the trace, what is the base register of segment 0? (b) From the trace, what is the bounds register of segment O? (c) From the trace, what is the base register of segment 1? (d) From the trace, what is the bounds register of segment 1?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Input and Output Performance
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS