원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
Vol.9 No.8
2016.08
pp.77-86
피인용수 : 0건 (자료제공 : 네이버학술정보)
목차
Abstract
1. Introduction
2. Our Scheme
2.1 Related Symbols and Definitions
2.2 Problem Definitions
2.3 Infrastructure of Algorithm
2.4 The Determination of Tasks Effectiveness Deadline
2.5 Preemption
2.6 Space-time Hybrid Priority Scheduling Algorithm (STS)
3. Simulations and Results Analysis
3.1 Simulation Setup
3.2 Throughput
3.3 Average Response Time
3.4 Average Length of the Waiting Queue
3.5 Success Rate
3.6 Average service time
4. Conclusions
Acknowledgement
References
1. Introduction
2. Our Scheme
2.1 Related Symbols and Definitions
2.2 Problem Definitions
2.3 Infrastructure of Algorithm
2.4 The Determination of Tasks Effectiveness Deadline
2.5 Preemption
2.6 Space-time Hybrid Priority Scheduling Algorithm (STS)
3. Simulations and Results Analysis
3.1 Simulation Setup
3.2 Throughput
3.3 Average Response Time
3.4 Average Length of the Waiting Queue
3.5 Success Rate
3.6 Average service time
4. Conclusions
Acknowledgement
References
저자정보
참고문헌
자료제공 : 네이버학술정보