1 / 22

Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors

Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors. Speaker: Si-Wen Hung Advisor :Dr. Sao-Jie Chen. Outline. Introduction Scheduling Classification EZ DSC Clan Comparison. Introduction. Scheduling Assign all the tasks to PE Minimize the total processing.

roderick-jake
Download Presentation

Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors

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. Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors Speaker:Si-Wen Hung Advisor:Dr. Sao-Jie Chen

  2. Outline • Introduction • Scheduling Classification • EZ • DSC • Clan • Comparison

  3. Introduction • Scheduling • Assign all the tasks to PE • Minimize the total processing

  4. Introduction • Tasks graph • Communication overhead

  5. Introduction

  6. Introduction

  7. Introduction • Tree-structured task graph

  8. Introduction • Critical path heuristic • In order to reduce the critical path by clustering • DSC • MCP • EZ

  9. Introduction • Assumptions: • Task duplication is not allowed • The number of available processors is unlimited • The task execution is triggered by the arrival of all data and at the completion of its execution the data are send in parallel to successor tasks.

  10. Algorithm.1 • Clustering steps by Sarkar’s algorithm(EZ) • Initially each task is in a separate cluster • Sort all the edges from high cost to low cost • For each edge from the sorted edge list • If set the edge to zero cost would reduce parallel time • If yes , set the two nodes of the edge to the same cluster

  11. Algorithm.1 • Example

  12. Algorithm.2 • Dominant sequence clustering algorithm (DSC) • Partial free list (PFL),Free list (FL) • Select the highest priority of node from PHL and FL • If set the node to the same cluster would reduce parallel time • If yes , set the two nodes of the edge to the same cluster • Otherwise, open new cluster for the node

  13. Algorithm.2 • Example

  14. Clan • Type • Linear • Independent • Parse Tree • Hierarchical view

  15. Clan • Parse Tree • Hierarchical view

  16. Clan • Multi-Stage Decision Graph • Find the shortest path

  17. Comparison • Granularity Analysis • 420 test graph • Speedup < 1

  18. Comparison • Normalized Relative Parallel Time • Average speed up

  19. Comparison • Efficiency of the algorithm

  20. Conclusion • Clan has high speed up ,but more complexity at low granularity • Clan is not better than other at high granularity • Clan suit the cases of wide range of granularity or low granularity

  21. References • A. Gerasoulis and T. Yang, "A Fast Static Scheduling Algorithm for DAGs on a unbounded Number of Processors," Proc. of Supercomputing'91, (Nov. 1991), pp.633-642. • T. Yang and A. Gerasoulis, "A Fast Static Scheduling Algorithm for DAGs on an Unbounded Number of Processors", Proc. Supercomputing '91, pp. 633-642 (1991). • A. A. Khan, C. L. McCreary and Y. Gong, A Numerical Comparative Analysis of Partitioning Heuristics for Scheduling Task Graphs on Multiprocessors, October 21, 1993.

  22. Another

More Related