Publications
Detailed Information
System-wide Time vs. Density Tradeoff in Real-Time Multicore Fluid Scheduling : 실시간 멀티코어 플루이드 스케줄링에서 전체 시스템의 시간 · 밀도 트레이드오프
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 이창건 | - |
| dc.contributor.author | 김강욱 | - |
| dc.date.accessioned | 2017-10-27T16:44:03Z | - |
| dc.date.available | 2017-10-27T16:44:03Z | - |
| dc.date.issued | 2017-08 | - |
| dc.identifier.other | 000000146107 | - |
| dc.identifier.uri | https://hdl.handle.net/10371/136828 | - |
| dc.description | 학위논문 (박사)-- 서울대학교 대학원 공과대학 전기·컴퓨터공학부, 2017. 8. 이창건. | - |
| dc.description.abstract | Recent parallel programming frameworks such as OpenCL and OpenMP allow us to enjoy the parallelization freedom for real-time tasks. The parallelization freedom creates the time vs. density tradeoff problem in fluid scheduling, i.e., more parallelization reduces thread execution times but increases the density. By system-widely exercising this tradeoff, this dissertation proposes a parameter tuning of real-time tasks aiming at maximizing the schedulability of multicore fluid scheduling. The experimental study by both simulation and actual implementation shows that the proposed approach well balances the time and the density, and results in up to 80% improvement of the schedulability. | - |
| dc.description.tableofcontents | 1 Introduction 1
1.1 Motivation and Objective 1 1.2 Approach 3 1.3 Organization 4 2 Related Work 6 2.1 Real-Time Scheduling 6 2.1.1 Workload Model 6 2.1.2 Scheduling on Multicore Systems 7 2.1.3 Period Control 9 2.1.4 Real-Time Operating System 10 2.2 Parallel Computing 10 2.2.1 Parallel Computing Framework 10 2.2.2 Shared Resource Management 12 3 System-wide Time vs. Density Tradeoff with Parallelizable Periodic Single Segment Tasks 14 3.1 Introduction 14 3.2 Problem Description 14 3.3 Motivating Example 21 3.4 Proposed Approach 26 3.4.1 Per-task Optimal Tradeoff of Time and Density 26 3.4.2 Peak Density Minimization for a Task Group with the Same Period 27 3.4.3 Heuristic Algorithm for System-wide Time vs. Density Tradeoff 38 3.5 Experimental Results 45 3.5.1 Simulation Study 45 3.5.2 Actual Implementation Results 51 4 System-wide Time vs. Density Tradeoff with Parallelizable Periodic Multi-segment Tasks 64 4.1 Introduction 64 4.2 Problem Description 64 4.3 Extension to Parallelizable Periodic Multi-segment Task Model 70 4.3.1 Peak Density Minimization for a Task Group of Multi-segment Tasks with Same Period 71 4.3.2 Heuristic Algorithm for System-wide Time vs. Density Tradeoff 78 5 Conclusion 81 5.1 Summary 81 5.2 Future Work 82 References 84 Appendices 100 A Period Harmonization 100 | - |
| dc.format | application/pdf | - |
| dc.format.extent | 1145914 bytes | - |
| dc.format.medium | application/pdf | - |
| dc.language.iso | en | - |
| dc.publisher | 서울대학교 대학원 | - |
| dc.subject | real-time | - |
| dc.subject | multi-core scheduling | - |
| dc.subject | fluid scheduling | - |
| dc.subject | time vs. density tradeoff | - |
| dc.subject.ddc | 621.3 | - |
| dc.title | System-wide Time vs. Density Tradeoff in Real-Time Multicore Fluid Scheduling | - |
| dc.title.alternative | 실시간 멀티코어 플루이드 스케줄링에서 전체 시스템의 시간 · 밀도 트레이드오프 | - |
| dc.type | Thesis | - |
| dc.contributor.AlternativeAuthor | Kang-Wook Kim | - |
| dc.description.degree | Doctor | - |
| dc.contributor.affiliation | 공과대학 전기·컴퓨터공학부 | - |
| dc.date.awarded | 2017-08 | - |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.