Advanced Operating Systems   COMP9242 2002/S2

UNSW

 Printer-Friendly Version

Administration               
- Notices
- Course Intro
- Consultations
# On-line Survey (closed)
- Survey Results
 
Work
- Lectures
- Milestone 0
- Project Admin
- Project Spec
- Project FAQ
- Exam
 
Documentation
- ASysT Lab
- L4 source browser
- Sulima ISA Simulator
- R4x00 ISA Summary 
- MIPS R4700 Reference - MIPS R4000 User Manual 
- Network Driver
- GT64111
 
Related Info
- Aurema OS Prize
- OS Hall of Fame
 
History
- 2000
- 1999
- 1998
 
Staff
- Gernot Heiser (LiC)

 

Simplified Real-Time Process Model

• Fixed set of processes,
• all processes periodic with known periods ,
• processes independent (note: no IPC!),
• ignore system overheads,
• deadline, , equal to period,
• fixed (and known) worst-time execution time ,
• , , are multiples of minor cycle time .

Allows static analysis and a static schedule.

Example

Process	A	B	C	D	E
	25	25	50	50	100
	10	8	5	4	2

• Worst case if all come at once: critical instant.
• Fixed schedule covers one major cycle time .
• Schedule is just a list of executions ( ):
  A, B, C,   A, B, D, E,   A, B, C,   A, B, D.

Note: No preemption ==> no concurrency control necessary!

More flexible alternative: Use priorities

• Priorities based on timeliness requirements, not ``importance''.
• Higher-priority processes preempt lower-priority ones.

Frequently used scheme is rate-monotonic priority assignment (RMPA):

• Priority is based on period: .
• Is optimal in a sense:
  • Everything that can be scheduled can be done statically by RMPA.
  everything doable statically is doable with RMPA.