1 research outputs found
μ΄μ’ λ©ν° μ½μ΄ νλ‘μΈμμμ SDF/L κ·Έλν μ€μΌμ€λ§ κΈ°λ²
νμλ
Όλ¬Έ(μμ¬) -- μμΈλνκ΅λνμ : 곡과λν μ»΄ν¨ν°κ³΅νλΆ, 2021.8. Ha Soonhoi.Although dataflow models are known to thrive at exploiting task-level parallelism of an application, it is difficult to exploit the parallelism of data. Data-level parallelism can be represented well with loop structures, but these structures are not explicitly specified in most existing dataflow models. SDF/L model was introduced to overcome this shortcoming by specifying the loop structures explicitly in a hierarchical fashion. To the best of our knowledge however, scheduling of SDF/L graph onto heterogeneous processors has not been considered in any previous work.
In this dissertation, we introduce a scheduling technique of an application represented by the SDF/L model onto heterogeneous processors. In the proposed method, we explore the mapping of tasks using an evolutionary meta-heuristic and schedule hierarchically in a bottom-up fashion, creating parallel loop schedules at lower levels first and then re-using them when constructing the schedule at a higher level. To verify the efficiency of the proposed scheduling methodology, we apply it to benchmark examples and randomly generated SDF/L graphs.λ°μ΄ν°νλ‘μ° λͺ¨λΈμ μ ν리μΌμ΄μ
μ νμ€ν¬λ₯Ό λ³λ ¬ μ²λ¦¬ν λ μ’μ λͺ¨λΈλ‘ μλ €μ Έ μμ§λ§ λ°μ΄ν°λ₯Ό λ³λ ¬λ‘ μ²λ¦¬νλ λ°μ νμ©νκΈ°λ μ΄λ ΅λ€. λ°μ΄ν° μμ€ λ³λ ¬ μ²λ¦¬λ 루ν ꡬ쑰λ₯Ό ν΅ν΄ ννλ μ μμΌλ κΈ°μ‘΄ λ°μ΄ν°νλ‘μ° λͺ¨λΈμμ λͺ
μμ μΌλ‘ 루ν ꡬ쑰λ λͺ
μΈνλ λ°©λ²μ΄ μμλ€. μ΄λ¬ν λ¨μ μ 극볡νκΈ° μν΄ κ³μΈ΅μ ꡬ쑰λ₯Ό νμ©νμ¬ λ£¨ν ꡬ쑰λ₯Ό λͺ
μμ μΌλ‘ λͺ
μΈν μ μλ SDF/L λͺ¨λΈμ΄ μ μλμλ€. κ·Έλ¬λ μ΄κΈ°μ’
νλ‘μΈμμ λν SDF/L κ·Έλνμ μ€μΌμ€λ§μ μ΄μ κΉμ§ κ³ λ €λμ§ μμ κ²μΌλ‘ νμ
λλ€.
λ³Έ λ
Όλ¬Έμμλ SDF/L λͺ¨λΈλ‘ ννλλ μ ν리μΌμ΄μ
μ μ΄κΈ°μ’
νλ‘μΈμμ λνμ¬ μ€μΌμ€λ§νλ κΈ°λ²μ μκ°νλ€. μ μλ λ°©λ²μμλ λ¨Όμ μ§νμ λ©ν ν΄λ¦¬μ€ν±μ μ¬μ©νμ¬ νμ€ν¬ 맀νμ νμνλ€. μ΄ν νμ μμ€μμ λ³λ ¬ 루ν μ€μΌμ€μ λ§λ λ€μ μμ μμ€μμ μ€μΌμ€ ꡬμ±ν λ μ¬μ¬μ©νλ μν₯μμ κ³μΈ΅μ νμ€ν¬ μ€μΌμ€λ§μ μννλ€. μ μνλ μ€μΌμ€λ§ κΈ°λ²μ ν¨μ¨μ±μ κ²μ¦νκΈ° μν΄ λ²€μΉλ§ν¬ μμ μ 무μμλ‘ μμ±λ SDF/L κ·Έλνμ κΈ°λ²μ μ μ©νμλ€.Chapter 1 Introduction 1
Chapter 2 Related Work 6
2.1 SDF Scheduling with Data-level Parallelism 8
2.2 Hierarchical Scheduling 9
Chapter 3 Problem and Challenges 11
3.1 Notations and Problem Description 11
3.2 Challenges 12
Chapter 4 Proposed methodology 15
4.1 Mapping Exploration 15
4.2 Priority Assignment and List Scheduling Heuristic 17
4.3 Hierarchical Scheduling 18
4.4 Complexity 23
Chapter 5 Experiments 24
5.1 Benchmarks 25
5.2 Randomly Generated Graphs 30
Chapter 6 Conclusions 35
Bibliography 37
μ μ½ 41μ