1 / 21

Meeting Oct 24

Meeting Oct 24. Xuan Lin. Outline. Multi-round Algorithm Current work Upcoming conference. Outline. Multi-round Algorithm Current work Upcoming conference. Two main approaches. MI [Bharadwaj 1996] UMR [Y.Yang 2003]. MI. MI ’ s limitation.

tierra
Download Presentation

Meeting Oct 24

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. Meeting Oct 24 Xuan Lin

  2. Outline • Multi-round Algorithm • Current work • Upcoming conference

  3. Outline • Multi-round Algorithm • Current work • Upcoming conference

  4. Two main approaches • MI [Bharadwaj 1996] • UMR [Y.Yang 2003]

  5. MI

  6. MI’s limitation • The close-form solution is difficult to compute. • Do not consider start-up cost. • How many rounds should be used? What is the optimal time?

  7. UMR

  8. Solution of UMR

  9. Compute Nmin Using UMR • When start-up costs are ignored: - RTAS06-WIP • When start-up costs are not ignored: - Solve the equation numerically.

  10. What else? Inserted Idle Time !!!

  11. Remove Inserted Idle Time • Previous work [Bharadwaj 2003] is not applicable. • System Model is different from ours.

  12. Remove Inserted Idle Time • K-Stage • Greedy

  13. K-stage Approach

  14. K-stage Approach

  15. Greedy Approach

  16. Greedy Approach

  17. What else? • How to decide the number of nodes assigned to a task? • Approach 1- Estimation : As our previous approach, find next ti, and assume task can only begin at this time point. • Fast, but some tasks will be rejected unnecessarily.

  18. Approach 2: Dispatch and Test • Try to dispatch some workload and test at the next ti. • More accurate, but the Admission Controller will consume more CPU. • No such overhead when considering the start-up costs.

  19. Outline • Multi-round approach • Current work • Upcoming conference

  20. Current work • Effects of start-up costs. • User-split. • Multi-round • Simulation of real workload. • Theoretical results of “Different CPU Release Time”. (System Model is different)

  21. Upcoming Conference • ECRTS07 - Deadline: Jan 14 • HPDC07 (DLT community) - Deadline: Jan 15

More Related