Reliability-Aware Runtime Adaption Through a Statically Generated Task Schedule

Real-time task schedule problem in Chip-Multiprocessor (CMP) receives wide attention in recent years. It is partly because the increasing demand for CMP solutions call for better schedule algorithm to exploit the full potential of hardware, and partly because of the complexity of schedule problem, which itself is an NP-hard problem. To address this task schedule problem, various of heuristics have been studied, among which, Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Simulated Annealing (SA) are the most popular ones. In this paper, we implement these 3 schedule heuristics, and compare their performance under the context of real-time tasks scheduling on CMP. According to the results of our intensive simulations, PSO has the best fitness optimization of these 3 algorithms, and SA is the most efficient algorithm.

Download Full-text

Appendix: Task Schedule

The Task Planner ◽

10.7312/reid10646-007 ◽

2000 ◽

pp. 279-282

Keyword(s):

Task Schedule

Download Full-text

Concurrent reasoning of fuzzy logical Petri nets based on multi-task schedule

IEEE Transactions on Fuzzy Systems ◽

10.1109/91.928740 ◽

2001 ◽

Vol 9 (3) ◽

pp. 444-449 ◽

Cited By ~ 18

Author(s):

Huaiqing Wang ◽

Changjun Jiang ◽

Shaoyi Liao

Keyword(s):

Petri Nets ◽

Task Schedule ◽

Fuzzy Logical

Download Full-text

A Hybrid Task Schedule Algorithm for Real-Time System Employing Trusted Computing Technology

2014 Tenth International Conference on Computational Intelligence and Security ◽

10.1109/cis.2014.161 ◽

2014 ◽

Author(s):

Tingyu Jiang ◽

Yahui Li ◽

Yuan Dong

Keyword(s):

Real Time ◽

Trusted Computing ◽

Schedule Algorithm ◽

Computing Technology ◽

Time System ◽

Real Time System ◽

Task Schedule

Download Full-text

Task Scheduling Algorithm Based on Improved Min-Min Algorithm in Cloud Computing Environment

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.303-306.2429 ◽

2013 ◽

Vol 303-306 ◽

pp. 2429-2432 ◽

Cited By ~ 7

Author(s):

Guan Wang ◽

Hai Cun Yu

Keyword(s):

Cloud Computing ◽

Task Scheduling ◽

Completion Time ◽

Scheduling Algorithm ◽

Total Completion Time ◽

Computing Environment ◽

Cloud Computing Environment ◽

Task Schedule ◽

Task Scheduling Algorithm

Task schedule algorithms directly related to the speed and quality of schedule. Min-Min algorithm always completes the shortest total completion time task first, and has the characteristic of simple and shortest completion time. This paper research scheduling algorithm based on Min—Min algorithm. The result shows that the proposed algorithm is efficient in the cloud computing environment.

Download Full-text