This document discusses periodic task scheduling algorithms including time line, rate monotonic, and earliest deadline first scheduling. It provides notation for periodic tasks and assumptions made. It describes the characteristics of each scheduling algorithm, how to calculate utilization bounds, and compares fixed priority versus dynamic priority scheduling approaches.