1. MTE 241 Introduction to Computer Structures and Real-time Systems
Douglas Wilhelm Harder, M.Math. LEL
Department of Electrical and Computer Engineering
University of Waterloo
Waterloo, Ontario, Canada
ece.uwaterloo.ca
© 2012 by Douglas Wilhelm Harder. Some rights reserved.

2. Course Introduction
Welcome
Welcome to MTE 241

3. Welcome Course description:
Course Introduction
Welcome
Course description:
Introduction to computer organization, basic real-time concepts, process management, interprocess communication and synchronization, memory management, resource management, interrupt handling, concurrent programming, file systems.

4. Course Text Course text:
Course Introduction
Course Text
Course text:
Gary Nutt, Operating Systems, 3rd Ed., Addison Wesley, 2004.

5. Course Topics We will cover the first thirteen chapters: Introduction
Course Introduction
Course Topics
We will cover the first thirteen chapters:
Introduction
Using the operating system
Operating system organization
Computer organization
Device management
Implementing processes, threads, and resources
Scheduling
Basic synchronization principles
High-level synchronization and interprocess communications
Deadlock
Memory management
Virtual memory
File management

6. Course Topics Topics Course Description Introduction
Course Introduction
Course Topics
Topics
Course Description
Introduction
Using the operating system
Operating system organization
Computer organization
Device management
Implementing processes, threads, and resources
Scheduling
Basic synchronization principles
High-level synchronization and interprocess communications
Deadlock
Memory management
Virtual memory
File management
Introduction to computer organization
basic real-time concepts
process management
interprocess communication
synchronization
memory management
resource management
interrupt handling
concurrent programming
file systems

7. Course Topics Of course, each topic will discuss other issues
Course Introduction
Course Topics
Of course, each topic will discuss other issues
Issues with real-time systems will be addressed throughout the course
Interrupt handling will be dealt with in numerous topics
Concurrent programming will also be an underlying theme

8. Additional Chapters Material in the balance of the book covers:
Course Introduction
Additional Chapters
Material in the balance of the book covers:
Protection and security
Networks
Remote files
Distributed computing
Distributed programming runtime systems
Design strategies
The Linux kernel
The Windows NT kernel

9. Course Laboratories There are five laboratories in this course:
Course Introduction
Course Laboratories
There are five laboratories in this course:
Laboratory “0” is next week: it does not count
I am currently looking at having Laboratories 1-4 running in weeks 6, 8, 10, and 12
Laboratories may be done in groups of two
There is no course project

10. Course Web Site The course web site: This takes you to:
Course Introduction
Course Web Site
The course web site:
This takes you to:
This contains numerous resources:
Schedule (preliminary)
Lecture slides
Tutorials
Simulations
Resources

11. Marking Scheme The marking scheme is not quite standard:
Course Introduction
Marking Scheme
The marking scheme is not quite standard:
Laboratories L
Mid-term examination M
Final examination F
Examination grade

12. Course Introduction
Marking Scheme
If L ≥ 60 and E ≥ 60, If E + L ≤ 120, G = min(L, E) If E + L > 120 but L < 60 If E + L > 120 but E < 60

13. Marking Scheme The two curves in between form a continuous surface
Course Introduction
Marking Scheme
The two curves in between form a continuous surface
An increase of 1 % in either the examination or the laboratory component will not increase your final grade by more than 1 %

14. Course Introduction
Marking Scheme
Basically, if you fail either the examination component or the laboratory component, you fail the course unless you get over 70 % in the other component, in which case, there is some grace

15. Plagiarism Detection We will be using MOSS for plagiarism detection:
Course Introduction
Plagiarism Detection
We will be using MOSS for plagiarism detection:
It is hosted at the Stanford University in California
You may request in the first two weeks to not having your submissions sent to Stanford
In this case, I will be personally inspecting your code
You may read the paper that MOSS is based on:
S. Schleimer, D.S. Wilerson, and A. Aiken, Winnowing: Local Algorithm for Document Fingerprinting
Available freely on the web for your download and perusal

16. Acceptable and Unacceptable Collaboration
Course Introduction
Acceptable and Unacceptable Collaboration
Groups should work independently on the laboratories
If a group is unable to complete a laboratory without help from just the TAs and receives help from another group:
Both the mentor and the group receiving help must acknowledge this
The group receiving help will receive a maximum grade of 85 % on the laboratory
The mentor will receive some form of bonus

17. Course Introduction
Summary
So we begin...