1 / 8

Feedback Forms and Optimal Scheduling Techniques in CSE 331 Lecture

In the lecture from October 28, 2009, for CSE 331, students are reminded to fill out feedback forms during the last five minutes of class. The lecture covers advanced scheduling techniques, specifically how to convert an optimal schedule O to O' that has no inversions. Key concepts include identifying inversions and the implications for max lateness. The session concludes with a discussion on the Shortest Path Problem and a reading assignment from section 2.5 of the [KT] textbook.

kapila
Télécharger la présentation

Feedback Forms and Optimal Scheduling Techniques in CSE 331 Lecture

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 23 CSE 331 Oct 28, 2009

  2. Feedback forms Please pick one up You will have last 5 minutes in the class to fill it in

  3. Warning I am running behind on my topics schedule I wanted to show some of the cooler stuff Will not always do COMPLETE proofs More work for YOU

  4. Last lecture Convert optimal schedule O to Ô such that Ô has no inversions (a) Exists an inversion (i,j) such that i is scheduled right before j (di > dj) (a.5) Swap i and j to get O’ Exercise: Prove by induction. No consecutive inversion  No inversions Repeat O(n2) times (b) O’ has one less inversion than O (c) Max lateness(O’) ≤ Max lateness(O)

  5. Max lateness(O’) ≤ Max lateness(O) di > dj Same lateness Same lateness O i j t3 t2 t1 O’ j i Lateness of j in O’ ≤ Lateness of j in O Lateness of i in O’ ≤ Lateness of j in O t3 - di Lateness of i in O’ = < t3 - dj = Lateness of j in O

  6. Rest of today Shortest Path Problem http://xkcd.com/85/

  7. Reading Assignment Sec 2.5of [KT]

More Related