|
|
|
Modern Operating Systems by Herbert Bos and Andrew S. Tanenb...
Modern_Operating_Systems_by_Herbert_Bos_and_Andrew_S._Tanenbaum_4th_Ed.pdf
Showing 884 out of 1137
Modern Operating Systems by Herbert Bos and Andrew...
Modern_Operating_Systems_by_Herbert_Bos_and_Andrew_S._Tanenbaum_4th_Ed.pdf-M ODERN O PERATING S YSTEMS
Modern Operating Systems by Herbert...
Modern_Operating_Systems_by_Herbert_Bos_and_Andrew_S._Tanenbaum_4th_Ed.pdf-M ODERN O PERATING S YSTEMS
Page 884
CHAP. 10
PROBLEMS
853
28.
In Linux, the data and stack segments are paged and swapped to a scratch copy kept on
a special paging disk or partition, but the text segment uses the executable binary file
instead. Why?
29.
Describe a way to use
mmap
and signals to construct an interprocess-communication
mechanism.
30.
A file is mapped in using the following
mmap
system call:
mmap(65536, 32768, READ, FLAGS, fd, 0)
Pages are 8 KB.
Which byte in the file is accessed by reading a byte at memory ad-
dress 72,000?
31.
After the system call of the previous problem has been executed, the call
munmap(65536, 8192)
is carried out. Does it succeed?
If so, which bytes of the file remain mapped?
If not,
why does it fail?
32.
Can a page fault ever lead to the faulting process being terminated?
If so, give an ex-
ample. If not, why not?
33.
Is it possible that with the buddy system of memory management it ever occurs that
two adjacent blocks of free memory of the same size coexist without being merged into
one block?
If so, explain how. If not, show that it is impossible.
34.
It is stated in the text that a paging partition will perform better than a paging file. Why
is this so?
35.
Give two examples of the advantages of relative path names over absolute ones.
36.
The following locking calls are made by a collection of processes. For each call, tell
what happens.
If a process fails to get a lock, it blocks.
(a)
A
wants a shared lock on bytes 0 through 10.
(b)
B
wants an exclusive lock on bytes 20 through 30.
(c)
C
wants a shared lock on bytes 8 through 40.
(d)
A
wants a shared lock on bytes 25 through 35.
(e)
B
wants an exclusive lock on byte 8.
37.
Consider the locked file of Fig. 10-26(c). Suppose that a process tries to lock bytes 10
and 11 and blocks. Then, before
C
releases its lock, yet another process tries to lock
bytes 10 and 11, and also blocks. What kinds of problems are introduced into the
semantics by this situation?
Propose and defend two solutions.
38.
Explain under what situations a process may request a shared lock or an exclusive lock.
What problem may a process requesting an exclusive lock suffer from?
39.
If a Linux file has protection mode 755 (octal), what can the owner, the owner’s group,
and everyone else do to the file?
40.
Some tape drives have numbered blocks and the ability to overwrite a particular block
in place without disturbing the blocks in front of or behind it. Could such a device hold
a mounted Linux file system?
Ace your assessments! Get Better Grades
Browse thousands of Study Materials & Solutions from your Favorite Schools
Concordia University
Concordia_University
School:
Operating_Systems
Course:
Great resource for chem class. Had all the past labs and assignments
Leland P.
Santa Clara University
Introducing Study Plan
Using AI Tools to Help you understand and remember your course concepts better and faster than any other resource.
Find the best videos to learn every concept in that course from Youtube and Tiktok without searching.
Save All Relavent Videos & Materials and access anytime and anywhere
Prepare Smart and Guarantee better grades
Know more
Students also viewed documents
lab 18.docx
lab_18.docx
Course
Course
3
Module5QuizSTA2023.d...
Module5QuizSTA2023.docx.docx
Course
Course
10
Week 7 Test Math302....
Week_7_Test_Math302.docx.docx
Course
Course
30
Chapter 1 Assigment ...
Chapter_1_Assigment_Questions.docx.docx
Course
Course
5
Week 4 tests.docx.do...
Week_4_tests.docx.docx
Course
Course
23
Week 6 tests.docx.do...
Week_6_tests.docx.docx
Course
Course
106
