Page 1

EE 472 Embedded Systems

Dr. Shwetak Patel
Assistant Professor
Computer Science & Engineering
Electrical Engineering
Agenda
Lab Reports
Shwetak N. Patel - EE 472 2
Lab Reports
Tasks and Threads
Scheduling
Algorithms
Analysis
Lab Reports
Make sure to check out lab report guidelines on class
website under Grading
Include table of contents
Make sure to include contributions page in the appendix
Make sure fonts and font sizes are consistent
Put actual code in the appendix (use pseudo code in the
text to explain algorithms)
Lab Reports
Annotate each function with a small description
// This methodflashes led 0, 1, 2 and3 at a 1 sec rate.
application1();
Include a header in your source files
/****************************************************************************
* FILE NAME : lcd.c
* DESCRIPTION : This code contains all the methods required for the LCD display.
* COURSE : EE 472 Embedded Microcomputer Systems
* LAB : LAB #1
* AUTHORS : XYZ, ABC
* DATE : Jan 28, 2011
****************************************************************************/
Upload source if you want (dont include the API files)
Page 2
Lab Reports
Things to make sure to include:
Block diagrams, schematics, etc
Your design (how you solved it)
The details are important if you did something in
a different way
How did you test it (what test cases did you use)
Explain problems and why something didnt work
Tasks
Shwetak N. Patel - EE 472 6
Unit of code (think of them as C
functions)
Periodic
Intermittent
Background
Threads
Smaller unit of computation
Ownedby a process (or task)
Shwetak N. Patel - EE 472 7
Owned by a process (or task)
Like pieces within a process or task
Smaller context
Threads
Example
Shwetak N. Patel - EE 472 8
Example
Web server
Page 3
Processes and Threads
Shwetak N. Patel - EE 472 9
Scheduler
Dispatching tasks
Whenand howlong to run a task
Shwetak N. Patel - EE 472 10
When and how long to run a task
Scheduling strategies
Real-time
Time-based
Priority
Scheduler Performance Metrics
CPU utilization (keep CPU busy)
Meet deadlines
Shwetak N. Patel - EE 472 11
Meet deadlines
Turnaround time
Throughput
Waiting time (in the queue)
Scheduling Algorithms
Time-based
First-come first-serve
Shortest job first
Round robin
Priority-based
Programmer specified
Earliest deadline
Rate monotonic
Page 4
Scheduling Algorithms
Synchronized Synchronized
Non synchronized
Preemptive
Non preemptive
Class Exercises (Diagramming)
Building a Scheduler
Page 5
Questions?
Shwetak N. Patel - EE 472 20