COMP 3000 Midterm review 2010: Difference between revisions
| Line 27: | Line 27: | ||
==Essay 2 Questions== | ==Essay 2 Questions== | ||
# Why have bigger disks and larger memories inspired revised system call interfaces? | |||
==Essay 3 Questions== | ==Essay 3 Questions== | ||
Revision as of 17:09, 17 October 2010
Lab 1 Questions
- What are the key advantages of installing VM-specific device drivers in a guest OS?
- Typically, what does a guest OS's hard disk look like to the host OS?
- If a virtual machine is allocated 512 MB of RAM, how much physical RAM (as seen by the host OS) will be consumed?
Lab 2 Questions
- The execve system call gets three arguments: a full pathname to an executable, arguments, and environment variables. What are each of these for when "ls -a" is run?
- Why doesn't ldd report all the libraries that are listed in /proc/<PID>/maps?
- When a process becomes undead (a zombie), who can send it to its grave permanently? What must it do?
- UNIX files each have permissions for three classes of users. What are those classes? Extra credit: Does Windows have similar classes?
Lab 3 Questions
- A solution to the producer/consumer problem must take into account many conditions. What are three of them?
- Can the fork system call do everything the clone system call can do? Explain.
- What are three events that cause signals to be sent in UNIX?
- What system call do you use to send data over an already existing pipe?
Essay 1 Questions
- What is the key difference between an exokernel library OS and a guest OS running on a VM?
- Why can exokernels provide much better performance than a microkernel for certain workloads?
Essay 2 Questions
- Why have bigger disks and larger memories inspired revised system call interfaces?
Essay 3 Questions
- Which has better support for backwards compatibility, z/OS or Windows 7? Explain.
- How is a cluster like a mainframe? How is it different?
Essay 4 Questions
Essay 5 Questions
1. What is the main reason why modern schedluers, like the ULE and recent Linux schedulers, require a scheduling algorithm which operates in constant (O(1)) time? Explain?
2. Describe two ways that a scheduler can attempt to provide "fair" allocation of processor time to all threads in the system. Provide a description of the pros and cons of the methods you provide.
Essay 6 Questions
Essay 7 Questions
- What is a major obstacle to thread scalability? Explain.
Essay 8 Questions
- What new style of processing caused the development of the POSIX standards?