1 research outputs found
μ΅μ ECU보λλ₯Ό νμ©νμ¬ μννΈμλ¬λ€μ μ€μκ° λ³΅κ΅¬νλ κΈ°λ²
νμλ
Όλ¬Έ (μμ¬) -- μμΈλνκ΅ λνμ : 곡과λν μ»΄ν¨ν°κ³΅νλΆ, 2020. 8. μ΄μ°½κ±΄.This dissertation presents the fault-tolerant real-time scheduling using dynamic mode
switch support of modern ECU hardware. This dissertation first describes the optimal
capacity of the Periodic Resource which contains harmonic periodic task set using
the exact time supply function.We show that the optimal capacity can be represented
as sum of the each individual utilization of the task in the harmonic periodic task set
for both normal state(i.e. no faults) and faulty state. Then, this dissertation proposes
non-critical task overlapping technique by only using the idle time intervals of the Periodic
Resource in order to overlap the non-critical tasks which ensures no additional
capacity increase. Finally, this dissertation proposes the basic form of the Periodic
Resources in order to efficiently use the dynamic mode switch support. Next, we also
proposes the bin-packing heuristic algorithm that considers both making sub-taskset
as a one Periodic Resource and Periodic Resource wide bin-packing which has the
pseudo-polynomial time complexity. Experimental results show that the proposed
algorithm performs better than the traditional partitioned fixed-priority scheduling
approach and partitioned mixed-criticality scheduling approach. Also, the achievement
is made up to 18% in terms of the total needed cores compared to traditional
partitioned fixed-priority approach for making the given input task set schedulable.λ³Έ λ
Όλ¬Έμμλ ν¨μ¨μ μΈ μ¬κ΅¬μ±κ°λ₯ μμ€ν
μ¬μ©μ μν κ³μΈ΅κΈ°λ° μ€μκ° κ²°ν¨ κ°λ΄ μ€μΌμ€λ§ κΈ°λ²μ μ μνλ€. λ³Έ μ°κ΅¬λ μ£ΌκΈ° μμ λͺ¨λΈμ κΈ°λ°μΌλ‘, μ΅μ μ£ΌκΈ° μμ μλ²μ μ©λμ μ£ΌκΈ° μμ λͺ¨λΈμ΄ κ°μ§λ μ€μκ° μ£ΌκΈ° νμ€ν¬ μ
μ μ νΈλΌμ΄μ μ΄μ
μ ν©μΌλ‘ μ μνλ€. λ³Έ λ
Όλ¬Έμ ν΄λΉ μ΅μ μλ² μ©λμ μμ€ν
μ΄ μ μ λμν λμ μ€λμ ν λ λͺ¨λμ λν΄μ μ μνλ€. λ€μμΌλ‘, λΉμ€μ νμ€ν¬ μ
λ€μ μ€μ μ£ΌκΈ° μμ μλ²μ μ¬λΆ 곡백 μκ°μ νμ©ν΄ μλ² μ©λμ μ¦κ° μμ΄ λΉμ€μ νμ€ν¬λ₯Ό μ€μ μ£ΌκΈ° μμ μλ²μ ν λΉνλ λ°©λ²λ‘ μ μ μνλ€. λ§μ§λ§μΌλ‘ λ³Έ λ
Όλ¬Έμ μ£ΌκΈ° μμ μλ² λ¨μμ νν°μ
κΈ°λ²κ³Ό μ£ΌκΈ° νμ€ν¬λ₯Ό νλμ μ£ΌκΈ° μμ μλ²λ‘ λ§λλ λΉν¨νΉ ν΄λ¦¬μ€ν± μκ³ λ¦¬μ¦μ μ μνλ€. μ€ν κ²°κ³Ό, λ³Έ λ
Όλ¬Έμμ μ μν μκ³ λ¦¬μ¦μ κΈ°μ‘΄μ μ¬μ©λμλ νν°μ
κΈ°λ° μ°μ μμ μ€μΌμ€λ§ μκ³ λ¦¬μ¦κ³Ό νν°μ
κΈ°λ° μ°μ μμ νΌμ‘ μ€μλ μκ³ λ¦¬μ¦λ³΄λ€ λ μμ μμ μ½μ΄μ κ°μλ₯Ό λμΆ ν μ μμμ 보μΈλ€. μ€νκ²°κ³Όλ₯Ό κΈ°λ°μΌλ‘, λ³Έ μ°κ΅¬μμ μ μν μκ³ λ¦¬μ¦μ μ¬κ΅¬μ±κ°λ₯ μμ€ν
μ νμ©νλ€λ©΄ κΈ°μ‘΄ λ°©λ² λλΉ μ΅λ 18%μ μ½μ΄μ κ°ν¨κ³Όλ₯Ό κΈ°λν μ μλ€.1 Introduction 1
1.1 Motivation and Objective 1
1.2 Approach 2
1.3 Organization 6
2 System Model 7
3 Schedulability Analysis 10
3.1 Background 10
3.2 Optimal Capacity Analysis During Normal State 14
3.3 Optimal Capacity Analysis During Fault State 16
3.4 Periodic Resource Wide Schedulability Test 20
3.5 Non-Critical Task Overlapping 24
4 Proposed Approach 26
4.1 Minimum Harmonic Partitions of the Task Set 26
4.2 Proposed Heuristic Algorithm 28
4.2.1 Choosing Detection method 28
4.2.2 Packing Minimum Harmonic Partitions 29
4.2.3 Packing Free Tasks 30
4.2.4 Packing Non-Critical Tasks 31
4.3 Algorithm Description 32
5 Evaluation 35
5.1 Experimental Setup 35
5.2 Simulation Results 36
5.2.1 Free Task Bin-Packing 38
5.2.2 Minimum Harmonic Partitions Bin-Packing 40
5.2.3 Effect of Non-Critical Task Overlapping 43
5.2.4 Effect of State-Wise Computation 45
6 Related Works 46
6.1 Hierarchical Fault-Tolerant Real-Time Scheduling 46
6.2 Error Detection Method 46
7 Conclusion 48
References 50Maste