It introduces computer systems from a programmer's perspective, rather than a system implementer's perspective, which prepares students for more advanced topics that discuss the internals of a computer system (e.g., operating systems or computer architecture).
Course Description CPS 356 (3 hours) is a course that introduces the theoretical and practical issues underlying an operating system's structure and operation. Topics include process and thread creation and management, scheduling, concurrent, multi-threaded programming and synchronization, deadlock, memory management, virtual memory, and computer security.
Concepts are demonstrated using the C, Go, and Elixir programming languages in a Linux environment. This course assumes no prior experience with Linux, C, Go, Lua, or Elixir. Course Details Pre-requisite: CPS 250 (Introduction to Computer Organization) or ECE 314 (Fundamentals of Computer Architecture) & CPS 350 (Data Structures & Algorithms). Meeting times: Tue Thu 5:05pm-6:20pm, Miriam Hall Room 203. Instructor:, e-mail id: sperugini1, tel: 229-4079, office: AN 145 OHs: M 3:00pm-5:00pm; W 1:00pm-3:00pm; Thu 3:30pm-4:30pm (only when classes are in session); & by appointment. Graduate Assistant and Student Helper: Matthew Weiler (e-mail id: weilerm3) and Patrick Marsee (e-mail id: marseep1); Miriam Hall 16 OHs: M 1:15pm-3:20pm; M 5:00pm-8:30pm (in Anderson Hall 131); T 11:00am-1:45pm; W 1:15pm-3:20pm; Th 11:00am-1:45pm; (only when class is in session); & by appointment. Required Textbooks LP by S.
Draft ( Available as a Resource in ). Draft ( Available as a Resource in; only Chapter 14: Concurrency and Synchronization needed for this course.). SCMSW by P. Pragmatic Programmers, Dallas, TX, 2014. ISBN-13:978-1-937785-65-9 (textbook contains links to the source code of all programs in the text). An eBook of SCMSW is available free to all UD students in the library's eContent collection. To access it conduct a search for the title in the library's catalog at.
Steps to access SCMSW off-campus:. Go to. Login using your standard UD credentials. Click on the link labeled: EBSCO Ebook Collection (formerly NetLibrary). This link will will take you to a page were you can perform a search.
Search for 'Seven concurrency models in seven weeks: When threads unravel' Click on 'eBook Full Text'. Note that there is a limit on how many people can view the book and once someone checks it out, no one else can use it. Also, if you incorrectly break your session (closing the page), the book remains checked out for a period of time and you cannot use the book in until the session ends.
SMLSW by B.A. Pragmatic Programmers, Dallas, TX, 2014. ISBN-13:978-1-941222-15-7 (textbook contains links to the source code of all programs in the text). An eBook of SMLSW is available free to all UD students in the library's eContent collection.
To access it conduct a search for the title in the library's catalog at. Steps to access SMLSW off-campus: follow same steps above for accessing SCMSW (with the title of this book). Recommended Books CARM C: A Reference Manual (2nd ed.) by Harbison, S.P.
& Steele Jr., G.L. Englewood Cliffs, NJ: Prentice Hall. ISBN: 0-13-326232-4. This book is on reserve at the Roesch library. CPL The C Programming Language (2nd ed.) by Kernighan, B.W. & Ritchie, D.M. Upper Saddle River, NJ: Prentice Hall.
ISBN: 0-13-110362-8. This book is on reserve at the Roesch library. OSCJ8 Operating System Concepts with Java (8th ed.) by Silberschatz, A., Galvin, P.B., & Gagne, G. John Wiley & Sons, Inc.
ISBN: 978-0-470-50949-4. This book is on reserve at the Roesch library. PG by Summerfield, M.
Boston, MA: Addison-Wesley. ISBN: 637 (textbook contains links to the source code of all programs in the text).
An eBook of PG is available free to all UD students in the library's eContent collection. To access it conduct a search for the title in the library's catalog at. Steps to access PG off-campus: follow same steps above for accessing SCMSW (with the title of this book). TLCL by Schotts, W. No Starch Press. UPE The UNIX Programming Environment (2nd ed.) by Kernighan, B.W.
Upper Saddle River, NJ: Prentice Hall. ISBN: 0-13-937681-X. This book is on reserve at the Roesch library.
USP (2nd ed.) by Robbins, K.A. & Robbins, S.
Upper Saddle River, NJ: Prentice Hall. ISBN: 0-13-042411-0. This book is on reserve at the Roesch library. An eBook of USP is available free to all UD students in the library's eContent collection. To access it conduct a search for the title in the library's catalog at. Course Outline Course outline, required reading assignments, lecture notes, & homeworks & projects:. Introduction to operating systems & the UNIX/Linux & C programming environment (OSCJ8 Ch 1-2; LP Ch 1-5; USP Ch 1-2, 4).
to operating systems (review of computer organization, ): Aug 23 28. the (, ): Aug 23. (manipulation & management): self-study. : Aug 23 28 30 Sep 4 6. (static vs. Dynamic linking, macros, conditional compilation, error handling, &;, ): Sep 11 13. Processes & threads (OSCJ8 Ch 3-4; LP Ch 6-7; USP Ch 2-6).
(identification; getpid, creation;, & termination): Aug 23 28 30 Sep 4 6 11 13.: Aug 28 30 Sep 4. (shell) (through signals) &: Oct.: Sep 13 18.
: Sep 11 13 18 20. process manipulation : Sep 13. process manipulation ( & ): Sep 20 25. & (variables, configuration, customization; ): Sep 20. ( open & close, & read & write): Oct.
Homework #2 Assigned: September 6 Due: September 13, 5:05pm Total points: 30 points. (20 points) LP Programming Exercise 4.31.34. (Use filename /home/ /homeworks/hw2/removesubsargs.c). (10 points) LP Programming Exercise 7.3.19. (Use filename /home/ /homeworks/hw2/alternate.c). (10 points) Setup your Raspberry Pi according to the instructions. Then, demo the following to one of the TAs in office hours by or before Thursday September 13:.
scp'ing a file from your Raspberry Pi to your SUSE account without using the @ symbol in the command line (this means that the account ids must match). scp'ing a file from your SUSE account to your Raspberry Pi without using the @ symbol in the command line (this means that the account ids must match). Running firefox on your Raspberry Pi but displaying the window on your laptop. Homework #10 Assigned: November 29 Due: December 4, 5:05pm Total points: 35 points. (4+2=6 points) OSCJ8 8.11 on p.
388 (or exercise 8.3 on p. 342 of the 7th ed). Given five fixed memory parititons of 100k, 500k, 200k, 300k, and 600k (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of (p 1) 212k, (p 2) 417k, (p 3) 112k, and (p 4) 426k (in order)?
Which algorithm makes the most efficient use of memory?. (2+2+2=6 points) OSCJ8 exercise 8.13 on pp.
388-389 (or exercise 8.5 on p. 343 of the 7th ed).
Compare the main memory organization schemes of contiguous-memory allocation, pure paging, and pure segmentation with respect to the following issues:. external fragmentation.
internal fragmentation. ability to share code across processes Specifically, complete the following table: external fragmentation internal fragmentation sharing code contiguous-memory allocation pure paging pure segmentation paged segmentation. (2+3=5 points) OSCJ8 exercise 8.20 on pp.
389-390 (or exercise 8.9 on p. 343 of the 7th ed). Consider a paging system with the page table stored in main memory. If a memory reference takes 200 ns, how long does a paged memory reference take?.
If we add a TLB, and 75% of all page-table references are found in the TLB, what is the effective memory reference time? You may assume that finding a page-table entry in the TLB takes zero time if the entry is present (an unrealistic assumption).
(2 points) How much total memory is required to store the page table on a computer with a 64-bit logical address space, a page size of 8kB, where each page table entry occupies 8 bytes?. (2+2=4 points) OSCJ8 Exercise 8.19 on p. Consider a computer system with a 32-bit logical address space and a 4kB page size. The system has 512MB of physical memory. How many entries are there in each of the following?.
(2 points) a conventional single-level page table. (2 points) an inverted page table. (2+2=4 points) Consider a computer system with a 4-bit logical address space, a page size of 4 bytes, and 32 bytes of physical memory. Translate the following relative addresses (in binary) to physical addresses (in binary). The page table follows. (2 points) 00011. (2 points) 00110 0 5 1 6 2 1 3 2.
(1+1+1=3 points) Consider a computer system with a 32-bit logical address space, and a page size of 4kB, where each entry in the page table occupies 4 bytes. Since the entire page table will not fit into one page (i.e., 2 32⁄ 2 12 × 2 2 = 2 22 2 12 page size), we must page the page table into a two-level page table scheme. So instead of logical addresses being ( p, d) pairs, they will be ( s, p, d) triples.
If we want the inner page table to fit exactly into one page, how many bits of the 32 bits available for a logical address must be allocated for each of the three components to the logical address. To provide your answer fill in the table below. Section page offset (displacement) bits bits bits. (1+1+1+1+1=5 points) OSCJ8 exercise 8.23 on p. 390 (or exercise 8.12 on p.
344 of the 7th ed). Consider the following segment table: segment base length 0 219 600 1 2300 14 2 90 100 3 1327 580 4 1952 96 What are the physical addresses for the following logical addresses?. 0,430. 1,10.
2,500. 3,400. 4,112. Midterm Project Assigned: September 27 +20 points Extra Credit Due: October 18, 11:59pm Due: October 25, 5:05pm Total points: 80 points Problem Design and implement a program (in any language) that simulates some of the job and CPU scheduling of a time-shared operating system. Detailed Description and Requirements When jobs initially arrive in the system, they are put on the job scheduling queue which is maintained in FIFO order. The job scheduling algorithm is run when a job arrives or terminates. Job scheduling allows as many jobs to enter the ready state as possible given the following restriction: a job cannot enter the ready state if there is not enough free memory to accommodate that job's memory requirement.
Do not start a job unless it is the first job on the job scheduling queue. When a job terminates, its memory is released, which may allow one or more waiting jobs to enter the ready state. A job can only run if it requires less than or equal to the system's main memory capacity. The system has a total of 512 blocks of usable memory. If a new job arrives needing more than 512 blocks, it is rejected by the system with an appropriate error message. Rejected jobs do not factor into the final statistics (described below).
Note that all jobs in the ready state must fit into available main memory. Process scheduling is managed as a multilevel feedback queue.
The queue has two levels, each queue is organized as a FIFO, and both use a round robin scheduling technique. New jobs are put on the first level when arriving in the ready state. When a job from the first level is given access to the CPU, it is allowed a quantum of 100 time units. If it exceeds that time quantum, it is preempted and moves to the second level. The jobs on the second level may only be allocated the CPU if there are no jobs on the first level. When a job on the second level is given access to the CPU, it is allowed a quantum of 300 time units. If it exceeds that, it is preempted and put back on the second level of the ready queue.
Process scheduling decisions are made whenever any process leaves the CPU for any reason (e.g., expiration of a quantum or job termination). When a job terminates, do job scheduling first, then process scheduling. Also, give preference to first level jobs (i.e., if a job from the second level of the ready queue is running, and a new job enters the first level, the running job is preempted to the second level in favor of the first level job). While executing on the CPU, a job may require I/O, which preempts it to the I/O wait queue for the duration of its I/O burst.
When a job completes, put it on a finished list for later processing. The simulator is driven by the events read from standard input. Examples of possible events are given below. The first field will be the first character of the line, and subsequent fields will be separated by one of more spaces or tabs. The header of each field in the following examples does not appear in the input stream. A new job arrives: Event Time Job Memory Run Time A 140 Interpretation: job 12 arrives at time 140, requires 24 blocks of memory and uses the CPU for a total of 2720 time units.
A job needs to perform I/O: Event Time I/O Burst Time I 214 85 Interpretation: the job currently running on the CPU will not finish its quantum because at time 214 it needs to perform I/O for a duration of 85 time units. Display the status of the simulator: Event Time D 214 Interpretation: display the status of the simulator at time 214. You may assume that events appear on the input stream in ascending time order.
However, realize that the events given in the input stream are not only events which your simulator must handle. For instance, a time quantum expiration is not an event given in the input stream, but it is an event which your simulator must handle. Furthermore, an internal event, such as a time quantum expiration, not in the input stream, may occur at the same time as an event in the input stream (e.g., a new job arrival). Events in the input stream are external events.
The following is a list of internal events (i.e., not given on the input stream) which your simulator must handle:. I/O completion (C). time quantum expiration (E). job termination (T) Assume that context switching and displays take no simulator time (an unrealistic assumption in a real operating system). When a display is requested, print the contents of all queues as well as the job currently running on the CPU to standard output using only the format used in the sample output given below.
After processing all jobs, write the following to standard output (in this order, as shown on the sample output given below):. completion time for each job (in order of completion),. average turnaround time (where turnaround time is defined as completion time minus arrival time), and. average job scheduling wait time (where wait time is defined as the number of time units spent in the job scheduling queue). Event Collisions Often more than one event happen at the same time.
Use the following rules to determine which events to process first:. If an internal event (e.g., an event not on the input stream such as time slice expiration, I/O completion, or job termination) and an external event (i.e., an event given explicitly on the input stream) happen at the same time, process the internal event first. Architectural View of the Simulator Additional Requirements. Your system must be developed and run on your Raspberry Pi. Mutliple programming languages are available on the Pi (C, C, Java, Python, Perl, Go, etc.) through sudo apt-get install. Your implementation must be distributed across more than one source code file, in some sensible manner which reflects the logical purpose of the various components of your design, to encourage problem decomposition and modular design. Include a README file in your submission which describes (i) the language you used to develop your program and (ii) the name of the compiler or interpreter which you used to compile or interpret your program.
Hints and notes. You are advised to define a PCB (process control block) structure and use it as a node in the various queues of your simulator. When debugging your simulator, you are advised to add extra display events to the sample input to trace the movement of jobs throughout the various queues of the system. You are advised to organize jobs on the I/O wait queue in the order in which they are scheduled to come off (i.e., make the I/O queue a priority queue) to obviate having to search the queue for the next job to come off of it every time an I/O operation completes. Since this program involves so many queues (I count 5), you are advised to use a programming language which has list operations built into the language, such as Python, or one which provides a queue data structure in a standard library, such as Java or C. You are advised against re-inventing the wheel.
You are also advised against using this project as an opportunity to learn a new language. Use tools with which you are already familiar and focus on the operating systems aspects of the project. If designed properly, the program required to solve this project should occupy no more than 1,000 lines of code (or less if you use built-in data structures or data structures from libraries). Watch a YouTube video demo of this project. Test data: sample input and output streams. (only events A & D, & E & T) and.
(all events A, I, & D, & E, C, & T) and This test data is available at /home/peruginicps356/share/project/. At first, simply try to get only one job through your system; see the test file /home/peruginicps356/share/project/testdata/one.txt. Once you are confident that your system processes only one job properly, try to get two jobs through the system; see the test file /home/peruginicps356/share/project/testdata/two.txt While developing your simulator, you are encouraged to get it to work on the simple test input first ( p2d.dat) and progressively enhance and refine your system to the point where it works on the most complex test input ( p2a.dat). Use the Linux diff utility to compare your output to the correct output. For full credit, the output produced by your program must have zero differences, as defined by diff, with the output posted here. There is also a reference executable of a solution for this project available at /home/peruginicps356/share/project/OSsim.
How to submit Note: All directory and filenames below are case-sensitive. You must use the directory and filenames exactly as shown below, (i.e., all lower case). Prepare your submission file as /home/ /project/project.tar. This archive must contain only the most minimal set of files necessary to build your simulator from scratch. Only the file /home/ /project/project.tar will be electronically collected from your account on the deadline.
Failure to follow these submission requirements will result in a 10% penalty. FAQ.
How do a create my tar file? The requirements require you to make a.tar and place it in /home/ /project/project.tar. A tar file is a single file that contains a packaged up files and/or directories.
The command to make a tar file on UNIX systems (Mac OS X and Linux) is as follows: tar cvf project.tar or tar cvf project.tar Be very careful to ensure the file name after the cvf is the name of the tar file. If you run the command as follows, you will overwrite one of your source files! Tar cvf Main.java Scheduler.java Types.java The command to untar a tar file is as follows: tar xvf project.tar This will create the directory structure with all the files indicated by project.tar. I developed my project on Windows using and IDE. What should I do? Some of you may work locally on your personal computer in some IDE. To upload your code from your computer to the suse server you can either copy and paste the contents of a file into a file on the server or you can use a secure copy program.
To transfer files to and from your account, use a secure file transfer program such as. You can also use PSCP or PSFTP available for free download from the. For Windows users you will need to download. You will need to have the pscp.exe or psftp.exe in your CMD path (system environment variable PATH) or in your current working directory for this command to work or you will have to specify the path to pscp in the command ( C: putty pscp.exe for example).
Below is an example of the command: pscp.exe -r @cpssuse04.cps.udayton.edu:/home//project/ For Mac OS X and Linux users, there is a command built into your terminal called scp (for secure co py. The format of this command is: scp -r @cpssuse04.cps.udayton.edu:/home//project/ Lastly, it is strongly recommended that you make multiple copies of your project. This will allow you to revert changes if something accidentally gets overwritten. Evaluation Ninety percent of your score will come from correctness and 10% of your score will come from following our. Applicable submission penalties will then be applied.
In an effort to award partial credit to students who are unable to complete certain parts of this project, students earn up to two different portions of the 70 possible points for correctness:. If your program produces this exactly when run on (only events A, I, & D, & T, E, & C), you can only earn up to 70 points. If your program produces this exactly when run on (only events A & D, & T & E), you can only earn up to 45 points. If you have this part of the homework complete, and working perfectly, early, you will earn +20 points of extra credit.
If your program does not produce this exactly when run on, you will not earn any points. If your program does not compile or execute without errors or warnings, you will not earn any points.
Note: Depending on how you order the jobs on your I/O wait queue, your dump of the jobs waiting for I/O may not match our output exactly, and for just that queue, that is acceptable. For instance, you might organize your I/O wait queue as a priority queue where the job which comes off first is at the head, or you might maintain jobs on the I/O wait queue in the order in which they are put on and then search for the job to take off when the I/O is complete. Evaluation Criteria ( point values below are approximate) Component Quantity Points per Total points Homeworks 10 varies (33 EC) 245 Midterm Project 1 80 80 Labs Exams & Quizzes 3 125 375 Final exam (comprehensive) 1 300 300 Total: 1,000 Homeworks involves analytical, theoretical, and programming exercises.
The programming requires a fair amount of critical thought and design, and approximately 500-1000 lines of code. To prepare students for the realities of computer science problems in industry and graduate school (and beyond) this course encourages (and rewards) self-reliance and independent, self-directed work. Handwritten assignments are not accepted. Assignments are due at 3:35pm in class. Late assignments are not accepted. No exceptions. All exams are in-class, closed-book, and closed-notes.
Attendance is mandatory at all examinations; make-ups are not given. Any missed examination will result in a zero. Make no assumptions about anything; always consult the instructor first. Final letter grades of A, A-, B+, B, B-, C+, C, C-, and D start approximately at 93, 90, 87, 83, 80, 77, 73, 70, and 60 percent, respectively. Workload CPS 356 is a challenging course and moves at a very fast pace. Spending a minimum of 9 hours outside of class each week reading, studying, and programming is required.
I advise you to see me to discuss any problems you may have before you are evaluated. Having said this, CPS 356 is exciting, fun, and essential. The advent of multi-core processors on the desktop makes mastery of core operating system concepts and concurrent programming more necessary than ever for the modern computer scientist. Classroom & Course Policies Students are expected to conduct themselves with respect, integrity, and virtue. Keep phones and similar devices in a silent mode and put away during class (i.e., out of sight). The use of laptop computers and similar devices is not permitted in class. Audio or video recording of any kind in class is strictly prohibited.
Audio or video recording of any kind is strictly forbidden in class. Every three times you are found using a phone or device in class will result in a full letter grade drop (e.g., if your final weighted average corresponds to a B and you had your phone out 3 times, you will get a C; 6 times, you will get a D, and so on). Photos (e.g., taken from a cell phone) of the projector screen or other course materials is prohibited. No credit is given for a program that does not compile, not even style points.
Cmi Library Catalog Details For: Mac Os X Internals : A Systems System
No credit is given for a particular test case if the program crashes for that particular test case. Not all exams or quizzes may be returned to all students. Headphones are not to be worn in class or during exams or quizzes. If an exam or quiz or other assignment is not turned in when the allotted time is expired as announced by the instructor, the exam or quiz will not be graded and will be scored as a 0. No exemptions. No makeups are given on exams or quizzes. No exemptions.
Every student will be required to submit a signed and dated Honor Code Pledge on the first day of class. The first offense of academic dishonesty will result in a doubly-weighted zero; the second offense is an automatic F in the course. Every student is not garanteed to receive the same exam. Every three classes missed results in a full letter grade drop (e.g., if your final weighted average corresponds to a B and you missed 3 classes, you will get a C; 6 classes, you will get a D, and so on).
Every three late arrivals to class results in a full letter grade drop (e.g., if your final weighted average corresponds to a B and you arrived late to 3 classes, you will get a C; 6 classes, you will get a D, and so on). If you leave the classroom for any reason during an exam or quiz, you must leave your cell phones, tablets, and other devices at the podium. You may only dispute your grade on a particular assignment, exam, or quiz within ten business days from the time it was returned or released (not from the time you actually picked it up or learned your grade). No grades will be changed after 10 days. Academic Integrity To achieve the course objectives, homework assignments must be a sole result of your work, not be shared with other students, and prepared in accordance with the University Honor Pledge (see below).
Moreover, you may not plagiarize code from any, cited or uncited, textbooks, online resources, or other authors. There is no team, group-work assignments in this class. Discussions among classmates must never include pending assignments. No exemptions. All questions and comments about a pending assignment must only be directed to the instructor and teaching assistants. Evidence indicating a violation of this policy will be handled according to the and result in a doubly-weighted zero which will not be dropped (e.g., if the assignment is worth 100 points, you receive a 0/200) or a zero on the next exam. Make no assumptions about this policy; always consult the instructor first.
No student should ever feel that they must resort to academic dishonesty. You are encouraged to consult the instructor if you are struggling with the course or an assignment.
No grade is worth your integrity. Honesty in your academic work will develop into professional integrity. The faculty and students of the University of Dayton will not tolerate any form of academic dishonesty. As listed in the section of the Undergraduate Catalog applies in full to this course. Honor code FAQ.
Q: Can I work with another student on design as long as we code up our design individually? Design is as important, if not more, to the solution as implementation. Design and implementation must be a solely result of your individual work. Q: I copied/used some code from a website or book or another resource. Is that okay?.
Q: I copied/used some code from a website or book or another resource, but I cited the source. That's not plagiarism, right? A: In this class, copying/using code from any cited or uncited resource is not permitted, even if cited. You must write your own programs. Q: But I wasn't sure that what I did was plagiarism or a violation of the honor code as applied to this class. Now I understand the honor code so I will not do it again.
A: When in doubt, always contact the instructor for clarification first, before the assignment due date. The time to understand how the honor code applies to this class must be done before an assignment, not after. Ask the instructor, early and often. Q: But my other professors encourage us to use stack overflow, bitbucket, and github to re-use code.
A: Other professors' policies do not apply to this course. Q: Do you really submit Honor Code Violation Incident Reports to the University.
A: Yes, and do not expect any warnings. Other Helpful. Quick Reference Sheets:. Practice problems: see conceptual and programming exercises in LP and PLCI (Chapter 14); (outdated, but still relevant). Grades: available in Computer accounts: Helpful links: Feedback: welcomes any feedback you may have on the course motif and approach, style of the lectures, the concepts presented in class, the course webpage, homeworks, projects, deadlines, exams, course and grading policies, or your general experience in the course. This material is based upon work supported by the National Science Foundation under Grant Number (NSF Grant Number 1712406). Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.
Last modified: ad majorem Dei gloriam.