Posted by: atri | October 22, 2011

Lect 22: Analyzing the Earliest Deadline First Algorithm

In today’s lecture, we finished the proof that the Earliest Deadline First Algorithm is optimal. Next lecture, I’ll go over the proof quickly via slides again and then start with the shortest path problem (Sec 4.4).

The slides have been uploaded.

Below are the student blog posts for the lecture:

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: