Download presentation

Presentation is loading. Please wait.

Published byThalia Galler Modified over 4 years ago

1
Force Directed Scheduling Used as priority function. Force is related to concurrency. Sort operations for least force. Mechanical analogy: Force = constant displacement. constant = operation-type distribution. displacement = change in probability.

2
Force Directed Scheduling

3
Example : Operation V 6

4
Force-Directed Scheduling Algorithm (Paulin)

5
Force-Directed Scheduling Example Probability of scheduling operations into control steps Probability of scheduling operations into control steps after operation o 3 is scheduled to step s 2 Operator cost for multiplications in a Operator cost for multiplications in c

6
List Scheduling The scheduled DFG DFG with mobility labeling (inside <>) ready operation list/resource constraint

7
Static-List Scheduling DFG Partial schedule of five nodes Priority list The final schedule

Similar presentations

OK

Real-time Query Processing Roger Blake CSC 536 May 2, 2005.

Real-time Query Processing Roger Blake CSC 536 May 2, 2005.

© 2019 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google