1 / 14

Homework Assignment #1

Homework Assignment #1. J. H. Wang Oct. 11, 2013. Homework #1. Chap.1: 1.8 Chap.2: 2.10 Chap.3: 3.1, 3.14*, 3.15* Chap.4: 4.2, 4.19* (*: optional programming exercises) Optional bonus: End-of-chapter programming projects for Chaps. 2-4 Due: two weeks ( Nov. 1, 2013 ). Chap.1

ike
Télécharger la présentation

Homework Assignment #1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Homework Assignment #1 J. H. Wang Oct. 11, 2013

  2. Homework #1 • Chap.1: 1.8 • Chap.2: 2.10 • Chap.3: 3.1, 3.14*, 3.15* • Chap.4: 4.2, 4.19* • (*: optional programming exercises) • Optional bonus: End-of-chapter programming projects for Chaps. 2-4 • Due: two weeks (Nov. 1, 2013)

  3. Chap.1 • 1.8: What is the purpose of interrupts? How does an interrupt differ from a trap? Can traps be generated intentionally by a user program? If so, for what purpose?

  4. Chap. 2 • 2.10: What is the main advantage of the microkernel approach to system design? How do user programs and system services interact in a microkernel architecture? What are the disadvantages of using the microkernel approach?

  5. Chap. 3 • 3.1: Describe the differences among short-term, medium-term, and long-term scheduling.

  6. 3.14*: The Collatz conjecture concerns what happens when we take any positive integer n and apply the following algorithm:The conjecture states that when this algorithm is continually applied, all positive integers will eventually reach 1. For example, if n=35, the sequence is35, 106, 53, 160, 80, 40, 20, 10, 5, 16, 8, 4, 2, 1(…to be continued…)

  7. Write a C program using the fork() system call that generates this sequence in the child process. The starting number will be provided from the command line. For example, if 8 is passed as a parameter on the command line, the child process will output 8, 4, 2, 1. Because the parent and child processes have their own copies of the data, it will be necessary for the child to output the sequence. Have the parent invoke the wait() call to wait for the child process to complete before exiting the program. Perform necessary error checking to ensure that a positive integer is passed on the command line.

  8. 3.15*: In Exercise 3.14, the child process must output the sequence of numbers generated from the algorithm specified by the Collatz conjecture because the parent and child have their own copies of the data. Another approach to designing this program is to establish a shared-memory object between the parent and child processes. This technique allows the child to write the contents of the sequence to the shared-memory object. The parent can then output the sequence when the child completes. Because the memory is shared, any changes the child makes will be reflected in the parent process as well.(… to be continued…)

  9. This program will be structured using POSIX shared memory as described in Section 3.5.1. The parent process will progress through the following steps:(a) Establish the shared-memory object (shm_open(), ftruncate(), and mmap()).(b) Create the child process and wait for it to terminate.(c) Output the contents of shared memory.(d) Remove the shared-memory object.One area of concern with cooperating processes involves synchronization issues. In this exercise, the parent and child processes must be coordinated so that the parent does not output the sequence until the child finishes execution. These two processes will be synchronized using the wait() system call: the parent process will invoke wait(), which will suspend it until the child process exits.

  10. Chap. 4 • 4.2: Under what circumstances does a multithreaded solution using multiple kernel threads provide better performance than a single-threaded solution on a single-processor system?

  11. 4.19*: Write a multithreaded program that outputs prime numbers. This program should work as follows: The user will run the program and will enter a number on the command line. The program will then create a separate thread that outputs all the prime numbers less than or equal to the number entered by the user.

  12. Homework Submission • For hand-written exercises, please hand in your homework on papers in class • For programming exercises, please upload your code to the program submission site as follows: • URL: http://mslin.ee.ntut.edu.tw/ • User account/Password: (your student ID) • Please change your password as soon as possible • Program uploading: a compressed file (in .zip format) including source codes and a compilation instruction if your program needs special environment or tool to compile or run • Please clearly name your program files using your ID • Note: the uploaded file size must be less than 5MB

  13. More on Optional End-of-Chapter Projects • Programming Project for Chap. 2: Linux Kernel Modules • Creating kernel modules • Kernel data structures • Programming Project for Chap. 3: UNIX Shell and Tasks • UNIX shell and history feature • Linux kernel module for listing tasks • Programming Project for Chap. 4: • 1. Sudoku solution validator • Passing parameters to each thread • Returning results to the parent thread • 2. Multithreaded sorting application

  14. Thanks for Your Attention!

More Related